Search Results for author: Daniel Gottesman

Found 6 papers, 3 papers with code

Improved Simulation of Stabilizer Circuits

11 code implementations25 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

Quantum Teleportation is a Universal Computational Primitive

no code implementations2 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

The Heisenberg Representation of Quantum Computers

2 code implementations1 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

Stabilizer Codes and Quantum Error Correction

2 code implementations28 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

A Theory of Fault-Tolerant Quantum Computation

no code implementations12 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

A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound

no code implementations29 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

Cannot find the paper you are looking for? You can Submit a new open access paper.