Matthew Amy
Jianxin Chen
Neil J. Ross
2018
A Finite Presentation of CNOT-Dihedral Operators
Electronic Proceedings in Theoretical Computer Science
266
84–97
10.4204/eptcs.266.5
Matthew Amy
Dmitri Maslov
Michele Mosca
2014
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
33
10
1476–1489
10.1109/TCAD.2014.2341953
Matthew Amy
Dmitri Maslov
Michele Mosca
Martin Roetteler
2013
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
32
6
818–830
10.1109/tcad.2013.2244643
Matthew Amy
Michele Mosca
2019
T-Count Optimization and Reed-Muller Codes
IEEE Transactions on Information Theory
65
8
4771–4784
10.1109/tit.2019.2906374
Panagiotis Kl Barkoutsos
Jerome F Gonthier
Igor Sokolov
Nikolaj Moll
Gian Salis
Andreas Fuhrer
Marc Ganzhorn
Daniel J Egger
Matthias Troyer
Antonio Mezzacapo
2018
Quantum algorithms for electronic structure calculations: Particle-hole Hamiltonian and optimized wave-function expansions
Physical Review A
98
2
022322
10.1103/PhysRevA.98.022322
Rodney J Bartlett
Stanislaw A Kucharski
Jozef Noga
1989
Alternative coupled-cluster ansätze II. The unitary coupled-cluster method
Chemical physics letters
155
1
133–140
10.1016/S0009-2614(89)87372-5
Niel de Beaudrap
Dominic Horsman
2017
The ZX calculus is a language for surface code lattice surgery
Proc. QPL2017
https://arxiv.org/pdf/1704.08670
Michael Beverland
Earl Campbell
Mark Howard
Vadym Kliuchnikov
2019
Lower bounds on the non-Clifford resources for quantum computations
arXiv preprint 1904.01124
M Blaauboer
RL De Visser
2008
An analytical decomposition protocol for optimal implementation of two-qubit entangling gates
Journal of Physics A: Mathematical and Theoretical
41
39
395307
10.1088/1751-8113/41/39/395307
Sergey Bravyi
Jay M Gambetta
Antonio Mezzacapo
Kristan Temme
2017
Tapering off qubits to simulate fermionic Hamiltonians
arXiv preprint 1701.08213
Sergey B Bravyi
Alexei Yu Kitaev
2002
Fermionic quantum computation
Annals of Physics
298
1
210–226
10.1006/aphy.2002.6254
Yudong Cao
Jonathan Romero
Jonathan P. Olson
Matthias Degroote
Peter D. Johnson
Mária Kieferová
Ian D. Kivlichan
Tim Menke
Borja Peropadre
Nicolas P. D. Sawaya
Sukin Sim
Libor Veis
Alán Aspuru-Guzik
2018
Quantum Chemistry in the Age of Quantum Computing
arXiv preprint 1812.09976
Bob Coecke
Ross Duncan
2011
Interacting Quantum Observables: Categorical Algebra and Diagrammatics
New J. Phys
13
043016
10.1088/1367-2630/13/4/043016
Bob Coecke
Aleks Kissinger
2017
Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning
Cambridge University Press
10.1017/9781316219317
Alexander Cowtan
Silas Dilkes
Ross Duncan
Alexandre Krajenbrink
Will Simmons
Seyon Sivarajah
2019
On the Qubit Routing Problem
Wim van Dam
Laura Mancinska
14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019)
Leibniz International Proceedings in Informatics (LIPIcs)
135
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Dagstuhl, Germany
5:1–5:32
10.4230/LIPIcs.TQC.2019.5
Ross Duncan
Aleks Kissinger
Simon Perdrix
John van de Wetering
2019
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
arXiv preprint 1902.03178
Hartmut Ehrig
Karsten Ehrig
Ulrike Prange
Gabriele Taentzer
2006
Fundamentals of Algebraic Graph Transformation
Monographs in Theoretical Computer Science
Springer Berlin Heidelberg
10.1007/3-540-31188-2
Andrew Fagan
Ross Duncan
2019
Optimising Clifford Circuits with Quantomatic
arXiv preprint 1901.10114
10.4204/eptcs.287.5
Luke E Heyfron
Earl T Campbell
2018
An efficient quantum compiler that reduces T count
Quantum Science and Technology
4
1
015004
10.1088/2058-9565/aad604
IBM Research
Qiskit
https://qiskit.org
Pascual Jordan
Eugene P Wigner
1928
About the Pauli exclusion principle
Z. Phys.
47
631–651
10.1007/BF01331938
Aleks Kissinger
Arianne Meijer-van de Griend
2019
CNOT circuit extraction for topologically-constrained quantum memories
arXiv preprint 1904.00633
Aleks Kissinger
John van de Wetering
2019
Reducing T-count with the ZX-calculus
arXiv preprint 1903.10477
Daniel Litinski
2019
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Quantum
3
128
10.22331/q-2019-03-05-128
Jarrod R McClean
Jonathan Romero
Ryan Babbush
Alán Aspuru-Guzik
2016
The theory of variational hybrid quantum-classical algorithms
New Journal of Physics
18
2
023023
10.1088/1367-2630/18/2/023023
http://stacks.iop.org/1367-2630/18/i=2/a=023023
Yunseong Nam
Neil J. Ross
Yuan Su
Andrew M. Childs
Dmitri Maslov
2018
Automated optimization of large quantum circuits with continuous parameters
npj Quantum Information
4
1
23
10.1038/s41534-018-0072-4
Beatrice Nash
Vlad Gheorghiu
Michele Mosca
2019
Quantum circuit optimizations for NISQ architectures
arXiv preprint 1904.01972
Rigetti Computing
Forest - Rigetti
http://rigetti.com/forest
Peter Selinger
2015
Generators and relations for n-qubit Clifford operators
Logical Methods in Computer Science
11
2
10.2168/lmcs-11(2:10)2015
The Cirq Developers
Cirq: A python library for NISQ circuits
https://cirq.readthedocs.io/en/stable/
Guifre Vidal
Christopher M Dawson
2004
Universal quantum circuit for two-qubit transformations with three controlled-NOT gates
Physical Review A
69
1
010301
10.1103/PhysRevA.69.010301
Renaud Vilmart
2018
A Near-Optimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics
arXiv preprint 1812.09114