11 code implementations • 25 Jun 2004 • Scott Aaronson, Daniel Gottesman
Second, we show that the problem of simulating stabilizer circuits is complete for the classical complexity class ParityL, which means that stabilizer circuits are probably not even universal for classical computation.
Quantum Physics Computational Complexity
no code implementations • 2 Aug 1999 • Daniel Gottesman, Isaac L. Chuang
We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states.
Quantum Physics
2 code implementations • 1 Jul 1998 • Daniel Gottesman
Since Shor's discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest.
Quantum Physics
2 code implementations • 28 May 1997 • Daniel Gottesman
In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.
Quantum Physics
no code implementations • 12 Feb 1997 • Daniel Gottesman
In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states.
Quantum Physics
no code implementations • 29 Apr 1996 • Daniel Gottesman
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound.
Quantum Physics