Ben Reichardt

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Fault-Tolerant Syndrome Extraction and Cat State Preparation with Fewer Qubits
(available as arXiv preprint)
2023-06-26Paper
Beyond Single-Shot Fault-Tolerant Quantum Error Correction
IEEE Transactions on Information Theory
2022-02-17Paper
scientific article; zbMATH DE number 6866338 (Why is no real title available?)
(available as arXiv preprint)
2018-05-03Paper
Reflections for quantum query algorithms2017-09-29Paper
Reflections for quantum query algorithms
(available as arXiv preprint)
2017-09-29Paper
Faster quantum algorithm for evaluating game trees2017-09-29Paper
Faster quantum algorithm for evaluating game trees
(available as arXiv preprint)
2017-09-29Paper
Span-program-based quantum algorithm for evaluating unbalanced formulas
Theory of Quantum Computation, Communication, and Cryptography
2015-11-20Paper
Span programs are equivalent to quantum query algorithms
SIAM Journal on Computing
2014-09-18Paper
Quantum Query Complexity of State Conversion
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
2014-07-30Paper
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
2009 50th Annual IEEE Symposium on Foundations of Computer Science
2014-07-25Paper
scientific article; zbMATH DE number 6131345 (Why is no real title available?)
(available as arXiv preprint)
2013-01-28Paper
Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
(available as arXiv preprint)
2013-01-28Paper
Span-program-based quantum algorithm for evaluating formulas
Theory of Computing
2012-09-27Paper
Span programs and quantum algorithms for \(st\)-connectivity and claw detection
Algorithms – ESA 2012
2012-09-25Paper
Any AND-OR formula of size \(N\) can be evaluated in time \(N^{1/2+o(1)}\) on a quantum computer
SIAM Journal on Computing
2011-01-17Paper
Quantum computation with Turaev-Viro codes
Annals of Physics
2011-01-12Paper
The quantum adiabatic optimization algorithm and local minima
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
2010-08-15Paper
scientific article; zbMATH DE number 5666697 (Why is no real title available?)
(available as arXiv preprint)
2010-02-05Paper
Error-detection-based quantum fault-tolerance threshold
Algorithmica
2009-08-31Paper
scientific article; zbMATH DE number 5568627 (Why is no real title available?)
(available as arXiv preprint)
2009-06-23Paper
Fault-Tolerance Threshold for a Distance-Three Quantum Code
Automata, Languages and Programming
2009-03-12Paper
scientific article; zbMATH DE number 5485521 (Why is no real title available?)2009-01-05Paper
Proof of the double bubble conjecture in \(\mathbb R^n\)
The Journal of Geometric Analysis
2008-09-02Paper
Quantum universality from magic states distillation applied to CSS codes
Quantum Information Processing
2005-11-07Paper
Proof of the double bubble conjecture in \(\mathbb{R}^4\) and certain higher dimensional cases.
Pacific Journal of Mathematics
2004-09-16Paper
scientific article; zbMATH DE number 1951608 (Why is no real title available?)2003-07-21Paper


Research outcomes over time


This page was built for person: Ben Reichardt