Fetching the paper…
Reading the bibliography…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras.
Number theory
Zenon I. Borevich and Igor R. Shafarevich · 1967
Earlier work this paper cites.
Maximal Orders
I. Reiner · 1975
Earlier work this paper cites.
Number Theory
Daniel A. Marcus · 1977
Earlier work this paper cites.
An algorithm for finding an algebraic number whose norm is a given rational number
Dennis A. Garbanati · 1980
Earlier work this paper cites.
Arithmetique des algebres de quaternions
M.-F. Vigneras · 1980
Earlier work this paper cites.
Factoring polynomials with rational coefficients
Arjen K. Lenstra, Hendrik W. Lenstra, and László Lovasz · 1982
Earlier work this paper cites.
Introduction to Cyclotomic Fields
Lawrence C. Washington · 1982
Earlier work this paper cites.
Improved algorithms for integer programming and related lattice problems
Ravi Kannan · 1983
Earlier work this paper cites.
On Lovász lattice reduction and the nearest lattice point problem
László Babai · 1986
Earlier work this paper cites.
Hecke operators and distributing points on the sphere I
Alexander Lubotzky, Ralph Phillips, and Peter Sarnak · 1986
Earlier work this paper cites.
Hecke operators and distributing points on S2. II
Alexander Lubotzky, Ralph Phillips, and Peter Sarnak · 1987
Earlier work this paper cites.
Algorithmic Algebraic Number Theory
Michael E. Pohst and Hans Zassenhaus · 1989
Earlier work this paper cites.
The Magma algebra system. I. The user language
Wieb Bosma, John Cannon, and Catherine Playoust · 1993
Earlier work this paper cites.
A Course in Computational Algebraic Number Theory
Henri Cohen · 1993
Earlier work this paper cites.
On the complexity of some problems in algorithmic algebraic number theory
Christoph Thiel · 1995
Earlier work this paper cites.
Multiple particle interference and quantum error correction
Andrew M. Steane · 1996
Earlier work this paper cites.
Asymptotically fast computation of Hermite normal forms of integer matrices
Arne Storjohann and George Labahn · 1996
Earlier work this paper cites.
On solving relative norm equations in algebraic number fields
Claus Fieker, Andreas Jurk, and Michael E. Pohst · 1997
Earlier work this paper cites.
Algebraic Number Theory
Jürgen Neukirch · 1999
Earlier work this paper cites.
Computing local Artin maps, and solvability of norm equations
Vincenzo Acciaro and Jürgen Klüners · 2000
Earlier work this paper cites.
Advanced Topics in Computational Number Theory
Henri Cohen · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Issac L. Chuang · 2000
Earlier work this paper cites.
Algorithms for matrix canonical forms
Arne Storjohann · 2000
Earlier work this paper cites.
Factoring polynomials over finite fields: a survey
Joachim von zur Gathen and Daniel Panario · 2001
Earlier work this paper cites.
A modular functor which is universal for quantum computation
Michael Freedman, Michael Larsen, and Zhenghan Wang · 2002
Earlier work this paper cites.
Cryptanalysis of the Revised NTRU Signature Scheme
Craig Gentry and Michael Szydlo · 2002
Cited alongside, same era.
Efficient discrete approximations of quantum gates
Aram W. Harrow, Benjamin Recht, and Isaac L. Chuang · 2002
Cited alongside, same era.
Classical and quantum computation
Alexei Kitaev, Alexander Shen, and Mikhail Vyalyi · 2002
Cited alongside, same era.
Complexity of lattice problems: a cryptographic perspective
Daniele Micciancio and Shafi Goldwasser · 2002
Cited alongside, same era.
Norm equations in relative number fields using S-units
Denis Simon · 2002
Cited alongside, same era.
Overhead and noise threshold of fault-tolerant quantum error correction
Andrew M. Steane · 2003
Cited alongside, same era.
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2012
Later among the works it cites.
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2012
Later among the works it cites.
Complexity of Lattice Problems: A Cryptographic Perspective
D. Micciancio and S. Goldwasser · 2012
Later among the works it cites.
Efficient Clifford+T approximation of single-qubit operators
Peter Selinger · 2012
Later among the works it cites.
Efficient decomposition of single-qubit gates into V basis circuits
Alex Bocharov, Yuri Gurevich, and Krysta M. Svore · 2013
Later among the works it cites.
Candidate multilinear maps from ideal lattices
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Modern Computer Algebra
Joachim von zur Gathen and Jürgen Gerhard · 2003
Cited alongside, same era.
PRIMES is in P
Manindra Agrawal, Neeraj Kayal, and Nitin Saxena · 2004
Cited alongside, same era.
Topics in computational algebraic number theory
Karim Belabas · 2004
Cited alongside, same era.
Low-dimensional lattice basis reduction revisited
PhongQ Nguyen and Damien Stehlé · 2004
Cited alongside, same era.
The Solovay-Kitaev algorithm
Christopher M. Dawson and Michael A. Nielsen · 2005
Cited alongside, same era.
Fast quantum algorithms for computing the unit group and class group of a number field
Sean Hallgren · 2005
Cited alongside, same era.
Sanjam Garg, Craig Gentry, and Shai Halevi · 2013
Later among the works it cites.
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2013
Later among the works it cites.
Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
Adam Paetznick and Krysta M. Svore · 2013
Later among the works it cites.
Optimal ancilla-free Pauli + V +V circuits for axial rotations
Andreas Blass, Alex Bocharov, and Yuri Gurevich · 2014
Later among the works it cites.
Universal quantum computation with metaplectic anyons
Xingshan Cui and Zhenghan Wang · 2014
Later among the works it cites.
A quantum algorithm for computing the unit group of an arbitrary degree number field
Kirsten Eisenträger, Sean Hallgren, Alexei Kitaev, and Fang Song · 2014
Later among the works it cites.
An algorithm for the T-count
David Gosset, Vadym Kliuchnikov, Michele Mosca, and Vincent Russo · 2014
Later among the works it cites.
New methods for quantum compiling
Vadym Kliuchnikov · 2014
Later among the works it cites.
Asymptotically optimal topological quantum compiling
Vadym Kliuchnikov, Alex Bocharov, and Krysta M. Svore · 2014
Later among the works it cites.
Optimal ancilla-free Clifford+T approximation of z-rotations
Neil J. Ross and Peter Selinger · 2014
Later among the works it cites.
PARI/GP version
The PARI Group, Bordeaux · 2014
Later among the works it cites.
Efficient topological compilation for weakly-integral anyon model
Alex Bocharov, Xingshan Cui, Vadym Kliuchnikov, and Zhenghan Wang · 2015
Closest in time.
Efficient synthesis of probabilistic quantum circuits with fallback
Alex Bocharov, Martin Roetteler, and Krysta M. Svore · 2015
Closest in time.
Efficient synthesis of universal Repeat-Until-Success circuits
Alex Bocharov, Martin Roetteler, and Krysta M. Svore · 2015
Closest in time.
Reducing the quantum computing overhead with complex gate distillation
Guillaume Duclos-Cianci and David Poulin · 2015
Closest in time.
Exact synthesis of single-qubit unitaries over clifford-cyclotomic gate sets
Simon Forest, David Gosset, Vadym Kliuchnikov, and David McKinnon · 2015
Closest in time.
Improving quantum algorithms for quantum chemistry
Matthew B. Hastings, Dave Wecker, Bela Bauer, and Matthias Troyer · 2015
Closest in time.
A framework for exact synthesis
Vadym Kliuchnikov and Jon Yard · 2015
Closest in time.
Letter to Aaronson and Pollington on the Solvay-Kitaev Theorem and Golden Gates
Peter Sarnak · 2015
Closest in time.