Fast simulation of stabilizer circuits using a graph-state representation

@article{Anders2006FastSO,
  title={Fast simulation of stabilizer circuits using a graph-state representation},
  author={Simon Anders and Hans J. Briegel},
  journal={Physical Review A},
  year={2006},
  volume={73},
  pages={22334}
}
According to the Gottesman-Knill theorem, a class of quantum circuits\char22{}namely, the so-called stabilizer circuits\char22{}can be simulated efficiently on a classical computer. We introduce an algorithm for this task, which is based on the graph-state formalism. It 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. We also present an implementation. 

Figures from this paper

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.
Classical Ising model test for quantum circuits
We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The
Normalizer Circuits and Quantum Computation
TLDR
An efficient formalism for simulating families of quantum circuits, that are non-universal but comprise important quantum gates such as QFT or CNOT, is developed and used to design new algorithms that provide quantum speedups.
Improved graph formalism for quantum circuit simulation
TLDR
A new way to express stabilizer states is explored and an improved algorithm for graph state stabilizer simulation is developed and limitations on reducing the quadratic runtime of applying controlled-Pauli Z gates are established.
Simulating Special but Natural Quantum Circuits
TLDR
Any algorithm in this class that measures at most O(log n) qubits can be simulated by classical randomized polynomial time algorithms, which does not dequantize Shor's algorithm but highlights a new potentially hard function for cryptographic applications.
A multilayer multi-configurational approach to efficiently simulate large-scale circuit-based quantum computers on classical machines.
TLDR
The present simulations demonstrate how quantum algorithms in low-entropy regimes can be used efficiently on classically simulated quantum computers.
Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation.
TLDR
This work designs new, more efficient data structures and algorithms for beyond-stabilizer simulation using superpositions of stabilizer states, and demonstrates a parallel version of Quipu that achieves a computational speedup.
Fast simulation of planar Clifford circuits
TLDR
This work improves known classical algorithms with cubic runtime by providing a classical algorithm with runtime scaling asymptotically as n^{\omega/2}<n^{1.19}$ which samples from the output distribution obtained by measuring all £n qubits of a planar graph state in given Pauli bases.
Efficient Entanglement Measure for Graph States
TLDR
The purpose is to classify simple graphs of up to seven qubits into 45 categories using the concept of connected, non-isomorphic, and non-LC-equivalent graphs according to several relevant physical properties for quantum information theory.
On the geometry of stabilizer states
TLDR
This work characterize and count nearest-neighbor stabilizer states, quantify the distribution of angles between pairs of stabilizerStates, study succinct stabilizer superpositions and stabilizer bivectors, explore the approximation of non-stabilizer states by single stabilizers states and short linear combinations of stabiliser states, and develop an improved inner-product computation for stabilizer States via synthesis of compact canonical stabilizer circuits.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
Improved Simulation of Stabilizer Circuits
TLDR
The Gottesman-Knill theorem, which says that a stabilizer circuit, a quantum circuit consisting solely of controlled-NOT, Hadamard, and phase gates can be simulated efficiently on a classical computer, is improved in several directions.
Measurement-based quantum computation on cluster states
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster
The Heisenberg Representation of Quantum Computers
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
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Multiparticle entanglement purification for graph states.
We introduce a class of multiparticle entanglement purification protocols that allow us to distill a large class of entangled states. These include cluster states, Greenberger-Horne-Zeilinger states,
Stabilizer Codes and Quantum Error Correction
TLDR
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.
Quantum error-correcting codes associated with graphs
TLDR
It is proved necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors, which allows a simple verification of the one-error correcting property of codes of length 5 in any dimension.
Multiparty entanglement in graph states
TLDR
This work characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which it provides upper and lower bounds in graph theoretical terms.
Persistent entanglement in arrays of interacting particles.
TLDR
These states can be regarded as an entanglement resource since one can generate a family of other multiparticle entangled states such as the generalized Greenberger-Horne-Zeilinger states of <N/2 qubits by simple measurements and classical communication.
Graphs, quadratic forms, and quantum codes
TLDR
It is shown that any stabilizer code over a finite field is equivalent to a graphical quantum code and the technique used in the proof establishes a new connection between quantum codes and quadratic forms.
...
...