Optimal ancilla-free Clifford+V approximation of z-rotations

By Neil J. Ross. Quantum information & computation, 2015

400 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/691402898b06409ed268e99837362c20c1146bb7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Vision and Pattern Recognition

In Hardware and Architecture

Citations in the corpus

Automated optimization of large quantum circuits with continuous parameters (2017, neutral): “Optimal algorithms for producing such approximations are known.(37,38) The number of Clifford+ T gates required to approximate a generic Rz gate depends primarily on the desired accuracy rather than the specific angle of rotation, so it is preferable to optimize a circuit before approximating its Rz”
Quantum error mitigation (2022, methodology): “The resultant compilation error will decrease exponentially with the increase of the number of T gates used (Daw-son and Nielsen, 2006; Kitaev, 1997; Kliuchnikov et al. , 2013; Ross and Selinger, 2016).”
Elucidating reaction mechanisms on quantum computers (2016, methodology): “Subsequent work [57] has provided a method that has an average case complexity roughly 3/4 of this worst case bound and also has made the compilation process efficient [58].”
Toward the first quantum simulation with quantum speedup (2017, methodology): “We also produce Clifford+ T circuits using optimal circuit synthesis (26) so that we can count T gates, which are typically the most expensive gates for fault-tolerant computation.”
The future of quantum computing with superconducting qubits (2022, background): “The Cliﬀord+ T gate set is universal and has a rich algebraic structure enabling eﬃcient and nearly-optimal compiling of quantum algorithms 59,60 .”
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery (2018, background): “Depending on the desired precision, this can require ∼100 T gates for each rotation [44], which must be executed in series.”