Fetching the paper…
Reading the bibliography…
We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a factor of 7/9.
“Introduction to UniversalQCompiler”, 2021
Raban Iten et al · 1904
Earlier work this paper cites.
“Introduction to Cyclotomic Fields”
Lawrence. Washington · 1934
Earlier work this paper cites.
“A quantitative formulation of the approximation theory of Kronecker”
Aleksandr Khinchin · 1948
Earlier work this paper cites.
“Factoring polynomials with rational coefficients”
A.. Lenstra, H.. Lenstra and L. Lovász · 1982
Earlier work this paper cites.
“Integer Programming with a Fixed Number of Variables”
H.. Lenstra · 1983
Earlier work this paper cites.
“Ramanujan graphs”
A. Lubotzky, R. Phillips and P. Sarnak · 1988
Earlier work this paper cites.
“A Classical Introduction to Modern Number Theory”
Kenneth Ireland and Michael Rosen · 1990
Earlier work this paper cites.
“A Course in Computational Algebraic Number Theory”
Henri Cohen · 1993
Earlier work this paper cites.
“Inequalities for convex bodies and polar reciprocal lattices in R n R^{n} ”
Wojciech Banaszczyk · 1995
Earlier work this paper cites.
“Elementary gates for quantum computation”
Adriano Barenco et al · 1995
Earlier work this paper cites.
“The Euclidean algorithm in algebraic number fields”
Franz Lemmermeyer · 1995
Earlier work this paper cites.
“Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations”
Daniel Gottesman and Isaac. Chuang · 1999
Earlier work this paper cites.
“Advanced Topics in Computional Number Theory”
Henri Cohen · 2000
Earlier work this paper cites.
“Efficient discrete approximations of quantum gates”
Aram. Harrow, Benjamin Recht and Isaac. Chuang · 2002
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.
“An Introduction to Quantum Computing”
Phillip Kaye, Raymond Laflamme and Michele Mosca · 2006
Earlier work this paper cites.
“Real and Complex Clifford Groups”
Gabriele Nebe, Eric. Rains and Neil.A. Sloane · 2006
Earlier work this paper cites.
“Full Cryptanalysis of LPS and Morgenstern Hash Functions”, 2008, pp. 263–277
Christophe Petit, Kristin Lauter and Jean-Jacques Quisquater · 2008
Earlier work this paper cites.
“Collisions for the LPS expander graph hash function”
Jean-Pierre Tillich and Gilles Zémor · 2008
Earlier work this paper cites.
“Cryptographic Hash Functions from Expander Graphs”
Denis. Charles, Kristin. Lauter and Eyal. Goren · 2009
Earlier work this paper cites.
“Restrictions on Transversal Encoded Quantum Gate Sets”
Bryan Eastin and Emanuel Knill · 2009
Earlier work this paper cites.
“Computing Stabilized Norms for Quantum Operations via the Theory of Completely Bounded Maps”
Nathaniel Johnston, David. Kribs and Vern. Paulsen · 2009
Earlier work this paper cites.
“A Spectral Gap Theorem in SU ( d ) (d) ”
Jean Bourgain and Alex Gamburd · 2012
Cited alongside, same era.
“Characterizing quantum gates via randomized benchmarking”
Easwar Magesan, Jay. Gambetta and Joseph Emerson · 2012
Cited alongside, same era.
“Quantum Computation and Quantum Information”
Michael. Nielsen and Isaac. Chuang · 2012
Cited alongside, same era.
“Efficient Decomposition of Single-Qubit Gates into V Basis Circuits”
Alex Bocharov, Yuri Gurevich and Krysta. Svore · 2013
Cited alongside, same era.
“Classification of Topologically Protected Gates for Local Stabilizer Codes”
Sergey Bravyi and Robert König · 2013
Cited alongside, same era.
“Modern Computer Algebra”
Joachim von Gathen and Jürgen Gerhard · 2013
Cited alongside, same era.
“Turning gate synthesis errors into incoherent errors”
Matthew. Hastings · 2017
Later among the works it cites.
“Optimal Hamiltonian Simulation by Quantum Signal Processing”
Guang Low and Isaac. Chuang · 2017
Later among the works it cites.
“Better path-finding algorithms in LPS Ramanujan graphs”
Eduardo Pinto and Christophe Petit · 2017
Later among the works it cites.
“Super-Golden-Gates for PU(2)” Special volume honoring David Kazhdan
Ori Parzanchevski and Peter Sarnak · 2017
Later among the works it cites.
“Halving the cost of quantum addition”
Craig Gidney · 2018
Later among the works it cites.
“The Theory of Quantum Information”
John Watrous · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and T Circuits Using a Constant Number of Ancillary Qubits”
V Kliuchnikov, D Maslov and M Mosca · 2013
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 · 2013
Cited alongside, same era.
“An Algorithm for the T-Count”
David Gosset, Vadym Kliuchnikov, Michele Mosca and Vincent Russo · 2014
Cited alongside, same era.
“Repeat-until-success: Non-deterministic decomposition of single-qubit unitaries”
Adam Paetznick and Krysta. Svore · 2014
Cited alongside, same era.
“Optimal ancilla-free Pauli+V circuits for axial rotations”
Andreas Blass, Alex Bocharov and Yuri Gurevich · 2015
Cited alongside, same era.
“Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits”
Alex Bocharov, Martin Roetteler and Krysta Svore · 2015
Cited alongside, same era.
Frank Arute et al · 2019
Later among the works it cites.
“Efficient magic state factories with a catalyzed | C C Z ⟩ |CCZ\textrangle to 2 | T ⟩ 2|T\textrangle transformation”
Craig Gidney and Austin. Fowler · 2019
Later among the works it cites.
“A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”
Daniel Litinski · 2019
Later among the works it cites.
“Approximate quantum Fourier transform with O(n log(n)) T gates”
Yunseong Nam, Yuan Su and Dmitri Maslov · 2020
Later among the works it cites.
Zachary Stier, private communication, 2020
2020
Later among the works it cites.
“Fault-tolerant quantum gates with defects in topological stabilizer codes”
Paul Webster and Stephen. Bartlett · 2020
Later among the works it cites.
“Cost of Universality: A Comparative Study of the Overhead of State Distillation and Code Switching with Color Codes”
Michael. Beverland, Aleksander Kubica and Krysta. Svore · 2021
Later among the works it cites.
“Quantum computing enhanced computational catalysis”
Vera von Burg et al · 2021
Later among the works it cites.
“Theory of Trotter Error with Commutator Scaling”
Andrew. Childs et al · 2021
Later among the works it cites.
“Quantum Circuits for Sparse Isometries”
Emanuel Malvetti, Raban Iten and Roger Colbeck · 2021
Later among the works it cites.
“Complexity of Strong Approximation on the Sphere”
Naser Sardari · 2021
Later among the works it cites.
“Quaternion Algebras”
John Voight · 2021
Later among the works it cites.
“Assessing requirements to scale to practical quantum advantage”, 2022
Michael. Beverland et al · 2022
Closest in time.
URL: https://azure-quantum-notebooks.azurefd.net/publicdata/shorter-quantum-circuits-dataset.tar
Shorter Dataset, 2023 · 2023
Closest in time.
URL: https://github.com/microsoft/Quantum/blob/a57178163b64a060d37603355c8a78571075f679/samples/azure-quantum/shorter-quantum-circuits/shorter-quantum-circuits-dataset.ipynb
Shorter Notebook, 2023 · 2023
Closest in time.
“Lower bounds on the non-Clifford resources for quantum computations”
Michael Beverland, Earl Campbell, Mark Howard and Vadym Kliuchnikov · 2058
Closest in time.