• Corpus ID: 15947511

The Heisenberg Representation of Quantum Computers

@inproceedings{Gottesman1998TheHR,
  title={The Heisenberg Representation of Quantum Computers},
  author={Daniel Gottesman},
  year={1998}
}
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. Unfortunately, one of the key features of quantum computers--the difficulty of describing them on classical computers--also makes it difficult to describe and understand precisely what can be done with them. A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important… 

Figures and Tables from this paper

Efficient classical simulation of noisy quantum computation
TLDR
It is proved that under general conditions most of the quantum circuits at any constant level of noise per gate can be efficiently simulated classically with the cost increasing only polynomially with the size of the circuits.
Stabilizer states, conditional Clifford operations, and their possible role in quantum computation
We work with the following (fairly standard) setting for quantum computation. The computer consists of n qudits, i.e. quantum systems with a d-dimensional Hilbert space. We will mostly focus on
High-performance QuIDD-based simulation of quantum circuits
TLDR
An improved implementation of QuIDDs is presented which can simulate Grover's algorithm for quantum search with the asymptotic runtime complexity of an ideal quantum computer up to negligible overhead.
Classical simulation of noninteracting-fermion quantum circuits
TLDR
It is shown that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension.
A quantum computer only needs one universe
Quantum computers that can be simulated classically in polynomial time
TLDR
It is shown that two-bit operations characterized by 4 \times 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynometric time.
Quantum abstract interpretation
TLDR
An abstract interpretation of quantum programs is presented and it is used to automatically verify assertions in polynomial time to let an abstract state be a tuple of projections.
Gate-level simulation of quantum circuits
TLDR
This work implemented a general-purpose quantum computing simulator in C++ called QuIDDPro and tested it on Grover's algorithm and found that it asymptotically outperforms other known simulation techniques.
Gate-level simulation of quantum circuits
TLDR
This work implemented a general-purpose quantum computing simulator in C++ called QuIDDPro and tested it on Grover's algorithm and found that it asymptotically outperforms other known simulation techniques.
Linear growth of quantum circuit complexity
The complexity of quantum states has become a key quantity of interest across various subfields of physics, from quantum computing to the theory of black holes. The evolution of generic quantum
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
TLDR
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems.
Theory of fault-tolerant quantum computation
TLDR
It is demonstrated that fault-tolerant universal computation is possible for any stabilizer code, including the five-quantum-bit code.
Perfect Quantum Error Correcting Code.
TLDR
A quantum error correction code which protects a qubit of information against general one qubit errors and encode the original state by distributing quantum information over five qubits, the minimal number required for this task.
Codes for the quantum erasure channel
TLDR
A family of quantum codes for the QEC, the quantum Bose-Chaudhuri-Hocquenghem codes, that can be efficiently decoded is introduced.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.
An unknown quantum state \ensuremath{\Vert}\ensuremath{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen
Mixed-state entanglement and quantum error correction.
TLDR
It is proved that an EPP involving one-way classical communication and acting on mixed state M (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa, and it is proved Q is not increased by adding one- way classical communication.
Class of quantum error-correcting codes saturating the quantum Hamming bound.
  • Gottesman
  • Physics, Computer Science
    Physical review. A, Atomic, molecular, and optical physics
  • 1996
TLDR
Methods for analyzing quantum error-correcting codes are developed, and these methods are used to construct an infinite class of codes saturating the quantum Hamming bound.
Quantum Error Correction and Orthogonal Geometry
A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3
Error prevention scheme with four particles.
TLDR
It is shown that a simplified version of the error correction code recently suggested by Shor exhibits manifestation of the quantum Zeno effect and protection of an unknown quantum state is achieved.
...
1
2
...