Fetching the paper…
Reading the bibliography…
Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regime.
Applications of negative dimensional tensors
R. Penrose · 1971
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
B. Coecke and R. Duncan · 2008
Earlier work this paper cites.
Interacting quantum observables: categorical algebra and diagrammatics
B. Coecke and R. Duncan · 2011
Earlier work this paper cites.
Adam D Bookatz · 2012
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.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler · 2013
Earlier work this paper cites.
Quantum circuit optimization by Hadamard gate reduction
Nabila Abdessaied, Mathias Soeken, and Rolf Drechsler · 2014
Earlier work this paper cites.
Polynomial-time T-depth optimization of Clifford+ T circuits via matroid partitioning
Matthew Amy, Dmitri Maslov, and Michele Mosca · 2014
Earlier work this paper cites.
The ZX-calculus is complete for stabilizer quantum mechanics
Miriam Backens · 2014
Cited alongside, same era.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien · 2014
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.
Parallelizing quantum circuit synthesis
Olivia Di Matteo and Michele Mosca · 2016
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.
Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart · 2018
Later among the works it cites.
Diagrammatic Reasoning Beyond Clifford+T Quantum Mechanics
Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart · 2018
Later among the works it cites.
Automated optimization of large quantum circuits with continuous parameters
Yunseong Nam, Neil J Ross, Yuan Su, Andrew M Childs, and Dmitri Maslov · 2018
Later among the works it cites.
A Near-Optimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics
Renaud Vilmart · 2018
Later among the works it cites.
Towards large-scale functional verification of universal quantum circuits
Matthew Amy · 2019
Closest in time.
T-count optimization and Reed-Muller codes
Matthew Amy and Michele Mosca · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Coecke and A. Kissinger · 2017
Cited alongside, same era.
On the controlled-NOT complexity of controlled-NOT–phase circuits
Matthew Amy, Parsiad Azimzadeh, and Michele Mosca · 2018
Cited alongside, same era.
ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
Miriam Backens and Aleks Kissinger · 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.
T-par: A quantum circuit optimizer based on sum-over-paths representations
Matthew Amy
Cited in the paper.
Topt circuit optimiser
Luke Heyfron
Cited in the paper.
Closest in time.
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
Ross Duncan, Alex Kissinger, Simon Perdrix, and John van de Wetering · 2019
Closest in time.
Reducing T-count with the ZX-calculus
Aleks Kissinger and John van de Wetering · 2019
Closest in time.
Optimizing t gates in clifford+t circuit as π / 4 \pi/4 rotations around paulis
Fang Zhang and Jianxin Chen · 2019
Closest in time.