Improved Simulation of Stabilizer Circuits

@article{Aaronson2004ImprovedSO,
  title={Improved Simulation of Stabilizer Circuits},
  author={Scott Aaronson and Daniel Gottesman},
  journal={ArXiv},
  year={2004},
  volume={quant-ph/0406196}
}
The Gottesman-Knill theorem says that a stabilizer circuit\char22{}that is, a quantum circuit consisting solely of controlled-NOT (CNOT), Hadamard, and phase gates\char22{}can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. First, by removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor of 2 increase in the number of bits needed to represent a state. We have implemented the… 

Figures from this paper

On The Complexity of Quantum Circuit Manipulation
TLDR
The stabilizer class of circuits, introduced by Daniel Gottesman, consists of quantum circuits in which every gate is a controlled-NOT, Hadamard or phase gate, and a list of transformation rules, each of which involve a constant number of gates, are addressed.
Simulation of quantum circuits by low-rank stabilizer decompositions
TLDR
A comprehensive mathematical theory of the stabilizerRank and the related approximate stabilizer rank is developed and a suite of classical simulation algorithms with broader applicability and significantly improved performance over the previous state-of-the-art are presented.
Efficient Inner-product Algorithm for Stabilizer States
TLDR
It is proved that each n-qubit stabilizer state has exactly 4(2^n - 1) nearest-neighbor stabilizer states, and is generalized to compute the inner product between two such frames.
Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the
Fast simulation of stabilizer circuits using a graph-state representation
TLDR
An algorithm for this task, which is based on the graph-state formalism, shows significant improvement in comparison to an existing algorithm, given by Gottesman and Aaronson, in terms of speed and of the number of qubits the simulator can handle.
Simulation of Quantum Circuits via Stabilizer Frames
TLDR
This work develops new data structures and algorithms that facilitate parallel simulation of realistic circuits enriched with quantum error-correcting codes and fault-tolerant procedures, and demonstrates that Quipu can be parallelized with a nontrivial computational speedup.
Quantum Advantage from Conjugated Clifford Circuits
TLDR
This work fully classify the computational power of CCCs by showing that essentially any non-Clifford conjugating unitary U can give rise to sampling tasks which cannot be simulated classically to constant multiplicative error, unless the polynomial hierarchy collapses.
Reducing the Depth of Linear Reversible Quantum Circuits
TLDR
This article minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, “CNOT+T” circuits, etc.).
Reduced quantum circuits for stabilizer states and graph states
TLDR
The subgroup structures underlying stabilizer circuits are studied and a new normal form is proposed by induction using simple conjugation rules in the Clifford group to reduce the two-qubit gate count in circuits implementing graph states.
The Classification of Stabilizer Operations over Qubits
TLDR
This is the first attempt at a quantum extension of the classification of reversible classical gates introduced by Aaronson et al., another part of an ambitious program to classify all quantum gate sets.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 122 REFERENCES
Improving Gate-Level Simulation of Quantum Circuits
TLDR
The results demonstrate that QuIDDs asymptotically outperform all other known simulation techniques and show that well-known worst-case instances of classical searching can be circumvented in many specific cases by data compression techniques.
Both Toffoli and controlled-NOT need little help to do universal quantum computing
TLDR
It is proved that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal for quantum computing.
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
TLDR
It is shown that two-bit operations characterized by 4 × 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.
Efficient Synthesis of Linear Reversible Circuits
TLDR
Simulation results show that even for relatively small n, the proposed algorithm is faster and yields more efficient circuits than the standard method, and can be interpreted as a matrix decomposition algorithm, yielding an asymptotically efficient decomposition of a binary matrix into a product of elementary matrices.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
TLDR
It is shown that single quantum bit operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne–Zeilinger (GHZ) states are sufficient to construct a universal quantum computer.
Synthesis of reversible logic circuits
TLDR
In an application important to quantum computing, the synthesis of oracle circuits for Grover's search algorithm are synthesized, and a significant improvement over a previously proposed synthesis algorithm is shown.
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.
Transformation rules for designing CNOT-based quantum circuits
This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, for any two
Fault-tolerant quantum computation with constant error
TLDR
This paper shows how to perform fault tolerant quantum computation when the error probability, q, is smaller than some constant threshold, q.. the cost is polylogarithmic in time and space, and no measurements are used during the quantum computation.
Limitations of quantum advice and one-way communication
TLDR
It is shown in three settings that quantum messages have only limited advantages over classical ones, and the polynomial method is used to give the first correct proof of a direct product theorem for quantum search.
...
1
2
3
4
5
...