CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate

Quantum complexity theory

Ethan Bernstein and Umesh Vazirani · 1993

Earlier work this paper cites.

Mixed-state entanglement and quantum error correction

Charles H. Bennett, David P. DiVincenzo, John A. Smolin, and William K. Wootters · 1996

Earlier work this paper cites.

Stabilizer codes and quantum error correction

Daniel Gottesman · 1997

Earlier work this paper cites.

Parallel quantum computation and quantum codes

Cristopher Moore and Martin Nilsson · 2001

Earlier work this paper cites.

Quantum Computation and Quantum Information

Michael A. Nielsen and Isaac Chuang · 2002

Earlier work this paper cites.

Improved simulation of stabilizer circuits

Scott Aaronson and Daniel Gottesman · 2004

Earlier work this paper cites.

Universal quantum computation with ideal Clifford gates and noisy ancillas

Sergey Bravyi and Alexei Kitaev · 2005

Earlier work this paper cites.

Computation at a distance

Samuel A. Kutin, David Petrie Moulton, and Lawren M. Smithline · 2007

Earlier work this paper cites.

Randomized benchmarking of quantum gates

Emanuel Knill, Dietrich Leibfried, Rolf Reichle, Joe Britton, R. Brad Blakestad, John D. Jost, Chris Langer, Roee Ozeri, Signe Seidelin, and David J. Wineland · 2008

Cited alongside, same era.

Optimal synthesis of linear reversible circuits

Ketan N. Patel, Igor L. Markov, and John P. Hayes · 2008

Cited alongside, same era.

Scalable and robust randomized benchmarking of quantum processes

Easwar Magesan, Jay M. Gambetta, and Joseph Emerson · 2011

Cited alongside, same era.

IBM makes quantum computing available on IBM cloud to accelerate innovation

IBM Press Release · 2016

Cited alongside, same era.

Experimental comparison of two quantum computing architectures

Norbert M. Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A. Landsman, Kenneth Wright, and Christopher Monroe · 2017

Cited alongside, same era.

Shorter gate sequences for quantum computing by mixing unitaries

Optimal space-depth trade-off of CNOT circuits in quantum logic synthesis

Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, and Jialin Zhang · 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.

Reducing the depth of linear reversible quantum circuits

Timothee Goubault De Brugiere, Marc Baboulin, Benoît Valiron, Simon Martiel, and Cyril Allouche · 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.

https://quantumai.google/ , https://quantum-computing.ibm.com/ , https://www.rigetti.com/

Google Quantum AI, IBM Quantum, Rigetti · 2022

Closest in time.

https://ionq.com/ , https://www.quantinuum.com/