Fetching the paper…
Reading the bibliography…
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems.
F. Bruhat, “Distributions sur un groupe localement compact et applications à l etude des représentations des groupes
1961
Earlier work this paper cites.
No. 12 in Interscience Tracts in Pure and Applied Mathematics. Interscience Publishers, 1962
W. Rudin, · 1962
Earlier work this paper cites.
V. J. Bowman and C.-A. Burdet, “On the general solution to systems of mixed-integer linear equations,”
1974
Earlier work this paper cites.
M. S. Osborne, “On the Schwartz-Bruhat space and the Paley-Wiener theorem for locally compact Abelian groups,”
1975
Earlier work this paper cites.
W. Diffie and M. Hellman, “New directions in cryptography,”
1976
Earlier work this paper cites.
Cambridge University Press, 1977
S. A. Morris, · 1977
Earlier work this paper cites.
R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,”
1978
Earlier work this paper cites.
M. Dekker New York, 1981
D. L. Armacost, · 1981
Earlier work this paper cites.
IEEE Computer Society, 1984
L. Babai and E. Szemerédi, · 1984
Earlier work this paper cites.
D. Deutsch, “Quantum theory, the Church-Turing principle and the universal quantum computer,”
1985
Earlier work this paper cites.
ACM, 1991
L. Babai, · 1991
Earlier work this paper cites.
L. Babai, “Bounded round interactive proofs in finite groups,”
1992
Earlier work this paper cites.
Springer, 1993
H. Cohen, · 1993
Earlier work this paper cites.
D. R. Simon, “On the power of quantum computation,”
1994
Earlier work this paper cites.
Springer, 1995
D. Boneh and R. Lipton, · 1995
Earlier work this paper cites.
arXiv:quant-ph/9511026v1
A. Y. Kitaev, “Quantum measurements and the Abelian stabilizer problem,” 1995 · 1995
Earlier work this paper cites.
E. Knill, “On shor’s quantum factor finding algorithm: Increasing the probability of success and tradeoffs involving the fourier transform modulus,” 1995
1995
Earlier work this paper cites.
quant-ph/9608048
E. Knill, “Non-binary unitary error bases and quantum codes,” tech. rep., Los Alamos National Laboratory, 1996 · 1996
Earlier work this paper cites.
Oxford University Press, 1996
J. F. Humphreys, · 1996
Earlier work this paper cites.
CRC Press, 1st ed., 1996
A. J. Menezes, S. A. Vanstone, and P. C. V. Oorschot, · 1996
Earlier work this paper cites.
Prentice-Hall, 1996
A. V. Oppenheim, A. S. Willsky, and S. H. Nawab, · 1996
Earlier work this paper cites.
PhD thesis, California Institute of Technology, 1997
D. Gottesman, · 1997
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,”
1997
Earlier work this paper cites.
D. Grigoriev, “Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines,”
1997
Earlier work this paper cites.
A. Y. Kitaev, “Quantum computations: algorithms and error correction,”
1997
Earlier work this paper cites.
IEEE Computer Society, 1997
G. Brassard and P. Høyer, “An exact quantum polynomial-time algorithm for Simon’s problem,” in · 1997
Earlier work this paper cites.
V. Arvind and N. Vinodchandran, “Solvable black-box group problems are low for pp,”
1997
Earlier work this paper cites.
Graduate studies in mathematics. American Mathematical Society, 1997
D. Lorenzini, · 1997
Earlier work this paper cites.
Springer, 1998
D. Gottesman, “Fault-tolerant quantum computation with higher-dimensional systems,” in · 1998
Earlier work this paper cites.
E. Knill and R. Laflamme, “Power of one bit of quantum information,”
1998
Earlier work this paper cites.
Springer, 1998
M. Mosca and A. Ekert, “The hidden subgroup problem and eigenvalue estimation on a quantum computer,” in · 1998
Earlier work this paper cites.
Springer, 1998
J. P. Antoine, “Quantum mechanics beyond Hilbert space,” in · 1998
Earlier work this paper cites.
International Press, 1999
D. Gottesman, “The Heisenberg representation of quantum computers,” in · 1999
Earlier work this paper cites.
S. Lloyd and S. L. Braunstein, “Quantum computation over continuous variables,”
1999
Earlier work this paper cites.
Cambridge University Press, 1999
L. Babai and R. Beals, “A polynomial-time theory of black-box groups I,” in · 1999
Earlier work this paper cites.
PhD thesis, University of Oxford, 1999
M. Mosca, · 1999
Earlier work this paper cites.
P. Høyer, “Conjugated operators in quantum algorithms,”
1999
Earlier work this paper cites.
Springer, 1st ed., 2000
J. A. Buchmann, · 2000
Earlier work this paper cites.
Cambridge University Press, 2000
M. A. Nielsen and I. L. Chuang, · 2000
Earlier work this paper cites.
arXiv:quant-ph/0108033
E. Knill, “Fermionic Linear Optics and Matchgates,” 2001 · 2001
Earlier work this paper cites.
K. K. H. Cheung and M. Mosca, “Decomposing finite Abelian groups,”
2001
Earlier work this paper cites.
H. J. Briegel and R. Raussendorf, “Persistent entanglement in arrays of interacting particles,”
2001
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, “A one-way quantum computer,”
2001
Earlier work this paper cites.
L. G. Valiant, “Quantum circuits that can be simulated classically in polynomial time,”
2002
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, “Classical simulation of noninteracting-fermion quantum circuits,”
2002
Cited alongside, same era.
S. D. Bartlett, B. C. Sanders, S. L. Braunstein, and K. Nemoto, “Efficient classical simulation of continuous variable quantum information processes,”
2002
Cited alongside, same era.
S. D. Bartlett and B. C. Sanders, “Efficient classical simulation of optical quantum information circuits,”
2002
Cited alongside, same era.
U. B. Wim van Dam (HP, MSRI and G. S. (HP), “Efficient Quantum Algorithms for Estimating Gauss Sums,”
2002
Cited alongside, same era.
M. Gadella and F. Gómez, “A unified mathematical formalism for the Dirac formulation of quantum mechanics,”
2002
Cited alongside, same era.
2008
Later among the works it cites.
I. Markov and Y. Shi, “Simulating quantum computation by contracting tensor networks,”
2008
Later among the works it cites.
M. Gadella, F. Gómez, and S. Wickramasekara, “Riggings of locally compact Abelian groups.,”
2008
Later among the works it cites.
M. Mosca, · 2009
Later among the works it cites.
D. Shepherd and M. J. Bremner, “Temporally unstructured quantum computation,”
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Proos and C. Zalka, “Shor’s discrete logarithm quantum algorithm for elliptic curves,”
2003
Cited alongside, same era.
J. Dehaene and B. De Moor, “Clifford group, stabilizer states, and linear and quadratic operations over GF(2),”
2003
Cited alongside, same era.
S. Hallgren, A. Russell, and A. Ta-Shma, “Normal subgroup reconstruction and quantum computation using group representations,”
2003
Cited alongside, same era.
D. Poulin, R. Laflamme, G. J. Milburn, and J. P. Paz, “Testing integrability with a single bit of quantum information,”
2003
Cited alongside, same era.
R. Jozsa and N. Linden, “On the role of entanglement in quantum-computational speed-up,”
2003
Cited alongside, same era.
G. Vidal, “Efficient classical simulation of slightly entangled quantum computations,”
2003
Cited alongside, same era.
R. Jozsa, “Quantum computation in algebraic number theory: Hallgren’s efficient quantum algorithm for solving Pell’s equation,”
2003
Cited alongside, same era.
2009
Later among the works it cites.
D. Nagaj, P. Wocjan, and Y. Zhang, “Fast amplification of QMA,”
2009
Later among the works it cites.
A. M. Childs and W. van Dam, “Quantum algorithms for algebraic problems,”
2010
Later among the works it cites.
D. Bacon and W. van Dam, “Recent progress in quantum algorithms,”
2010
Later among the works it cites.
D. J. Shepherd, · 2010
Later among the works it cites.
2010
Later among the works it cites.
D. Dikranjan, “Introduction to topological groups.” 2010
2010
Later among the works it cites.
2010
Later among the works it cites.
R. Jozsa, B. Kraus, A. Miyake, and J. Watrous, “Matchgate and space-bounded quantum computations are equivalent,”
2010
Later among the works it cites.
S. P. Jordan, “Permutational quantum computing,”
2010
Later among the works it cites.
Cambridge University Press, 2010
R. P. Brent and P. Zimmermann, · 2010
Later among the works it cites.
2011
Later among the works it cites.
University of Waterloo, 2011
A. Childs, · 2011
Later among the works it cites.
M. Van den Nest, “Quantum matchgate computations and linear threshold gates,”
2011
Later among the works it cites.
M. Van den Nest, “Simulating quantum computers with probabilistic methods,”
2011
Later among the works it cites.
J. Bermejo-Vega, “Classical simulations of non-abelian quantum Fourier transforms,” Master’s thesis, Technical University of Munich, 2011
2011
Later among the works it cites.
F. Fontein and P. Wocjan, “Quantum Algorithm for Computing the Period Lattice of an Infrastructure,”
2011
Later among the works it cites.
2012
Later among the works it cites.
W. van Dam and Y. Sasaki, · 2012
Later among the works it cites.
Springer, 2012
J. Smith and M. Mosca, · 2012
Later among the works it cites.
S. Bravyi and R. König, “Classical simulation of dissipative fermionic linear optics,”
2012
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
M. Van Den Nest, “Universal quantum computation with little entanglement,”
2012
Later among the works it cites.
2013
Later among the works it cites.
N. de Beaudrap, “A linearized stabilizer formalism for systems of finite dimension,”
2013
Later among the works it cites.
F. de Melo, P. Ćwikliński, and B. M. Terhal, “The power of noisy fermionic quantum computation,”
2013
Later among the works it cites.
2013
Later among the works it cites.
M. Schwarz and M. V. d. Nest, “Simulating quantum circuits with sparse output distributions,”
2013
Later among the works it cites.
2014
Closest in time.
R. Jozsa and M. Van Den Nest, “Classical simulation complexity of extended Clifford circuits,”
2014
Closest in time.
S. P. Jordan and G. Alagic, “Approximating the turaev-viro invariant of mapping tori is complete for one clean qubit,” in · 2014
Closest in time.
2014
Closest in time.
B. M. Terhal and D. P. DiVincenzo, “Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games,”
2014
Closest in time.
D. Stahlke, “Quantum interference as a resource for quantum speedup,”
2014
Closest in time.
P. Sarvepalli and P. Wocjan, “Quantum algorithms for one-dimensional infrastructures,”
2014
Closest in time.
F. Fontein and P. Wocjan, “On the probability of generating a lattice,”
2014
Closest in time.