activity
19942023
most citedQuantum Teleportation is a Universal Computational Primitive

1.9k citations · 14.2k across the 54 of their papers we have counts for

collaborators

54 papers

quant-ph2023★ 9 cited

Partial Syndrome Measurement for Hypergraph Product Codes

Noah Berthusen, Daniel Gottesman

Hypergraph product codes are a promising avenue to achieving fault-tolerant quantum computation with constant overhead. When embedding these and other constant-rate qLDPC codes int…

quant-ph2022★ 18 cited

Opportunities and Challenges in Fault-Tolerant Quantum Computation

Daniel Gottesman

I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summar…

quant-ph2019★ 1 cited

Maximally Sensitive Sets of States

Daniel Gottesman

Coherent errors in a quantum system can, in principle, build up much more rapidly than incoherent errors, accumulating as the square of the number of qubits in the system rather th…

quant-ph2016★ 31 cited

Quantum fault tolerance in small experiments

Daniel Gottesman

I discuss a variety of issues relating to near-future experiments demonstrating fault-tolerant quantum computation. I describe a family of fault-tolerant quantum circuits that can…

quant-ph2016★ 78 cited

Diagonal gates in the Clifford hierarchy

Shawn X. Cui, Daniel Gottesman, Anirudh Krishna

The Clifford hierarchy is a set of gates that appears in the theory of fault-tolerant quantum computation, but its precise structure remains elusive. We give a complete characteriz…

quant-ph2013★ 22 cited

Fault-Tolerant Quantum Computation with Constant Overhead

Daniel Gottesman

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic lim…