default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBen Reichardt
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Prithviraj Prabhu, Ben W. Reichardt:
Fault-tolerant syndrome extraction and cat state preparation with fewer qubits. Quantum 7: 1154 (2023)- 2022
- [j11]Nicolas Delfosse
, Ben W. Reichardt, Krysta M. Svore:
Beyond Single-Shot Fault-Tolerant Quantum Error Correction. IEEE Trans. Inf. Theory 68(1): 287-301 (2022) - 2021
- [c15]Prithviraj Prabhu, Ben W. Reichardt:
Fault-Tolerant Syndrome Extraction and Cat State Preparation with Fewer Qubits. TQC 2021: 5:1-5:13 - 2020
- [i5]Nicolas Delfosse, Ben W. Reichardt, Krysta M. Svore:
Beyond single-shot fault-tolerant quantum error correction. CoRR abs/2002.05180 (2020) - [i4]Nicolas Delfosse, Ben W. Reichardt:
Short Shor-style syndrome sequences. CoRR abs/2008.05051 (2020)
2010 – 2019
- 2017
- [c14]Rui Chao, Ben W. Reichardt, Chris Sutherland, Thomas Vidick:
Overlapping Qubits. ITCS 2017: 48:1-48:21 - 2016
- [r3]Ben W. Reichardt:
Fault-Tolerant Quantum Computation. Encyclopedia of Algorithms 2016: 745-749 - 2014
- [j10]Ben W. Reichardt:
Span Programs are Equivalent to Quantum Query Algorithms. SIAM J. Comput. 43(3): 1206-1219 (2014) - 2013
- [j9]Ben W. Reichardt, Falk Unger, Umesh V. Vazirani:
Classical command of quantum systems. Nat. 496(7446): 456-460 (2013) - [c13]Ben W. Reichardt, Falk Unger, Umesh V. Vazirani:
A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games. ITCS 2013: 321-322 - 2012
- [j8]Ben W. Reichardt:
Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle. Quantum Inf. Comput. 12(9-10): 876-892 (2012) - [j7]Adam Paetznick, Ben W. Reichardt:
Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code. Quantum Inf. Comput. 12(11-12): 1034-1080 (2012) - [j6]Ben Reichardt, Robert Spalek:
Span-Program-Based Quantum Algorithm for Evaluating Formulas. Theory Comput. 8(1): 291-319 (2012) - [c12]Aleksandrs Belovs, Ben W. Reichardt:
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection. ESA 2012: 193-204 - 2011
- [c11]Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy:
Quantum Query Complexity of State Conversion. FOCS 2011: 344-353 - [c10]Ben Reichardt:
Faster quantum algorithm for evaluating game trees. SODA 2011: 546-559 - [c9]Ben Reichardt:
Reflections for quantum query algorithms. SODA 2011: 560-569 - [c8]Ben W. Reichardt:
Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas. TQC 2011: 73-103 - 2010
- [j5]Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang:
Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer. SIAM J. Comput. 39(6): 2513-2530 (2010) - [i3]Ben Reichardt:
Least span program witness size equals the general adversary lower bound on quantum query complexity. Electron. Colloquium Comput. Complex. TR10 (2010) - [i2]Ben Reichardt:
Span programs and quantum query algorithms. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j4]Ben Reichardt:
Error-Detection-Based Quantum Fault-Tolerance Threshold. Algorithmica 55(3): 517-556 (2009) - [j3]Rahul Jain, Alexandra Kolla, Gatis Midrijanis, Ben W. Reichardt:
On parallel composition of zero-knowledge proofs with black-box quantum simulators. Quantum Inf. Comput. 9(5&6): 513-532 (2009) - [j2]Ben W. Reichardt:
Quantum universality by state distillation. Quantum Inf. Comput. 9(11&12): 1030-1052 (2009) - [c7]Ben Reichardt:
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function. FOCS 2009: 544-551 - [i1]Ben W. Reichardt:
Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function. CoRR abs/0904.2759 (2009) - 2008
- [c6]Ben Reichardt, Robert Spalek:
Span-program-based quantum algorithm for evaluating formulas. STOC 2008: 103-112 - [r2]Lov K. Grover, Ben Reichardt:
Quantum Search. Encyclopedia of Algorithms 2008 - [r1]Ben Reichardt:
Fault-Tolerant Quantum Computation. Encyclopedia of Algorithms 2008 - 2007
- [c5]Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang:
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer. FOCS 2007: 363-372 - 2006
- [c4]Ben Reichardt:
Postselection threshold against biased noise. FOCS 2006: 420-428 - [c3]Ben Reichardt:
Fault-Tolerance Threshold for a Distance-Three Quantum Code. ICALP (1) 2006: 50-61 - 2005
- [j1]Ben W. Reichardt:
Quantum Universality from Magic States Distillation Applied to CSS Codes. Quantum Inf. Process. 4(3): 251-264 (2005) - 2004
- [c2]Ben Reichardt:
The quantum adiabatic optimization algorithm and local minima. STOC 2004: 502-510 - 2002
- [c1]Ben Reichardt, David A. Wagner:
Markov Truncated Differential Cryptanalysis of Skipjack. Selected Areas in Cryptography 2002: 110-128
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-04-24 23:10 CEST 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:
