default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoão F. Doriguello
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Jonathan Allcock, João F. Doriguello, Gábor Ivanyos, Miklos Santha:
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits. CoRR abs/2405.06357 (2024)- [i9]João F. Doriguello, George Giapitzakis, Alessandro Luongo, Aditya Morolia:
On the practicality of quantum sieving algorithms for the shortest vector problem. IACR Cryptol. ePrint Arch. 2024: 1692 (2024) - 2023
- [i8]Srinivasan Arunachalam, João F. Doriguello
, Rahul Jain:
A note on the partition bound for one-way classical communication complexity. CoRR abs/2302.10431 (2023) - [i7]Jonathan Allcock, Jinge Bao, João F. Doriguello, Alessandro Luongo, Miklos Santha:
Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits. CoRR abs/2308.08539 (2023) - [i6]João F. Doriguello, Alessandro Luongo, Ewin Tang:
Do you know what q-means? CoRR abs/2308.09701 (2023) - [i5]João F. Doriguello, Debbie Lim, Chi Seng Pun, Patrick Rebentrost, Tushar Vaidya:
Quantum Algorithms for the Pathwise Lasso. CoRR abs/2312.14141 (2023) - 2022
- [c2]João F. Doriguello, Alessandro Luongo, Jinge Bao, Patrick Rebentrost, Miklos Santha:
Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance. TQC 2022: 2:1-2:24 - 2021
- [j1]João F. Doriguello, Ashley Montanaro:
Quantum Random Access Codes for Boolean Functions. Quantum 5: 402 (2021) - [i4]Srinivasan Arunachalam, João F. Doriguello:
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case. CoRR abs/2109.02600 (2021) - [i3]Srinivasan Arunachalam, João F. Doriguello:
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c1]João F. Doriguello, Ashley Montanaro:
Exponential Quantum Communication Reductions from Generalizations of the Boolean Hidden Matching Problem. TQC 2020: 1:1-1:16 - [i2]João F. Doriguello, Ashley Montanaro:
Exponential quantum communication reductions from generalizations of the Boolean Hidden Matching problem. CoRR abs/2001.05553 (2020) - [i1]João F. Doriguello, Ashley Montanaro:
Quantum Random Access Codes for Boolean Functions. CoRR abs/2011.06535 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
