Fetching the paper…
Reading the bibliography…
The Solovay-Kitaev algorithm is a fundamental result in quantum computation.
Linear representations of finite groups
Jean-Pierre Serre · 1977
Earlier work this paper cites.
Quantum computations: algorithms and error correction
Alexei Y. Kitaev · 1997
Earlier work this paper cites.
Efficient discrete approximations of quantum gates
Aram W Harrow, Benjamin Recht, and Isaac L Chuang · 2002
Earlier work this paper cites.
Classical and quantum computation
Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi · 2002
Earlier work this paper cites.
The Solovay-Kitaev algorithm
Christopher M. Dawson and Michael A. Nielsen · 2005
Earlier work this paper cites.
Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane
Dorit Aharonov, Itai Arad, Elad Eban, and Zeph Landau · 2007
Earlier work this paper cites.
Epsilon-nets, unitary designs and random quantum circuits
Michał Oszmaniec, Adam Sawicki, and Michał Horodecki · 2007
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A Nielsen and Isaac L Chuang · 2010
Earlier work this paper cites.
A spectral gap theorem in SU ( d ) \text{SU}(d)
Jean Bourgain and Alex Gamburd · 2012
Cited alongside, same era.
Random walks in compact groups
Péter Pál Varjú · 2013
Cited alongside, same era.
Optimal ancilla-free Clifford+T approximation of Z-rotations
Neil J Ross and Peter Selinger · 2014
Cited alongside, same era.
Efficient synthesis of universal repeat-until-success quantum circuits
Alex Bocharov, Martin Roetteler, and Krysta M Svore · 2015
Cited alongside, same era.
Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
Complexity classification of two-qubit commuting Hamiltonians
Adam Bouland, Laura Mančinska, and Xue Zhang · 2016
Later among the works it cites.
Universal refocusing of systematic quantum noise
Imdad SB Sardharwalla, Toby S Cubitt, Aram W Harrow, and Noah Linden · 2016
Later among the works it cites.
The complexity of translationally invariant spin chains with low local dimension
Johannes Bausch, Toby Cubitt, and Maris Ozols · 2017
Later among the works it cites.
The complexity of translationally invariant low-dimensional spin lattices in 3D
Johannes Bausch and Stephen Piddock · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Simon Forest, David Gosset, Vadym Kliuchnikov, and David McKinnon · 2015
Cited alongside, same era.
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2015
Cited alongside, same era.
How hard is it to approximate the Jones polynomial?
Greg Kuperberg · 2015
Cited alongside, same era.
Adam Bouland, Joseph F Fitzsimons, and Dax Enshan Koh · 2018
Later among the works it cites.
Trading inverses for an irrep in the Solovay-Kitaev theorem
Adam Bouland and Maris Ozols · 2018
Later among the works it cites.
Ori Parzanchevski and Peter Sarnak · 2018
Later among the works it cites.