Fetching the paper…
Reading the bibliography…
Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study quantum entanglement, and more.
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.
The Heisenberg representation of quantum computers
Daniel Gottesman · 1998
Earlier work this paper cites.
Quantum Computation and Quantum Information, 2002
Michael A. Nielsen and Isaac Chuang · 2002
Earlier work this paper cites.
Quantum data hiding
David P. DiVincenzo, Debbie W. Leung, and Barbara M. Terhal · 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.
Quantum computing with realistically noisy devices
Emanuel Knill · 2005
Earlier work this paper cites.
Scalable noise estimation with random unitary operators
Joseph Emerson, Robert Alicki, and Karol Życzkowski · 2005
Earlier work this paper cites.
Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
Benoît Collins and Piotr Śniady · 2006
Cited alongside, same era.
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.
Exact and approximate unitary 2-designs and their application to fidelity estimation
Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine · 2009
Cited alongside, same era.
Pseudo-randomness and learning in quantum computation
Richard A. Low · 2010
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.
Near-linear constructions of exact unitary 2-designs
Richard Cleve, Debbie W. Leung, Li Liu, and Chunhao Wang · 2016
Later among the works it cites.
Shadow tomography of quantum states
Scott Aaronson · 2020
Closest in time.
Predicting many properties of a quantum system from very few measurements
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2020
Closest in time.
IBM Quantum Experience
IBM · 2020
Closest in time.
Amazon Bracket
Amazon Web Services · 2020
Closest in time.
Flynn’s taxonomy
Wikipedia contributors · 2020
Closest in time.
Page fault
Wikipedia contributors · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A study of optimal 4-bit reversible Toffoli circuits and their synthesis
Oleg Golubitsky and Dmitri Maslov · 2011
Cited alongside, same era.
Optimization of Clifford circuits
Vadym Kliuchnikov and Dmitri Maslov · 2013
Cited alongside, same era.
The diameter of the Rubik’s cube group is twenty
Tomas Rokicki, Herbert Kociemba, Morley Davidson, and John Dethridge · 2014
Cited alongside, same era.
Clang version 9.0.0
Clang project
Cited in the paper.
Hadamard-free circuits expose the structure of the Clifford group
Sergey Bravyi and Dmitri Maslov · 2021
Closest in time.