Quantum algorithms for algebraic problems
暂无分享,去创建一个
[1] J W Alexander,et al. A Lemma on Systems of Knotted Curves. , 1923, Proceedings of the National Academy of Sciences of the United States of America.
[2] V. Fock,et al. Beweis des Adiabatensatzes , 1928 .
[3] G. Pólya,et al. How to Solve It. A New Aspect of Mathematical Method. , 1945 .
[4] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[5] M. Hamermesh. Group theory and its application to physical problems , 1962 .
[6] A. Mullin,et al. Group Theory and its Applications to Physical Problems , 1962 .
[7] A. Clifford,et al. The algebraic theory of semigroups , 1964 .
[8] Charles H. Bennett,et al. Logical reversibility of computation , 1973 .
[9] A. Holevo. Statistical decision theory for quantum systems , 1973 .
[10] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.
[11] Robert S. Kennedy,et al. Optimum testing of multiple hypotheses in quantum detection theory , 1975, IEEE Trans. Inf. Theory.
[12] Keith Kendig. Elementary algebraic geometry , 1976 .
[13] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[14] Jean-Pierre Serre,et al. Linear representations of finite groups , 1977, Graduate texts in mathematics.
[15] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[16] Gary L. Miller,et al. Isomorphism testing for graphs of bounded genus , 1980, STOC '80.
[17] I. S. Filotti,et al. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus , 1980, STOC '80.
[18] Eugene M. Luks,et al. Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[19] Eugene M. Luks. Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.
[20] Stephen M. Stigler,et al. STIGLER'S LAW OF EPONYMY† , 1980 .
[21] M. Rabin. Probabilistic algorithm for testing primality , 1980 .
[22] Christoph M. Hoffmann,et al. Group-Theoretic Algorithms and Graph Isomorphism , 1982, Lecture Notes in Computer Science.
[23] R. Feynman. Simulating physics with computers , 1999 .
[24] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[25] David M. Mount,et al. Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.
[26] Michael Rosen,et al. A classical introduction to modern number theory , 1982, Graduate texts in mathematics.
[27] László Babai,et al. Computational complexity and the classification of finite simple groups , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[28] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[29] Endre Szemerédi,et al. On the Complexity of Matrix Group Problems I , 1984, FOCS.
[30] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .
[31] D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[32] V. Jones. A polynomial invariant for knots via von Neumann algebras , 1985 .
[33] Louis H. Kauffman,et al. State Models and the Jones Polynomial , 1987 .
[34] C. P. Schnorr,et al. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..
[35] C. Pomerance. Fast, Rigorous Factorization and Discrete Logarithm Algorithms , 1987 .
[36] Thomas Beth,et al. On the Computational Complexity of the General Discrete Fourier Transform , 1987, Theor. Comput. Sci..
[37] Ivan Damgård,et al. On the Randomness of Legendre and Jacobi Sequences , 1990, CRYPTO.
[38] Bert den Boer. Diffie-Hellman is as Strong as Discrete Log for Certain Primes , 1988, CRYPTO.
[39] P. Diaconis. Group representations in probability and statistics , 1988 .
[40] Michael Clausen,et al. Fast Generalized Fourier Transforms , 1989, Theor. Comput. Sci..
[41] D. Deutsch. Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[42] M. Hammermesh,et al. Group theory and its applications to physical problems , 1989 .
[43] Edward Witten,et al. Quantum field theory and the Jones polynomial , 1989 .
[44] Johannes A. Buchmann,et al. A Key Exchange System Based on Real Quadratic Fields , 1989, CRYPTO.
[45] J. Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields , 1990 .
[46] D. Welsh,et al. On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.
[47] J. Pila. Frobenius maps of Abelian varieties and finding roots of unity in finite fields , 1990 .
[48] D. Rockmore. Fast Fourier analysis for abelian group extensions , 1990 .
[49] László Babai,et al. Fast Monte Carlo algorithms for permutation groups , 1991, STOC '91.
[50] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[51] Fisher,et al. Random transverse field Ising spin chains. , 1992, Physical review letters.
[52] Jacobo Torán,et al. The graph isomorphism problem , 2020, Commun. ACM.
[53] A. K. Lenstra,et al. The Development of the Number Field Sieve , 1993 .
[54] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.
[55] Marek Karpinski,et al. Counting curves and their projections , 1993, computational complexity.
[56] H. Lenstra,et al. Factoring integers with the number field sieve , 1993 .
[57] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[58] J. Köbler,et al. The Graph Isomorphism Problem: Its Structural Complexity , 1993 .
[59] Daniel M. Gordon,et al. Discrete Logarithms in GF(P) Using the Number Field Sieve , 1993, SIAM J. Discret. Math..
[60] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[61] Sinnou David,et al. Séminaire de Théorie des Nombres, Paris, 1990–91 , 1993 .
[62] Daniel R. Simon. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[63] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[64] William K. Wootters,et al. A ‘Pretty Good’ Measurement for Distinguishing Quantum States , 1994 .
[65] Carl Pomerance,et al. The Development of the Number Field Sieve , 1994 .
[66] D. Coppersmith. An approximate Fourier transform useful in quantum factoring , 2002, quant-ph/0201067.
[67] Daniel N. Rockmore,et al. Adapted diameters and the efficient computation of Fourier transforms on finite groups , 1995, SODA '95.
[68] Christoph Thiel. On the complexity of some problems in algorithmic algebraic number theory , 1995 .
[69] Richard J. Lipton,et al. Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) , 1995, CRYPTO.
[70] A.Yu.Kitaev. Quantum measurements and the Abelian Stabilizer Problem , 1995, quant-ph/9511026.
[71] DiVincenzo. Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.
[72] E. Knill. Approximation by Quantum Circuits , 1995 .
[73] Miklós Ajtai,et al. Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.
[74] Young,et al. Numerical study of the random transverse-field Ising spin chain. , 1996, Physical review. B, Condensed matter.
[75] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[76] Barenco,et al. Approximate quantum Fourier transform and decoherence. , 1996, Physical review. A, Atomic, molecular, and optical physics.
[77] R. Jozsa,et al. Quantum Computation and Shor's Factoring Algorithm , 1996 .
[78] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[79] S. Wiesner. Simulations of Many-Body Quantum Systems by a Quantum Computer , 1996, quant-ph/9603028.
[80] Alexei Y. Kitaev,et al. Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..
[81] E. Knill,et al. Accuracy threshold for quantum computation , 1996 .
[82] Dino J. Lorenzini. An Invitation to Arithmetic Geometry , 1996 .
[83] Daniel A. Spielman,et al. Faster isomorphism testing of strongly regular graphs , 1996, STOC '96.
[84] Seth Lloyd,et al. Universal Quantum Simulators , 1996, Science.
[85] Miklós Ajtai,et al. Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[86] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[87] P. Høyer. Efficient Quantum Transforms , 1997, quant-ph/9702028.
[88] Robert Beals,et al. Quantum computation of Fourier transforms over symmetric groups , 1997, STOC '97.
[89] A. Kitaev. Quantum computations: algorithms and error correction , 1997 .
[90] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[91] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[92] Erez Petrank,et al. Is code equivalence easy to decide? , 1997, IEEE Trans. Inf. Theory.
[93] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[94] Cynthia Dwork,et al. A public-key cryptosystem with worst-case/average-case equivalence , 1997, STOC '97.
[95] Leonard M. Adleman,et al. Quantum Computability , 1997, SIAM J. Comput..
[96] Gilles Brassard,et al. Quantum cryptanalysis of hash and claw-free functions , 1997, SIGA.
[97] K. Williams,et al. Gauss and Jacobi sums , 2021, Mathematical Surveys and Monographs.
[98] J. Preskill. Reliable quantum computers , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[99] Neal Koblitz,et al. Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.
[100] E. Knill,et al. Resilient quantum computation: error models and thresholds , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[101] Christof Zalka. Simulating quantum systems on a quantum computer , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[102] Michele Mosca,et al. The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer , 1998, QCQC.
[103] Daniele Micciancio,et al. The shortest vector in a lattice is hard to approximate to within some constant , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[104] E. Knill,et al. Power of One Bit of Quantum Information , 1998, quant-ph/9802037.
[105] E. Farhi,et al. Quantum computation and decision trees , 1997, quant-ph/9706062.
[106] R. Cleve,et al. Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[107] Mark Ettinger,et al. On Quantum Algorithms for Noncommutative Hidden Subgroups , 1998, STACS.
[108] E. Knill,et al. Hidden Subgroup States are Almost Orthogonal , 1999, quant-ph/9901034.
[109] Ueli Maurer,et al. The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1999, SIAM J. Comput..
[110] P. Høyer,et al. A Quantum Observable for the Graph Isomorphism Problem , 1999, quant-ph/9901029.
[111] V. Roychowdhury,et al. On Universal and Fault-Tolerant Quantum Computing , 1999, quant-ph/9906054.
[112] Ronald de Wolf,et al. Bounds for small-error and zero-error quantum algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[113] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[114] A. Terras. Fourier Analysis on Finite Groups and Applications: Index , 1999 .
[115] Lance Fortnow,et al. Complexity limitations on quantum computation , 1999, J. Comput. Syst. Sci..
[116] Martin Rötteler,et al. Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups , 1999, AAECC.
[117] Ulrich Vollmer,et al. Asymptotically Fast Discrete Logarithms in Quadratic Number Fields , 2000, ANTS.
[118] Sean Hallgren,et al. An improved quantum Fourier transform algorithm and applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[119] R. Cleve,et al. Sharp Quantum vs. Classical Query Complexity Separations , 2000, quant-ph/0011065.
[120] Andris Ambainis,et al. Quantum lower bounds by quantum arguments , 2000, STOC '00.
[121] Richard Cleve,et al. The query complexity of order-finding , 1999, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[122] SRIDHAR RAJAGOPALAN,et al. Verification of Identities , 2000, SIAM J. Comput..
[123] Richard Cleve,et al. Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[124] P. Oscar Boykin,et al. A new universal and fault-tolerant quantum basis , 2000, Inf. Process. Lett..
[125] E. Knill,et al. Reversing quantum dynamics with near-optimal quantum and classical fidelity , 2000, quant-ph/0004088.
[126] Michael Larsen,et al. A Modular Functor Which is Universal¶for Quantum Computation , 2000, quant-ph/0001108.
[127] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[128] 변재웅. Efficient computation of the fourier transform on the finite groups , 2000 .
[129] P. Rowlinson. FOURIER ANALYSIS ON FINITE GROUPS AND APPLICATIONS (London Mathematical Society Student Texts 43) , 2000 .
[130] Ravi Kumar,et al. A sieve algorithm for the shortest lattice vector problem , 2001, STOC '01.
[131] Leonard M. Adleman,et al. Counting Points on Curves and Abelian Varieties Over Finite Fields , 2001, J. Symb. Comput..
[132] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[133] Umesh V. Vazirani,et al. Quantum mechanical algorithms for the nonabelian hidden subgroup problem , 2001, STOC '01.
[134] Michele Mosca,et al. Decomposing finite Abelian groups , 2001, Quantum Inf. Comput..
[135] Frédéric Magniez,et al. Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem , 2001, SPAA '01.
[136] Frédéric Magniez,et al. Quantum algorithms for element distinctness , 2000, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[137] M. Freedman,et al. Topological Quantum Computation , 2001, quant-ph/0101025.
[138] Umesh V. Vazirani,et al. How powerful is adiabatic quantum computation? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[139] John Watrous. Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity , 2001, J. Comput. Syst. Sci..
[140] John Watrous,et al. Quantum algorithms for solvable groups , 2000, STOC '01.
[141] J. K. Lenstra,et al. Solving the Pell equation , 2002 .
[142] Terry Rudolph,et al. A 2 rebit gate universal for quantum computing , 2002 .
[143] B. Recht,et al. Efficient discrete approximations of quantum gates , 2001, quant-ph/0111031.
[144] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[145] Richard Cleve,et al. Sharp Quantum versus Classical Query Complexity Separations , 2002, Algorithmica.
[146] Gadiel Seroussi,et al. Efficient Quantum Algorithms for Estimating Gauss Sums , 2002, quant-ph/0207131.
[147] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.
[148] Wim van Dam,et al. Quantum Algorithms for Weighing Matrices and Quadratic Residues , 2000, Algorithmica.
[149] Oded Regev,et al. Quantum computation and lattice problems , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[150] M. Freedman,et al. Simulation of Topological Field Theories¶by Quantum Computers , 2000, quant-ph/0001071.
[151] Lisa R. Hales. The quantum fourier transform and extensions of the abelian hidden subgroup problem , 2002 .
[152] K. Birgitta Whaley,et al. Quantum random-walk search algorithm , 2002, quant-ph/0210064.
[153] Daniel A. Spielman,et al. Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.
[154] Andris Ambainis,et al. QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS , 2003, quant-ph/0403120.
[155] Alexander Russell,et al. The Hidden Subgroup Problem and Quantum Computation Using Group Representations , 2003, SIAM J. Comput..
[156] Frédéric Magniez,et al. Hidden translation and orbit coset in quantum computing , 2002, STOC '03.
[157] Richard Jozsa. Quantum computation in algebraic number theory: Hallgren’s efficient quantum algorithm for solving Pell’s equation , 2003 .
[158] Lawrence Ip. Shor ’ s Algorithm is Optimal , 2003 .
[159] Yaoyun Shi. Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..
[160] Michele Mosca,et al. Exact quantum Fourier transforms and discrete logarithm algorithms , 2003 .
[161] Michele Mosca,et al. Quantum Computer Algorithms , 2003 .
[162] D. Aharonov. A Simple Proof that Toffoli and Hadamard are Quantum Universal , 2003, quant-ph/0301040.
[163] Sean Hallgren,et al. Quantum algorithms for some hidden shift problems , 2003, SODA '03.
[164] Christof Zalka,et al. Shor's discrete logarithm quantum algorithm for elliptic curves , 2003, Quantum Inf. Comput..
[165] Adam Tauman Kalai,et al. Noise-tolerant learning, the parity problem, and the statistical query model , 2000, STOC '00.
[166] Alexander Russell,et al. Generic quantum Fourier transforms , 2004, SODA '04.
[167] Ben Reichardt,et al. The quantum adiabatic optimization algorithm and local minima , 2004, STOC '04.
[168] Dmitry Gavinsky,et al. Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups , 2004, Quantum Inf. Comput..
[169] Alexander Russell,et al. Classical and quantum function reconstruction via character evaluation , 2004, J. Complex..
[170] Andrew M. Childs,et al. Spatial search and the Dirac equation , 2004 .
[171] Manindra Agrawal,et al. PRIMES is in P , 2004 .
[172] M. Szegedy,et al. Quantum Walk Based Search Algorithms , 2008, TAMC.
[173] Subhash Khot,et al. Hardness of approximating the shortest vector problem in lattices , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[174] Andris Ambainis,et al. Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.
[175] Emanuel Knill,et al. The quantum query complexity of the hidden subgroup problem is polynomial , 2004, Inf. Process. Lett..
[176] O. Regev. A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space , 2004, quant-ph/0406151.
[177] Mehdi Mhalla,et al. Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..
[178] Andrew M. Childs,et al. Spatial search by quantum walk , 2003, quant-ph/0306054.
[179] Oded Regev,et al. New lattice based cryptographic constructions , 2003, STOC '03.
[180] Johannes Buchmann,et al. Introduction to Cryptography (Undergraduate Texts in Mathematics) , 2004 .
[181] Phillip Kaye. Optimized quantum implementation of elliptic curve arithmetic over binary fields , 2005, Quantum Inf. Comput..
[182] P. Campbell. How to Solve It: A New Aspect of Mathematical Method , 2005 .
[183] Abraham D. Flaxman,et al. Solving Medium-Density Subset Sum Problems in Expected Polynomial Time , 2005, STACS.
[184] Sean Hallgren,et al. Fast quantum algorithms for computing the unit group and class group of a number field , 2005, STOC '05.
[185] Greg Kuperberg. A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem , 2005, SIAM J. Comput..
[186] Andris Ambainis,et al. Coins make quantum walks faster , 2004, SODA '05.
[187] Jaikumar Radhakrishnan,et al. On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group , 2005, ICALP.
[188] Alexander Russell,et al. The symmetric group defies strong Fourier sampling , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[189] László Lovász,et al. Approximate Counting and Quantum Computation , 2005, Combinatorics, Probability and Computing.
[190] Pawel Wocjan,et al. On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems , 2007, Quantum Inf. Comput..
[191] Vincent Nesme,et al. Adversary Lower Bounds for Nonadaptive Quantum Algorithms , 2008 .
[192] Marek Karpinski,et al. Counting curves and their projections , 2005, computational complexity.
[193] Frédéric Magniez,et al. Quantum algorithms for the triangle problem , 2005, SODA '05.
[194] M. Head‐Gordon,et al. Simulated Quantum Computation of Molecular Energies , 2005, Science.
[195] Andris Ambainis,et al. Quantum Search of Spatial Regions , 2005, Theory Comput..
[196] Ulrich Vollmer,et al. Polynomial time quantum algorithm for the computation of the unit group of a number field , 2005, STOC '05.
[197] Victor Shoup,et al. A computational introduction to number theory and algebra , 2005 .
[198] Takeshi Koshiba,et al. Computational Indistinguishability Between Quantum States and Its Cryptographic Application , 2005, EUROCRYPT.
[199] Jaikumar Radhakrishnan,et al. Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem , 2005, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[200] Dave Bacon,et al. Optimal measurements for the dihedral hidden subgroup problem , 2005, Chic. J. Theor. Comput. Sci..
[201] Martin Rötteler,et al. Limitations of quantum coset states for graph isomorphism , 2006, STOC '06.
[202] Alan G. B. Lauder,et al. Counting points on varieties over finite fields of small characteristic , 2006, math/0612147.
[203] Subhash Khot. Hardness of approximating the Shortest Vector Problem in high lp norms , 2006, J. Comput. Syst. Sci..
[204] Dorit Aharonov,et al. The BQP-hardness of approximating the Jones polynomial , 2006, ArXiv.
[205] Andris Ambainis,et al. Quantum Algorithms for Matching and Network Flows , 2006, STACS.
[206] Harry Buhrman,et al. Quantum verification of matrix products , 2004, SODA '06.
[207] Kiran S. Kedlaya. Quantum computation of zeta functions of curves , 2006, computational complexity.
[208] Raymond Laflamme,et al. An Introduction to Quantum Computing , 2007, Quantum Inf. Comput..
[209] Vincent Nesme,et al. The quantum query complexity of the abelian hidden subgroup problem , 2007, Theor. Comput. Sci..
[210] Alexander Russell,et al. On the impossibility of a quantum sieve algorithm for graph isomorphism , 2007, STOC '07.
[211] Seth Lloyd,et al. Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation , 2007, SIAM J. Comput..
[212] Alexander Russell,et al. The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts , 2007, SIAM J. Comput..
[213] Frédéric Magniez,et al. Quantum Complexity of Testing Group Commutativity , 2005, Algorithmica.
[214] Sebastian Dörn. Quantum Complexity Bounds of Independent Set Problems , 2007, SOFSEM.
[215] A. Russell,et al. A classical one-way function to confound quantum adversaries , 2007, quant-ph/0701115.
[216] Frédéric Magniez,et al. Search via quantum walk , 2006, STOC '07.
[217] Andris Ambainis,et al. Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[218] M. Ruskai,et al. Bounds for the adiabatic approximation with applications to quantum computation , 2006, quant-ph/0603175.
[219] Sean Hallgren. Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem , 2007, JACM.
[220] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[221] Frank Verstraete,et al. Matrix product state representations , 2006, Quantum Inf. Comput..
[222] Andris Ambainis. A nearly optimal discrete query quantum algorithm for evaluating NAND formulas , 2007 .
[223] D. Aharonov,et al. Polynomial Quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane Preliminary Version , 2008 .
[224] Andrew M. Childs,et al. Quantum algorithm for a generalized hidden shift problem , 2005, SODA '07.
[225] Miklos Santha,et al. An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups , 2007, STACS.
[226] Umesh V. Vazirani,et al. Quantum Algorithms for Hidden Nonlinear Structures , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[227] Alexander Russell,et al. Quantum algorithms for Simon's problem over general groups , 2006, SODA '07.
[228] Thomas Thierauf,et al. The Quantum Query Complexity of Algebraic Properties , 2007, FCT.
[229] Michele Mosca,et al. Optimal phase estimation in quantum networks , 2007, 0706.4412.
[230] Shengyu Zhang,et al. Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer , 2007 .
[231] Masahito Hayashi,et al. Quantum measurements for hidden subgroup problems with optimal sample complexity , 2006, Quantum Inf. Comput..
[232] Peter W. Shor,et al. Estimating Jones polynomials is a complete problem for one clean qubit , 2007, Quantum Inf. Comput..
[233] Ben Reichardt,et al. Fault-Tolerant Quantum Computation , 2016, Encyclopedia of Algorithms.
[234] Pawel Wocjan,et al. The Jones polynomial: quantum algorithms and applications in quantum complexity theory , 2008, Quantum Inf. Comput..
[235] Thomas Thierauf,et al. The Quantum Complexity of Group Testing , 2008, SOFSEM.
[236] Edward Farhi,et al. A Quantum Algorithm for the Hamiltonian NAND Tree , 2008, Theory Comput..
[237] Dave Bacon,et al. How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem , 2006, Quantum Inf. Comput..
[238] Dorit Aharonov,et al. Fault-tolerant Quantum Computation with Constant Error Rate * , 1999 .
[239] Dorit Aharonov,et al. A Polynomial Quantum Algorithm for Approximating the Jones Polynomial , 2008, Algorithmica.
[240] Ben Reichardt,et al. Span-program-based quantum algorithm for evaluating formulas , 2007, Theory Comput..
[241] Gábor Ivanyos,et al. On solving systems of random linear disequations , 2007, Quantum Inf. Comput..
[242] Oleg E. Melnik,et al. Encyclopedia of Complexity and Systems Science , 2008 .
[243] Dhiraj K. Pradhan,et al. On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography , 2007, TQC.
[244] John Watrous,et al. Quantum Computational Complexity , 2008, Encyclopedia of Complexity and Systems Science.
[245] Pawel Wocjan,et al. Estimating Jones and Homfly polynomials with one clean qubit , 2008, Quantum Inf. Comput..
[246] J. Torán,et al. Isomorphism and Factorization – Classical and Quantum Algorithms , 2009 .
[247] Pawel Wocjan,et al. Efficient quantum algorithm for identifying hidden polynomials , 2007, Quantum Inf. Comput..
[248] Frédéric Wang. The Hidden Subgroup Problem , 2010, 1008.0010.
[249] Miklos Santha,et al. An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups , 2007, Algorithmica.
[250] Andrew M. Childs,et al. ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N1/2+o(1) ON A QUANTUM COMPUTER , 2010 .
[251] Zeph Landau,et al. Quantum Computation and the Evaluation of Tensor Networks , 2008, SIAM J. Comput..
[252] Takeshi Koshiba,et al. Computational Indistinguishability Between Quantum States and Its Cryptographic Application , 2004, Journal of Cryptology.
[253] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[254] Andreas J. Winter,et al. How Many Copies are Needed for State Discrimination? , 2012, IEEE Transactions on Information Theory.