Fetching the paper…
Reading the bibliography…
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 ZX-calculus.
Applications of negative dimensional tensors
Roger Penrose · 1971
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Dagger compact closed categories and completely positive maps
Peter Selinger · 2007
Earlier work this paper cites.
Interacting quantum observables
Bob Coecke and Ross Duncan · 2008
Earlier work this paper cites.
Simulating Quantum Computation by Contracting Tensor Networks
Igor L. Markov and Yaoyun Shi · 2008
Earlier work this paper cites.
Quantum computation and quantum information
M. A. Nielsen and Isaac L. Chuang · 2010
Earlier work this paper cites.
Quantum algorithms for highly non-linear boolean functions
Martin Rötteler · 2010
Earlier work this paper cites.
Interacting quantum observables: categorical algebra and diagrammatics
Bob Coecke and Ross Duncan · 2011
Earlier work this paper cites.
Exact synthesis of multiqubit clifford+ t circuits
Brett Giles and Peter Selinger · 2013
Earlier work this paper cites.
Low-overhead constructions for the fault-tolerant Toffoli gate
Cody Jones · 2013
Earlier work this paper cites.
The ZX-calculus is complete for stabilizer quantum mechanics
Miriam Backens · 2014
Earlier work this paper cites.
An algorithm for the t-count
David Gosset, Vadym Kliuchnikov, Michele Mosca, and Vincent Russo · 2014
Earlier work this paper cites.
Improved classical simulation of quantum circuits dominated by Clifford gates
Sergey Bravyi and David Gosset · 2016
Earlier work this paper cites.
Improved classical simulation of quantum circuits dominated by clifford gates
Sergey Bravyi and David Gosset · 2016
Earlier work this paper cites.
Trading classical and quantum computational resources
Sergey Bravyi, Graeme Smith, and John A Smolin · 2016
Earlier work this paper cites.
Supplementarity is necessary for quantum diagram reasoning
Simon Perdrix and Quanlong Wang · 2016
Cited alongside, same era.
Picturing Quantum Processes
Bob Coecke and Aleks Kissinger · 2017
Cited alongside, same era.
Efficient classical simulation of noisy quantum computation
Xun Gao and Luming Duan · 2018
Cited alongside, same era.
Two complete axiomatisations of pure-state qubit quantum computing
Amar Hadzihasanovic, Kang Feng Ng, and Quanlong Wang · 2018
Cited alongside, same era.
An efficient quantum compiler that reduces T count
Luke E Heyfron and Earl T Campbell · 2018
Cited alongside, same era.
A Complete Axiomatisation of the ZX-calculus for Clifford+T Quantum Mechanics
Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart · 2018
Completeness of the ZH-calculus
Miriam Backens, Hector Miller-Bakewell, Aleks Kissinger, and John van de Wetering · 2020
Later among the works it cites.
Phase Gadget Synthesis for Shallow Circuits
Alexander Cowtan, Silas Dilkes, Ross Duncan, Will Simmons, and Seyon Sivarajah · 2020
Later among the works it cites.
A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
Alexander Cowtan, Will Simmons, and Ross Duncan · 2020
Later among the works it cites.
Techniques to Reduce π / 4 \pi/4 -Parity-Phase Circuits, Motivated by the ZX Calculus
Niel de Beaudrap, Xiaoning Bian, and Quanlong Wang · 2020
Later among the works it cites.
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
Ross Duncan, Aleks Kissinger, Simon Perdrix, and John van de Wetering · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Diagrammatic Reasoning Beyond Clifford+T Quantum Mechanics
Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart · 2018
Cited alongside, same era.
T-count optimization and Reed-Muller codes
Matthew Amy and Michele Mosca · 2019
Cited alongside, same era.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al · 2019
Cited alongside, same era.
ZH: A complete graphical calculus for quantum computations involving classical non-linearity
Miriam Backens and Aleks Kissinger · 2019
Cited alongside, same era.
Simulation of quantum circuits by low-rank stabilizer decompositions
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2019
Cited alongside, same era.
Graphical fourier theory and the cost of quantum addition
Stach Kuijpers, John van de Wetering, and Aleks Kissinger · 2019
Cited alongside, same era.
Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, Mario Szegedy, Yaoyun Shi, and Jianxin Chen · 2020
Later among the works it cites.
PyZX: Large Scale Automated Diagrammatic Reasoning
Aleks Kissinger and John van de Wetering · 2020
Later among the works it cites.
Reducing the number of non-Clifford gates in quantum circuits
Aleks Kissinger and John van de Wetering · 2020
Later among the works it cites.
Improved Strong Simulation of Universal Quantum Circuits
Lucas Kocia · 2020
Later among the works it cites.
Hypergraph simplification: Linking the path-sum approach to the ZH-calculus
Louis Lemonnier, John van de Wetering, and Aleks Kissinger · 2020
Later among the works it cites.
ZX-calculus for the working quantum computer scientist
John van de Wetering · 2020
Later among the works it cites.
https://github.com/Quantomatic/quizx
QuiZX: a quick Rust port of PyZX, 2021 · 2021
Closest in time.
Simulating the Sycamore quantum supremacy circuits
Feng Pan and Pan Zhang · 2021
Closest in time.
Improved upper bounds on the stabilizer rank of magic states
Hammam Qassim, Hakop Pashayan, and David Gosset · 2021
Closest in time.