Fetching the paper…
Reading the bibliography…
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 Calderbank-Shor-Steane (CSS) codes, a large family of quantum error correcting codes constructed from classical codes, including for example the Steane code, surface codes, and colour codes.
Good quantum error-correcting codes exist
A Robert Calderbank and Peter W Shor · 1996
Earlier work this paper cites.
Error correcting codes in quantum theory
Andrew M Steane · 1996
Earlier work this paper cites.
The heisenberg representation of quantum computers
Daniel Gottesman · 1998
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J Briegel · 2001
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Fault-tolerant quantum computation with high threshold in two dimensions
Robert Raussendorf and Jim Harrington · 2007
Earlier work this paper cites.
Interacting quantum observables
Bob Coecke and Ross Duncan · 2008
Earlier work this paper cites.
Quantum error correction and fault tolerant quantum computing
Frank Gaitan · 2008
Earlier work this paper cites.
Rewriting measurement-based quantum computations with generalised flow
Ross Duncan and Simon Perdrix · 2010
Earlier work this paper cites.
Interacting quantum observables: categorical algebra and diagrammatics
Bob Coecke and Ross Duncan · 2011
Earlier work this paper cites.
Quantum picturalism for topological cluster-state computing
Clare Horsman · 2011
Earlier work this paper cites.
Surface code quantum computing by lattice surgery
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter · 2012
Earlier work this paper cites.
Quantum error correction for beginners
Simon J Devitt, William J Munro, and Kae Nemoto · 2013
Earlier work this paper cites.
Verifying the steane code with quantomatic
R. Duncan and M. Lucas · 2013
Earlier work this paper cites.
The ZX-calculus is complete for stabilizer quantum mechanics
Miriam Backens · 2014
Earlier work this paper cites.
Interacting bialgebras are Frobenius
Filippo Bonchi, Paweł Sobociński, and Fabio Zanasi · 2014
Earlier work this paper cites.
Quantum computing by color-code lattice surgery
Andrew J Landahl and Ciaran Ryan-Anderson · 2014
Cited alongside, same era.
Depicting qudit quantum mechanics and mutually unbiased qudit theories
André Ranchin · 2014
Cited alongside, same era.
Qubit stabilizer states are complex projective 3-designs
Richard Kueng and David Gross · 2015
Cited alongside, same era.
Graphical Structures for Design and Verification of Quantum Error Correction
Nicholas Chancellor, Aleks Kissinger, Joschka Roffe, Stefan Zohren, and Dominic Horsman · 2016
Cited alongside, same era.
Interacting hopf algebras
Filippo Bonchi, Paweł Sobociński, and Fabio Zanasi · 2017
Cited alongside, same era.
Quantum error correction: an introductory guide
Joschka Roffe · 2019
Later among the works it cites.
6-qubit optimal clifford circuits
Sergey Bravyi, Joseph A Latone, and Dmitri Maslov · 2020
Later among the works it cites.
A recipe for quantum graphical languages
Titouan Carette and Emmanuel Jeandel · 2020
Later among the works it cites.
Foundations for Near-Term Quantum Natural Language Processing
Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis, and Alexis Toumi · 2020
Later among the works it cites.
Fast and effective techniques for T-count reduction via spider nest identities
Niel de Beaudrap, Xiaoning Bian, and Quanlong Wang · 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…
Poking holes and cutting corners to achieve clifford gates with the surface code
Benjamin J Brown, Katharina Laubscher, Markus S Kesselring, and James R Wootton · 2017
Cited alongside, same era.
Roads towards fault-tolerant universal quantum computation
Earl T Campbell, Barbara M Terhal, and Christophe Vuillot · 2017
Cited alongside, same era.
A universal completion of the ZX-calculus
Kang Feng Ng and Quanlong Wang · 2017
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.
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart · 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
Cited alongside, same era.
Zx-calculus and quantum stabilizer theory
Coen Borghans · 2019
Cited alongside, same era.
The ZX calculus is a language for surface code lattice surgery
Niel de Beaudrap and Dominic Horsman · 2020
Later among the works it cites.
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
Ross Duncan, Aleks Kissinger, Simon Pedrix, 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.
ZX-calculus for the working quantum computer scientist
John van de Wetering · 2020
Later among the works it cites.
There and back again: A circuit extraction tale
Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice, Leo Lobski, and John van de Wetering · 2021
Later among the works it cites.
Hadamard-free circuits expose the structure of the clifford group
Sergey Bravyi and Dmitri Maslov · 2021
Later among the works it cites.
Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
Aleks Kissinger and John van de Wetering · 2021
Later among the works it cites.
Relating Measurement Patterns to Circuits via Pauli Flow
Will Simmons · 2021
Later among the works it cites.
String diagram rewrite theory I: Rewriting with Frobenius structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, and Fabio Zanasi · 2022
Closest in time.
Qudit lattice surgery
Alexander Cowtan · 2022
Closest in time.
Classical simulation of quantum circuits with partial and graphical stabiliser decompositions
Aleks Kissinger, John van de Wetering, and Renaud Vilmart · 2022
Closest in time.