Fetching the paper…
Reading the bibliography…
Quantum computers can execute algorithms that dramatically outperform classical computation.
Alexander, J. W., 1923, A lemma on systems of knotted curves, Proceedings of the National Academy of Sciences 9(3), pp. 93–95
1923
Earlier work this paper cites.
Born, M., and V. Fock, 1928, Beweis des Adiabatensatzes, Zeitschrift für Physik 51, pp. 165–180
1928
Earlier work this paper cites.
Pólya, G., 1945, How to Solve It: A New Aspect of Mathematical Method , Princeton University Press
1945
Earlier work this paper cites.
Bennett, C. H., 1973, Logical reversibility of computation, IBM Journal of Research and Development 17, pp. 525–532
1973
Earlier work this paper cites.
Holevo, A. S., 1973, Statistical decisions in quantum theory, Journal of Multivariate Analysis 3, pp. 337–394
1973
Earlier work this paper cites.
Miller, G. L., 1976, Riemann’s hypothesis and tests for primality, Journal of Computer and System Sciences 13(3), pp. 300–317, preliminary version in STOC 1975
1975
Earlier work this paper cites.
Yuen, H. P., R. S. Kennedy, and M. Lax, 1975, Optimum testing of multiple hypotheses in quantum detection theory, IEEE Transactions on Information Theory 21, pp. 125–134
1975
Earlier work this paper cites.
Diffie, W., and M. E. Hellman, 1976, New directions in cryptography, IEEE Transactions on Information Theory 22(6), pp. 644–654
1976
Earlier work this paper cites.
Serre, J.-P., 1977, Linear Representations of Finite Groups , volume 42 of Graduate Texts in Mathematics , Springer
1977
Earlier work this paper cites.
Rivest, R., A. Shamir, and L. Adleman, 1978, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM 21(2), pp. 120–126
1978
Earlier work this paper cites.
Hardy, G. H., and E. M. Wright, 1979, An Introduction to the Theory of Numbers , Oxford University Press, 5th edition
1979
Earlier work this paper cites.
Filotti, I. S., and J. N. Mayer, 1980, A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus, Proceedings of the 12th ACM Symposium on Theory of Computing , pp. 236–243
1980
Earlier work this paper cites.
Manin, Y., 1980, Computable and uncomputable, Sovetskoye Radio
1980
Earlier work this paper cites.
Miller, G., 1980, Isomorphism testing for graphs of bounded genus, Proceedings of the 12th ACM Symposium on Theory of Computing , pp. 225–235
1980
Earlier work this paper cites.
Rabin, M. O., 1980, Probabilistic algorithm for testing primality, Journal of Number Theory 12(1), pp. 128–138
1980
Earlier work this paper cites.
Stigler, S. M., 1980, Stigler’s law of eponymy, Transactions of the New York Academy of Sciences, Series II 39, pp. 147–157
1980
Earlier work this paper cites.
van Emde Boas, P., 1981, Another NP-complete problem and the complexity of computing short vectors in a lattice , Technical Report 8104, Department of Mathematics, University of Amsterdam
1981
Earlier work this paper cites.
Babai, L., D. Grigoriev, and D. Mount, 1982, Isomorphism of graphs with bounded eigenvalue multiplicity, Proceedings of the 14th ACM Symposium on Theory of Computing , pp. 310–324
1982
Earlier work this paper cites.
Feynman, R. P., 1982, Simulating physics with computers, International Journal of Theoretical Physics 21, pp. 467–488
1982
Earlier work this paper cites.
Hoffmann, C. M., 1982, Group-Theoretic Algorithms and Graph Isomorphism , volume 136 of Lecture Notes in Computer Science , Springer-Verlag
1982
Earlier work this paper cites.
Lenstra, A. K., H. W. Lenstra, Jr., and L. Lovász, 1982, Factoring polyonimals with rational coefficients, Mathematische Annalen 261, pp. 515–534
1982
Earlier work this paper cites.
Luks, E. M., 1982, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences 25(1), pp. 42–65
1982
Earlier work this paper cites.
Babai, L., W. M. Kantor, and E. Luks, 1983, Computational complexity and the classification of finite simple groups, Proceedings of the 24th IEEE Symposium on Foundations of Computer Science , pp. 162–171
1983
Earlier work this paper cites.
Lenstra, H. W., Jr., 1983, Integer programming with a fixed number of variables, Mathematics of Operations Research 8(4), pp. 538–548
1983
Earlier work this paper cites.
Babai, L., and E. Szemerédi, 1984, On the complexity of matrix group problems I, Proceedings of the 25th IEEE Symposium on Foundations of Computer Science , pp. 229–240
1984
Earlier work this paper cites.
Deutsch, D., 1985, Quantum theory, the Church-Turing principle, and the universal quantum computer, Proceedings of the Royal Society of London. Series A 400, pp. 97–117
1985
Earlier work this paper cites.
Jones, V. F. R., 1985, A polynomial invariant for knots via von Neumann algebras, Bulletin of the American Mathematical Society 12(1), pp. 103–111
1985
Earlier work this paper cites.
Schoof, R., 1985, Elliptic curves over finite fields and the computation of square roots mod p p , Mathematics of Computation 44(170), pp. 483–494
1985
Earlier work this paper cites.
Beth, T., 1987, On the computational complexity of the general discrete Fourier transform, Theoretical Computer Science 51, pp. 331–339
1987
Earlier work this paper cites.
Kauffman, L. H., 1987, State models and the Jones polynomial, Topology 26(3), pp. 395–407
1987
Earlier work this paper cites.
Pomerance, C., 1987, Fast, rigorous factorization and discrete logarithm algorithms, Discrete Algorithms and Complexity , edited by D. S. Johnson, T. Nishizeki, A. Nozaki, and H. S. Wilf, Academic Press, pp. 119–143
1987
Earlier work this paper cites.
Schnorr, C. P., 1987, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science 53, pp. 201–224
1987
Earlier work this paper cites.
Diaconis, P., 1988, Group Representations in Probability and Statistics , volume 11 of IMS Lecture Notes–Monograph Series , Institute of Mathematical Statistics
1988
Earlier work this paper cites.
Buchmann, J., 1990, A subexponential algorithm for the determination of class groups and regulators of algebraic number fields, Séminaire de Théorie des Nombres, Paris 1988–1989 , Birkhäuser, volume 91 of Progress in Mathematics , pp. 27–41
1989
Earlier work this paper cites.
Clausen, M., 1989, Fast generalized Fourier transforms, Theoretical Computer Science 67(1), pp. 55–63
1989
Earlier work this paper cites.
Deutsch, D., 1989, Quantum computational networks, Proceedings of the Royal Society of London. Series A 425, pp. 73–90
1989
Earlier work this paper cites.
Hamermesh, M., 1989, Group Theory and Its Application to Physical Problems , Dover
1989
Earlier work this paper cites.
Witten, E., 1989, Quantum field theory and the Jones polynomial, Communications in Mathematical Physics 121(3), pp. 351–399
1989
Earlier work this paper cites.
den Boer, B., 1990, Diffie-Hellman is as strong as discrete log for certain primes, Advances in Cryptology – CRYPTO ’88 , volume 403 of Lecture Notes in Computer Science , pp. 530–539
1990
Earlier work this paper cites.
Buchmann, J. A., and H. C. Williams, 1990, A key exchange system based on real quadratic fields, Advances in Cryptology – CRYPTO ’89 , volume 435 of Lecture Notes in Computer Science , pp. 335–343
1990
Earlier work this paper cites.
Damgård, I. B., 1990, On the randomness of Legendre and Jacobi sequences, Advances in Cryptology – CRYPTO ’88 , volume 403 of Lecture Notes in Computer Science , pp. 163–172
1990
Earlier work this paper cites.
Diaconis, P., and D. Rockmore, 1990, Efficient computation of the Fourier transform on finite groups, Journal of the American Mathematical Society 3(2), pp. 297–332
1990
Earlier work this paper cites.
Ireland, K., and M. Rosen, 1990, A Classical Introduction to Modern Number Theory , volume 84 of Graduate Texts in Mathematics , Springer-Verlag, 2nd edition
1990
Earlier work this paper cites.
Jaeger, F., D. L. Vertigan, and D. J. A. Welsh, 1990, On the computational complexity of the Jones and Tutte polynomials, Mathematical Proceedings of the Cambridge Philosophical Society 108(1), pp. 35–53
1990
Earlier work this paper cites.
Pila, J., 1990, Frobenius maps of abelian varieties and finding roots of unity in finite fields, Mathematics of Computation 55(192), pp. 745–763
1990
Earlier work this paper cites.
Rockmore, D., 1990, Fast Fourier analysis for abelian group extensions, Advances in Applied Mathematics 11(2), pp. 164–204
1990
Earlier work this paper cites.
Babai, L., G. Cooperman, L. Finkelstein, E. Luks, and Á. Seress, 1995, Fast Monte Carlo algorithms for permutation groups, Journal of Computer and System Sciences 50(2), pp. 296–308, preliminary version in STOC 1991
1991
Earlier work this paper cites.
Deutsch, D., and R. Jozsa, 1992, Rapid solution of problems by quantum computation, Proceedings of the Royal Society: Mathematical and Physical Sciences 439, pp. 553–558
1992
Earlier work this paper cites.
Fisher, D. S., 1992, Random transverse field Ising spin chains, Physical Review Letters 69(3), pp. 534–537
1992
Earlier work this paper cites.
Bernstein, E., and U. Vazirani, 1993, Quantum complexity theory, Proceeding of the 25th ACM Symposium on Theory of Computing , pp. 11–20
1993
Earlier work this paper cites.
Bernstein, E., and U. Vazirani, 1997, Quantum complexity theory, SIAM Journal on Computing 26(5), pp. 1411–1473, preliminary version in STOC 1993
1993
Earlier work this paper cites.
Buhler, J. P., H. W. Lenstra, Jr., and C. Pomerance, 1993, Factoring integers with the number field sieve, The Development of the Number Field Sieve , Springer, volume 1554 of Lecture Notes in Mathematics , pp. 50–94
1993
Earlier work this paper cites.
Cohen, H., 1993, A Course in Computational Algebraic Number Theory , volume 138 of Graduate Texts in Mathematics , Springer
1993
Earlier work this paper cites.
Gordon, D. M., 1993, Discrete logarithms in GF(P) using the number field sieve, SIAM Journal on Discrete Mathematics 6(1), pp. 124–138
1993
Earlier work this paper cites.
Köbler, J., U. Schöning, and J. Torán, 1993, The Graph Isomorphism Problem: Its Structural Complexity , Springer
1993
Earlier work this paper cites.
Yao, A. C.-C., 1993, Quantum circuit complexity, Proceedings of the 34th IEEE Symposium on Foundations of Computer Science , pp. 352–361
1993
Earlier work this paper cites.
Cleve, R., 1994, A note on computing Fourier transforms by quantum programs, manuscript
1994
Earlier work this paper cites.
Coppersmith, D., 1994, An approximate Fourier transform useful in quantum factoring , Technical Report RC 19642, IBM Research Division, Yorktown Heights, NY, eprint quant-ph/0201067
1994
Earlier work this paper cites.
Hausladen, P., and W. K. Wootters, 1994, A ‘pretty good’ measurement for distinguishing quantum states, Journal of Modern Optics 41, pp. 2385–2390
1994
Earlier work this paper cites.
Papadimitriou, C. H., 1994, Computational Complexity , Addison-Wesley
1994
Earlier work this paper cites.
Shor, P. W., 1997, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26(5), pp. 1484–1509, preliminary version in FOCS 1994
1994
Earlier work this paper cites.
Simon, D. R., 1997, On the power of quantum computation, SIAM Journal on Computing 26(5), pp. 1474–1483, preliminary version in FOCS 1994
1994
Earlier work this paper cites.
Boneh, D., and R. Lipton, 1995, Quantum cryptanalysis of hidden linear functions, Advances in Cryptology – CRYPTO ’95 , volume 963 of Lecture Notes in Computer Science , pp. 424–437
1995
Earlier work this paper cites.
DiVincenzo, D. P., 1995, Two-bit gates are universal for quantum computation, Physical Review A 51, pp. 1015–1022, eprint cond-mat/9407022
1995
Earlier work this paper cites.
Kitaev, A. Y., 1995, Quantum measurements and the Abelian stabilizer problem, eprint quant-ph/9511026
1995
Earlier work this paper cites.
Knill, E., 1995, Approximation by quantum circuits , Technical Report LAUR-95-2225, Los Alamos National Laboratory, eprint quant-ph/9508006
1995
Earlier work this paper cites.
Maslen, D. K., and D. N. Rockmore, 1995, Adapted diameters and the efficient computation of Fourier transforms on finite groups, Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms , pp. 253–262
1995
Earlier work this paper cites.
Thiel, C., 1995, On the complexity of some problems in algorithmic algebraic number theory , Ph.D. thesis, Universität des Saarlandes, Saarbrücken, Germany
1995
Earlier work this paper cites.
Adleman, L. M., and M.-D. Huang, 2001, Counting points on curves and Abelian varieties over finite fields, Journal of Symbolic Computation 32(3), pp. 171–189, preliminary version in ANTS-II 1996
1996
Earlier work this paper cites.
Ajtai, M., 1996, Generating hard instances of lattice problems, Proceedings of the 28th ACM Symposium on Theory of Computing , pp. 99–108
1996
Earlier work this paper cites.
Barenco, A., A. Ekert, K.-A. Suominen, and P. Törmä, 1996, Approximate quantum Fourier transform and decoherence, Physical Review A 54(1), pp. 139–146, eprint quant-ph/9601018
1996
Earlier work this paper cites.
Ekert, A., and R. Jozsa, 1996, Quantum computation and Shor’s factoring algorithm, Reviews of Modern Physics 68(3), pp. 733–753
1996
Earlier work this paper cites.
Grover, L. K., 1997, Quantum mechanics helps in searching for a needle in a haystack, Physical Review Letters 79, pp. 325–328, preliminary version in STOC 1996, eprint quant-ph/9706033
1996
Earlier work this paper cites.
Knill, E., R. Laflamme, and W. Zurek, 1996, Accuracy threshold for quantum computation , Technical Report LAUR-96-2199, Los Alamos National Laboratory, eprint quant-ph/9610011
1996
Cited alongside, same era.
Lloyd, S., 1996, Universal quantum simulators, Science 273, pp. 1073–1078
1996
Cited alongside, same era.
Lorenzini, D., 1996, An Invitation to Arithmetic Geometry , volume 9 of Graduate Studies in Mathematics , AMS
1996
Cited alongside, same era.
Menezes, A. J., P. C. van Oorschot, and S. A. Vanstone, 1996, Handbook of Applied Cryptography , CRC Press
1996
Cited alongside, same era.
Shor, P. W., 1996, Fault-tolerant quantum computation, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science , pp. 56–65, eprint quant-ph/9605011
1996
Cited alongside, same era.
Ip, L., 2003, Shor’s algorithm is optimal, manuscript
2003
Later among the works it cites.
Jozsa, R., 2003, Quantum computation in algebraic number theory: Hallgren’s efficient quantum algorithm for solving Pell’s equation, Annals of Physics 306(2), pp. 241–279, eprint quant-ph/0302134
2003
Later among the works it cites.
Proos, J., and C. Zalka, 2003, Shor’s discrete logarithm quantum algorithm for elliptic curves, Quantum Information & Computation 3(4), pp. 317–344
2003
Later among the works it cites.
Regev, O., 2003, New lattice based cryptographic constructions, Proceedings of the 35th ACM Symposium on Theory of Computing , pp. 407–416, eprint cs.CR/0309051
2003
Later among the works it cites.
Shenvi, N., J. Kempe, and K. B. Whaley, 2003, A quantum random walk search algorithm, Physical Review A 67, 052307, eprint quant-ph/0210064
2003
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Spielman, D. A., 1996, Faster isomorphism testing of strongly regular graphs, Proceedings of the 28th ACM Symposium on Theory of Computing , pp. 576–584
1996
Cited alongside, same era.
Wiesner, S., 1996, Simulations of many-body quantum systems by a quantum computer, eprint quant-ph/9603028
1996
Cited alongside, same era.
Adleman, L. M., J. Demarrais, and M.-D. A. Huang, 1997, Quantum computability, SIAM Journal on Computing 26(5), pp. 1524–1540
1997
Cited alongside, same era.
Aharonov, D., and M. Ben-Or, 2008, Fault-tolerant quantum computation with constant error rate, SIAM Journal on Computing 38(4), pp. 1207–1282, preliminary version in STOC 1997, eprint quant-ph/9611025
1997
Cited alongside, same era.
Ajtai, M., and C. Dwork, 1997, A public-key cryptosystem with worst-case/average-case equivalence, Proceedings of the 29th ACM Symposium on Theory of Computing , pp. 284–293
1997
Cited alongside, same era.
Beals, R., 1997, Quantum computation of Fourier transforms over symmetric groups, Proceedings of the 29th ACM Symposium on Theory of Computing , pp. 48–53
1997
Cited alongside, same era.
Bennett, C. H., E. Bernstein, G. Brassard, and U. Vazirani, 1997, Strengths and weaknesses of quantum computing, SIAM Journal on Computing 26, pp. 1510–1523, eprint quant-ph/9701001
1997
Cited alongside, same era.
Later among the works it cites.
Shi, Y., 2003, Both Toffoli and controlled-NOT need little help to do universal quantum computation, Quantum Information & Computation 3(1), pp. 84–92, eprint quant-ph/0205115
2003
Later among the works it cites.
Agrawal, M., N. Kayal, and N. Saxena, 2004, Primes is in P, Annals of Mathematics 160(2), pp. 781–793
2004
Later among the works it cites.
Aharonov, D., W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, 2007b, Adiabatic quantum computation is equivalent to standard quantum computation, SIAM Journal on Computing 37(1), pp. 166–194, preliminary version in FOCS 2004, eprint quant-ph/0405098
2004
Later among the works it cites.
Ambainis, A., 2007, Quantum walk algorithm for element distinctness, SIAM Journal on Computing 37(1), pp. 210–239, preliminary version in FOCS 2004, eprint quant-ph/0311001
2004
Later among the works it cites.
Buchmann, J., 2004, Introduction to Cryptography , Undergraduate Texts in Mathematics, Springer-Verlag, 2nd edition
2004
Later among the works it cites.
van Dam, W., 2004, Quantum computing and zeros of Zeta functions, manuscript, eprint quant-ph/0405081
2004
Later among the works it cites.
Dürr, C., M. Heiligman, P. Høyer, and M. Mhalla, 2004, Quantum query complexity of some graph problems, Proceedings of the 31st International Colloquium on Automata, Languages and Programming , volume 3142 of Lecture Notes in Computer Science , pp. 481–493, eprint quant-ph/0401091
2004
Later among the works it cites.
Ettinger, M., P. Høyer, and E. Knill, 2004, The quantum query complexity of the hidden subgroup problem is polynomial, Information Processing Letters 91(1), pp. 43–48, eprint quant-ph/0401083
2004
Later among the works it cites.
Gavinsky, D., 2004, Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups, Quantum Information & Computation 4(3), pp. 229–235
2004
Later among the works it cites.
Khot, S., 2005, Hardness of approximating the shortest vector problem in lattices, Journal of the ACM 52(5), pp. 789–808, preliminary version in FOCS 2004
2004
Later among the works it cites.
Moore, C., D. Rockmore, and A. Russell, 2006, Generic quantum Fourier transforms, ACM Transactions on Algorithms 2(4), pp. 707–723, preliminary version in SODA 2004, eprint quant-ph/0304064
2004
Later among the works it cites.
Moore, C., D. N. Rockmore, A. Russell, and L. J. Schulman, 2007a, The power of strong Fourier sampling: Quantum algorithms for affine groups and hidden shifts, SIAM Journal on Computing 37(3), pp. 938–958, preliminary version in SODA 2004, eprint quant-ph/0503095
2004
Later among the works it cites.
Mosca, M., and C. Zalka, 2004, Exact quantum Fourier transforms and discrete logarithm algorithms, International Journal of Quantum Information 2(1), pp. 91–100, eprint quant-ph/0301093
2004
Later among the works it cites.
Reichardt, B. W., 2004, The quantum adiabatic optimization algorithm and local minima, Proceedings of the 36th ACM Symposium on Theory of Computing , pp. 502–510
2004
Later among the works it cites.
Russell, A., and I. E. Shparlinski, 2004, Classical and quantum function reconstruction via character evaluation, Journal of Complexity 20, pp. 404–422
2004
Later among the works it cites.
Szegedy, M., 2004, Quantum speed-up of Markov chain based algorithms, Proceedings of the 45th IEEE Symposium on Foundations of Computer Science , pp. 32–41, eprint quant-ph/0401053
2004
Later among the works it cites.
Ambainis, A., J. Kempe, and A. Rivosh, 2005, Coins make quantum walks faster, Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms , pp. 1099–1108, eprint quant-ph/0402107
2005
Later among the works it cites.
Aspuru-Guzik, A., A. D. Dutoi, P. J. Love, and M. Head-Gordon, 2005, Simulated quantum compuation of molecular energies, Science 309, pp. 1704–1707, eprint quant-ph/0604193
2005
Later among the works it cites.
Bacon, D., A. M. Childs, and W. van Dam, 2005, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, Proceedings of the 46th IEEE Symposium on Foundations of Computer Science , pp. 469–478, eprint quant-ph/0504083
2005
Later among the works it cites.
Bordewich, M., M. Freedman, L. Lovász, and D. Welsh, 2005, Approximate counting and quantum computation, Combinatorics, Probability and Computing 14(5-6), pp. 737–754
2005
Later among the works it cites.
Flaxman, A. D., and B. Przydatek, 2005, Solving medium-density subset sum problems in expected polynomial time, Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science , pp. 305–314
2005
Later among the works it cites.
Hallgren, S., 2005, Fast quantum algorithms for computing the unit group and class group of a number field, Proceedings of the 37th ACM Symposium on Theory of Computing , pp. 468–474
2005
Later among the works it cites.
Kawachi, A., T. Koshiba, H. Nishimura, and T. Yamakami, 2005, Computational indistinguishability between quantum states and its cryptographic application, Advances in Cryptology – EUROCRYPT 2005 , volume 3494 of Lecture Notes in Computer Science , pp. 268–284, eprint quant-ph/0403069
2005
Later among the works it cites.
Kaye, P., 2005, Optimized quantum implementation of elliptic curve arithmetic over binary fields, Quantum Information & Computation 5(6), pp. 474–491
2005
Later among the works it cites.
Koiran, P., V. Nesme, and N. Portier, 2005, A quantum lower bound for the query complexity of Simon’s problem, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming , volume 3580 of Lecture Notes in Computer Science , pp. 1287–1298, eprint quant-ph/0501060
2005
Later among the works it cites.
Kuperberg, G., 2005, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, SIAM Journal on Computing 35(1), pp. 170–188, eprint quant-ph/0302112
2005
Later among the works it cites.
Magniez, F., and A. Nayak, 2007, Quantum complexity of testing group commutativity, Algorithmica 48(3), pp. 221–232, preliminary version in ICALP 2005, eprint quant-ph/0506265
2005
Later among the works it cites.
Magniez, F., M. Santha, and M. Szegedy, 2005, Quantum algorithms for the triangle problem, Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms , pp. 1109–1117, eprint quant-ph/0310134
2005
Later among the works it cites.
Moore, C., A. Russell, and L. J. Schulman, 2005, The symmetric group defies strong Fourier sampling, Proceedings of the 46th IEEE Symposium on Foundations of Computer Science , pp. 479–490, eprint quant-ph/0501056
2005
Later among the works it cites.
Radhakrishnan, J., M. Rötteler, and P. Sen, 2005, On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming , volume 3580 of Lecture Notes in Computer Science , pp. 1399–1411, eprint quant-ph/0503114
2005
Later among the works it cites.
Schmidt, A., and U. Vollmer, 2005, Polynomial time quantum algorithm for the computation of the unit group of a number field, Proceedings of the 37th ACM Symposium on Theory of Computing , pp. 475–480
2005
Later among the works it cites.
Shoup, V., 2005, A Computational Introduction to Number Theory and Algebra , Cambridge University Press
2005
Later among the works it cites.
Aharonov, D., and I. Arad, 2006, The BQP-hardness of approximating the Jones polynomial, eprint quant-ph/0605181
2006
Later among the works it cites.
Aharonov, D., V. Jones, and Z. Landau, 2006, A polynomial quantum algorithm for approximating the Jones polynomial, Proceedings of the 38th ACM Symposium on Theory of Computing , pp. 427–436, eprint quant-ph/0511096
2006
Later among the works it cites.
Ambainis, A., and R. Špalek, 2006, Quantum algorithms for matching and network flows, Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science , volume 3884 of Lecture Notes in Computer Science , pp. 172–183, eprint quant-ph/0508205
2006
Later among the works it cites.
Bacon, D., A. M. Childs, and W. van Dam, 2006, Optimal measurements for the dihedral hidden subgroup problem, Chicago Journal of Theoretical Computer Science 2006(2), eprint quant-ph/0501044
2006
Later among the works it cites.
Buhrman, H., and R. Špalek, 2006, Quantum verification of matrix products, Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms , pp. 880–889, eprint quant-ph/0409035
2006
Later among the works it cites.
van Dam, W., S. Hallgren, and L. Ip, 2006, Quantum algorithms for some hidden shift problems, SIAM Journal on Computing 36(3), pp. 763–778
2006
Later among the works it cites.
Hallgren, S., C. Moore, M. Rötteler, A. Russell, and P. Sen, 2006, Limitations of quantum coset states for graph isomorphism, Proceedings of the 38th ACM Symposium on Theory of Computing , pp. 604–617, eprint quant-ph/0511148, eprint quant-ph/0511149
2006
Later among the works it cites.
Harrow, A. W., and A. Winter, 2006, How many copies are needed for state discrimination?, eprint quant-ph/0606131
2006
Later among the works it cites.
Kedlaya, K. S., 2006, Quantum computation of zeta functions of curves, Computational Complexity 15, pp. 1–19
2006
Later among the works it cites.
Sen, P., 2006, Random measurement bases, quantum state distinction and applications to the hidden subgroup problem, Proceedings of the 21st IEEE Conference on Computational Complexity , pp. 274–287, eprint quant-ph/0512085
2006
Later among the works it cites.
Alagic, G., C. Moore, and A. Russell, 2007, Quantum algorithms for Simon’s problem over general groups, Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms , pp. 1217–1224, eprint quant-ph/0603251
2007
Later among the works it cites.
2007
Later among the works it cites.
Childs, A. M., and W. van Dam, 2007, Quantum algorithm for a generalized hidden shift problem, Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms , pp. 1225–1234, eprint quant-ph/0507190
2007
Later among the works it cites.
2007
Later among the works it cites.
Childs, A. M., and P. Wocjan, 2007, On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems, Quantum Information & Computation 7(5-6), pp. 504–521, eprint quant-ph/0510185
2007
Later among the works it cites.
van Dam, W., G. M. D’Ariano, A. Ekert, C. Macchiavello, and M. Mosca, 2007, Optimal phase estimation in quantum networks, Journal of Physics A 40, pp. 7971–7984
2007
Later among the works it cites.
2007
Later among the works it cites.
Farhi, E., J. Goldstone, and S. Gutmann, 2007, A quantum algorithm for the Hamiltonian NAND tree, eprint quant-ph/0702144
2007
Later among the works it cites.
Ivanyos, G., L. Sanselme, and M. Santha, 2007, An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups, Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science , pp. 586–597, eprint quant-ph/0701235
2007
Later among the works it cites.
Jansen, S., M. B. Ruskai, and R. Seiler, 2007, Bounds for the adiabatic approximation with applications to quantum computation, Journal of Mathematical Physics 48, 102111, eprint quant-ph/0603175
2007
Later among the works it cites.
Kaye, P., R. Laflamme, and M. Mosca, 2007, An Introduction to Quantum Computing , Oxford University Press
2007
Later among the works it cites.
Magniez, F., A. Nayak, J. Roland, and M. Santha, 2007, Search via quantum walk, Proceedings of the 39th ACM Symposium on Theory of Computing , pp. 575–584, eprint quant-ph/0608026
2007
Later among the works it cites.
Pérez-García, D., F. Verstraete, M. M. Wolf, and J. I. Cirac, 2007, Matrix product state representations, Quantum Information & Computation 7(5-6), pp. 401–430, eprint quant-ph/0608197
2007
Later among the works it cites.
2008
Closest in time.
Bacon, D., 2008, How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem, Quantum Information & Computation 8(5), pp. 438–467, eprint quant-ph/0612107
2008
Closest in time.
Cheung, D., D. Maslov, J. Mathew, and D. Pradhan, 2008, On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography, Proceedings of the 3rd Workshop on Theory of Quantum Computation, Communication, and Cryptography , volume 5106 of Lecture Notes in Computer Science , pp. 96–104
2008
Closest in time.
Fenner, S. A., and Y. Zhang, 2008, On the complexity of the hidden subgroup problem, Proceedings of the 5th International Conference on Theory and Applications of Models of Computation , volume 4978 of Lecture Notes in Computer Science , pp. 70–81, eprint quant-ph/0610086
2008
Closest in time.
Hayashi, M., A. Kawachi, and H. Kobayashi, 2008, Quantum measurements for hidden subgroup problems with optimal sample complexity, Quantum Information & Computation 8(3-4), pp. 345–358, eprint quant-ph/0604174
2008
Closest in time.
Ivanyos, G., 2008, On solving systems of random linear disequations, Quantum Information & Computation 8(6-7), pp. 579–594, eprint 0704.2988
2008
Closest in time.
Ivanyos, G., L. Sanselme, and M. Santha, 2008, An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups, Proceedings of the 8th Latin American Symposium on Theoretical Informatics , volume 4957 of Lecture Notes in Computer Science , pp. 759–771, eprint 0707.1260
2008
Closest in time.
2008
Closest in time.
2008
Closest in time.
2008
Closest in time.
Wocjan, P., and J. Yard, 2008, The Jones polynomial: Quantum algorithms and applications in quantum complexity theory, Quantum Information & Computation 8(1-2), pp. 147–180, eprint quant-ph/0603069
2008
Closest in time.
2009
Closest in time.
Barnum, H., and E. Knill, 2002, Reversing quantum dynamics with near-optimal quantum and classical fidelity, Journal of Mathematical Physics 43(5), pp. 2097–2106, eprint quant-ph/0004088
2097
Closest in time.