# Ben Reichardt

According to our database

Collaborative distances:

^{1}, Ben Reichardt authored at least 28 papers between 2002 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2020

Beyond single-shot fault-tolerant quantum error correction.

CoRR, 2020

2017

Overlapping Qubits.

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Fault-Tolerant Quantum Computation.

Encyclopedia of Algorithms, 2016

2014

Span Programs are Equivalent to Quantum Query Algorithms.

SIAM J. Comput., 2014

2013

Classical command of quantum systems.

Nature, 2013

A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games.

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Span-Program-Based Quantum Algorithm for Evaluating Formulas.

Theory of Computing, 2012

Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle.

Quantum Information & Computation, 2012

Fault-tolerant ancilla preparation and noise threshold lower boudds for the 23-qubit Golay code.

Quantum Information & Computation, 2012

Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection.

Proceedings of the Algorithms - ESA 2012, 2012

2011

Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas.

Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2011

Reflections for quantum query algorithms.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Faster quantum algorithm for evaluating game trees.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Quantum Query Complexity of State Conversion.

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Any AND-OR Formula of Size N Can Be Evaluated in Time N

^{1/2+o(1)}on a Quantum Computer.
SIAM J. Comput., 2010

Span programs and quantum query algorithms.

Electronic Colloquium on Computational Complexity (ECCC), 2010

Least span program witness size equals the general adversary lower bound on quantum query complexity.

Electronic Colloquium on Computational Complexity (ECCC), 2010

2009

Quantum universality by state distillation.

Quantum Information & Computation, 2009

On parallel composition of zero-knowledge proofs with black-box quantum simulators.

Quantum Information & Computation, 2009

Error-Detection-Based Quantum Fault-Tolerance Threshold.

Algorithmica, 2009

Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function.

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Fault-Tolerant Quantum Computation.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Quantum Search.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2006

Fault-Tolerance Threshold for a Distance-Three Quantum Code.

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Postselection threshold against biased noise.

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Quantum Universality from Magic States Distillation Applied to CSS Codes.

Quantum Information Processing, 2005

2004

The quantum adiabatic optimization algorithm and local minima.

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2002

Markov Truncated Differential Cryptanalysis of Skipjack.

Proceedings of the Selected Areas in Cryptography, 2002