Fetching the paper…
Reading the bibliography…
We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance $\epsilon$ and requires significantly fewer non-Clifford gates than existing techniques.
A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
Guillaume Duclos-Cianci and Krysta M. Svore · 1980
Earlier work this paper cites.
Approximation by Quantum Circuits
Emanuel Knill · 1995
Earlier work this paper cites.
Quantum computations: algorithms and error correction
Alexei Y. Kitaev · 1997
Earlier work this paper cites.
Quantum Amplitude Amplification and Estimation
Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Classical and Quantum Computation
Alexei Y. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi · 2002
Earlier work this paper cites.
Scalability of Shor’s algorithm with a limited set of rotation gates
Austin G. Fowler and Lloyd C. L. Hollenberg · 2004
Earlier work this paper cites.
Repeat-Until-Success Quantum Computing
Yuan Liang Lim, Almut Beige, and Leong Chuan Kwek · 2004
Earlier work this paper cites.
The Solovay-Kitaev algorithm
Christopher M. Dawson and Michael A. Nielsen · 2005
Earlier work this paper cites.
Quantum Computing with Very Noisy Devices
Emanuel Knill · 2005
Earlier work this paper cites.
Topological fault-tolerance in cluster state quantum computation
Robert Raussendorf, Jim Harrington, and Kovid Goyal · 2007
Earlier work this paper cites.
Twisted graph states for ancilla-driven quantum computation
Elham Kashefi, Daniel Kuan Li Oi, Daniel E. Browne, Janet Anders, and Erika Andersson · 2009
Earlier work this paper cites.
Ancilla-Driven Universal Quantum Computation
Janet Anders, Daniel Kuan Li Oi, Elham Kashefi, Dan E. Browne, and Erika Andersson · 2010
Cited alongside, same era.
Constructing arbitrary Steane code single logical qubit fault-tolerant gates
Austin G. Fowler · 2011
Cited alongside, same era.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler · 2012
Cited alongside, same era.
A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
Alex Bocharov and Krysta M. Svore · 2012
Cited alongside, same era.
Magic state distillation in all prime dimensions using quantum Reed-Muller codes
Efficient Decomposition of Single-Qubit Gates into V Basis Circuits
Alex Bocharov, Yuri Gurevich, and Krysta M. Svore · 2013
Closest in time.
Surface code implementation of block code state distillation
Austin G. Fowler, Simon J. Devitt, and Cody Jones · 2013
Closest in time.
David Gosset, Vadym Kliuchnikov, Michele Mosca, and Vincent Russo · 2013
Closest in time.
Quantum 3-SAT is QMA1-complete
David Gosset and Daniel Nagaj · 2013
Closest in time.
Logic synthesis for fault-tolerant quantum computers
Cody Jones · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Earl T. Campbell, Hussain Anwar, and Dan E. Browne · 2012
Cited alongside, same era.
Exact synthesis of multi-qubit Clifford+T circuits
Brett Giles and Peter Selinger · 2012
Cited alongside, same era.
Simulating chemistry efficiently on fault-tolerant quantum computers
Cody Jones, James D. Whitfield, Peter L. McMahon, Man-Hong Yung, Rodney Van Meter, Alán Aspuru-Guzik, and Yoshihisa Yamamoto · 2012
Cited alongside, same era.
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2012
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 · 2012
Cited alongside, same era.
Efficient Clifford+T approximation of single-qubit operators
Peter Selinger · 2012
Cited alongside, same era.
Algorithms for the Optimization of Quantum Circuits
Matthew Amy · 2013
Cited alongside, same era.
Exponential improvement in precision for simulating sparse Hamiltonians
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma · 2013
Cited alongside, same era.
Closest in time.
Low-overhead constructions for the fault-tolerant Toffoli gate
Cody Jones · 2013
Closest in time.
Synthesis of unitaries with Clifford+T circuits
Vadym Kliuchnikov · 2013
Closest in time.
In preparation
Dave Wecker, Bela Bauer, Bryan Clark, and Matthias Troyer · 2013
Closest in time.
Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
Jonathan Welch, Daniel Greenbaum, Sarah Mostame, and Alán Aspuru-Guzik · 2013
Closest in time.
Floating point representations in quantum circuit synthesis
Nathan Wiebe and Vadym Kliuchnikov · 2013
Closest in time.
Optimal ancilla-free Clifford+T approximation of z-rotations
Neil J. Ross and Peter Selinger · 2014
Closest in time.
Ancilla Driven Quantum Computation with arbitrary entangling strength
Kerem Halil Shah and Daniel Kuan Li Oi · 2066
Closest in time.