• Corpus ID: 246996594

Classical simulation of quantum circuits with partial and graphical stabiliser decompositions

  title={Classical simulation of quantum circuits with partial and graphical stabiliser decompositions},
  author={Aleks Kissinger and John van de Wetering and Renaud Vilmart},
Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We show here how, by considering certain non-stabiliser entangled states which have more favourable decompositions, we can speed up these simulations. This is made possible by using the ZX-calculus, which allows us to easily find instances of these entangled states in the simplified diagram representing the quantum… 

Figures from this paper

Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
We introduce a family of ZX-calculi which axiomatise the stabiliser fragment of quantum theory in odd prime dimensions. These calculi recover many of the nice features of the qubit ZX-calculus which
Born probability estimation via gate merging and dynamic frame optimisation
Two classical sub-routines are proposed: circuit gate merging and dynamic frame optimisation, which optimise the circuit representation to reduce the sampling overhead and show that the runtimes of both sub- routines scale polynomially in circuit size and gate depth.
Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)
In this paper, we demonstrate a direct correspondence between phase-free ZX diagrams, a graphical notation for representing and manipulating a certain class of linear maps on qubits, and


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
Simulation of quantum circuits by low-rank stabilizer decompositions
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.
Improved Simulation of Stabilizer Circuits
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.
How to Simulate Quantum Measurement without Computing Marginals.
Algorithms for classically simulating measurement of an n-qubit quantum state in the standard basis, that is, sampling a bit string from the probability distribution determined by the Born rule are described and analyzed.
Reducing the number of non-Clifford gates in quantum circuits
We present a method for reducing the number of non-Clifford quantum gates, in particularly T-gates, in a circuit, an important task for efficiently implementing fault-tolerant quantum computations.
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
A simplification strategy for ZX-diagrams is given based on the two graph transformations of local complementation and pivoting and it is shown that the resulting reduced diagram can be transformed back into a quantum circuit.
ZX-calculus for the working quantum computer scientist
This review discusses Clifford computation and graphically prove the Gottesman-Knill theorem, a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and the recent completeness theorems that show that, in principle, all reasoning about quantum computation can be done using Zx-diagrams.
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.
The algorithm may serve as a verification tool for near-term quantum computers which cannot in practice be simulated by other means and can be used in practice to simulate medium-sized quantum circuits dominated by Clifford gates.
Two complete axiomatisations of pure-state qubit quantum computing
Extended versions of ZW and ZX calculus are presented, and their completeness for pure-state qubit theory is proved by a strategy that rewrites all diagrams into a normal form, thus solving two major open problems in categorical quantum mechanics.
Trading Classical and Quantum Computational Resources
A purely classical algorithm is proposed that can simulate a Pauli-based computation (PBC) on n qubits in a time $2^{c n} poly(n)$ where $c\approx 0.94$.