Quantum algorithms for algebraic problems

<i>Quantum Computation and Quantum Information</i>

Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works

Quantum computation and quantum information

Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,449 · see citing works

New directions in cryptography

Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713 · see citing works

A method for obtaining digital signatures and public-key cryptosystems

Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works

A method for obtaining digital signatures and public-key cryptosystems

Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012 · see citing works

Handbook of applied cryptography

(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357 · see citing works

A fast quantum mechanical algorithm for database search

Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · see citing works

Algorithms for quantum computation: discrete logarithms and factoring

Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · see citing works

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472 · see citing works

Simulating physics with computers

Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works

An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)

B., T. A. A. (1946) · The Mathematical Gazette · doi:10.2307/3609182 · Cited by 7,192 · see citing works

Quantum field theory and the Jones polynomial

Witten, E. (1989) · Communications in Mathematical Physics · doi:10.1007/bf01217730 · Cited by 4,758 · see citing works

Quantum theory, the Church–Turing principle and the universal quantum computer

Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597 · see citing works

Quantum Mechanics Helps in Searching for a Needle in a Haystack

Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 2× · see citing works

Factoring polynomials with rational coefficients

Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,061 · see citing works

The algebraic theory of semigroups

Clifford, A. H., & Preston, G. B. (1964) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,792 · see citing works

Logical Reversibility of Computation

Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · see citing works

Universal Quantum Simulators

Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2× · see citing works

Handbook of Applied Cryptography

Menezes, A., van Oorschot, P. C., & Vanstone, S. A. (2010) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,910 · see citing works

Rapid solution of problems by quantum computation

Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700 · see citing works

A Course in Computational Algebraic Number Theory

Cohen, H. (1993) · Graduate texts in mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,608 · see citing works

Linear Representations of Finite Groups

Serre, J.-P. (1977) · Graduate texts in mathematics · doi:10.1007/978-1-4684-9458-7 · Cited by 2,404 · see citing works

Computational Complexity

Brucker, P. (1995) · Springer eBooks · doi:10.1007/978-3-662-03088-2_3 · Cited by 2,296 · see citing works

A Classical Introduction to Modern Number Theory

Ireland, K., & Rosen, M. (1982) · Graduate texts in mathematics · doi:10.1007/978-1-4757-1779-2 · Cited by 2,178 · see citing works

How to Solve It. A New Aspect of Mathematical Method.

Bell, E. T., & Pólya, G. (1945) · American Mathematical Monthly · doi:10.2307/2306109 · Cited by 1,827 · see citing works

Group Theory and its Applications to Physical Problems

Hamermesh, M., & Mullin, A. A. (1962) · American Journal of Physics · doi:10.1119/1.1941790 · Cited by 1,735 · see citing works

Quantum amplitude amplification and estimation

Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680 · see citing works

A polynomial invariant for knots via von Neumann algebras

Jones, V. F. R. (1985) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1985-15304-2 · Cited by 1,669 · see citing works

How to Solve It

Pólya, G. (1945) · Princeton University Press eBooks · doi:10.1515/9781400828678 · Cited by 1,644 · see citing works

Quantum Complexity Theory

Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503 · see citing works

Beweis des Adiabatensatzes

Born, M., & Fock, V. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01343193 · Cited by 1,494 · see citing works

Strengths and Weaknesses of Quantum Computing

Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470 · see citing works

State models and the jones polynomial

Kauffman, L. H. (1987) · Topology · doi:10.1016/0040-9383(87)90009-7 · Cited by 1,465 · see citing works

Integer Programming with a Fixed Number of Variables

Lenstra, H. W. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.4.538 · Cited by 1,457 · see citing works

Generating hard instances of lattice problems (extended abstract)

Ajtai, M. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237838 · Cited by 1,434 · see citing works

Quantum computations: algorithms and error correction

Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · see citing works

Simulated Quantum Computation of Molecular Energies

Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418 · see citing works

How to Solve It : A New Aspect of Mathematical Method

Pólya, G. (2014) · Cited by 1,416 · see citing works

Classical and Quantum Computation

Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387 · see citing works

Group representations in probability and statistics

Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381 · see citing works

Quantum computation and Shor's factoring algorithm

Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354 · see citing works

A Classical Introduction to Modern Number Theory

Ireland, K., & Rosen, M. (1990) · Graduate texts in mathematics · doi:10.1007/978-1-4757-2103-4 · Cited by 1,311 · see citing works

On the Power of Quantum Computation

Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295 · see citing works

Quantum complexity theory

Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284 · see citing works

Quantum algorithms revisited

Cleve, R., EKERT, A. K., Macchiavello, C., & Mosca, M. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0164 · Cited by 1,279 · see citing works

Quantum computational networks

Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270 · see citing works

Quantum computation and decision trees

Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · see citing works

Quantum random-walk search algorithm

Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150 · see citing works

Two-bit gates are universal for quantum computation

DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069 · see citing works

Reliable quantum computers

Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994 · see citing works

An Introduction to Quantum Computing

Kaye, P., Laflamme, R., & Mosca, M. (2007) · Quantum information & computation · doi:10.1093/oso/9780198570004.001.0001 · Cited by 968 · see citing works

Fault-tolerant quantum computation

Shor, P. W. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 943 · see citing works

PRIMES is in P

Agrawal, M., Kayal, N., & Saxena, N. (2004) · Annals of Mathematics · doi:10.4007/annals.2004.160.781 · Cited by 938 · see citing works

Power of One Bit of Quantum Information

Knill, E. H., & Laflamme, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5672 · Cited by 880 · see citing works

Probabilistic algorithm for testing primality

Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 878 · see citing works

Exponential algorithmic speedup by a quantum walk

Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · see citing works

Untitled work

(1996) · Cited by 824 · see citing works

Quantum Walk Algorithm for Element Distinctness

Ambainis, A. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447311 · Cited by 727 · see citing works

Spatial search by quantum walk

Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725 · see citing works

Riemann's hypothesis and tests for primality

Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709 · see citing works

Topological quantum computation

Freedman, M. H., Kitaev, A., Larsen, M., & Wang, Z. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00964-3 · Cited by 686 · see citing works

Isomorphism of graphs of bounded valence can be tested in polynomial time

Luks, E. M. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90009-5 · Cited by 660 · see citing works

A hierarchy of polynomial time lattice basis reduction algorithms

Schnorr, C. P. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90064-8 · Cited by 659 · see citing works

Statistical decision theory for quantum systems

Holevo, A. S. (1973) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(73)90028-6 · Cited by 653 · see citing works

A public-key cryptosystem with worst-case/average-case equivalence

Ajtai, M., & Dwork, C. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258604 · Cited by 649 · see citing works

Random transverse field Ising spin chains

Fisher, D. S. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.534 · Cited by 640 · see citing works

Quantum lower bounds by polynomials

Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639 · see citing works

Quantum circuit complexity

Yao, A. C.-C. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366852 · Cited by 639 · see citing works

QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS

AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632 · see citing works

An introduction to the theory of numbers

Hardy, G. H. (1929) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1929-04793-1 · Cited by 607 · see citing works

Generating Hard Instances of Lattice ProblemsPreprint

Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606 · see citing works

Untitled work

(2004) · doi:10.1109/focs.2004.53 · Cited by 599 · see citing works

Noise-tolerant learning, the parity problem, and the statistical query model

Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598 · see citing works

Topological Quantum Computation

Wang, Z. (2010) · Regional conference series in mathematics · doi:10.1090/cbms/112 · Cited by 595 · see citing works

The development of the number field sieve

Lenstra, A. K., Lenstra, H. W., Lenstra, A. K., Lenstra, H. W., Manasse, M. S., & Pollard, J. M. (1993) · Lecture notes in mathematics · doi:10.1007/bfb0091534 · Cited by 575 · see citing works

A Modular Functor Which is Universal¶for Quantum Computation

Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573 · see citing works

Matrix Product State Representations

Perez-Garcia, D., Verstraete, F., Wolf, M., & Cirac, J. I. (2006) · Ghent University Academic Bibliography (Ghent University) · Cited by 565 · see citing works

A sieve algorithm for the shortest lattice vector problem

Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380857 · Cited by 565 · see citing works

A Computational Introduction to Number Theory and Algebra

Shoup, V. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814549 · Cited by 564 · see citing works

Gauss and Jacobi sums

Berndt, B. C., Williams, K. S., & Evans, R. J. (1998) · Cited by 544 · see citing works

P = BPP if E requires exponential circuits

Impagliazzo, R., & Wigderson, A. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258590 · Cited by 540 · see citing works

Elliptic curves over finite fields and the computation of square roots mod 𝑝

Schoof, R. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777280-6 · Cited by 519 · see citing works

Quantum Amplitude Amplification and Estimation

Gilles Brassard, A., Høyer, P., Mosca, M., & Tapp, A. (2000) · doi:10.48550/arxiv.quant-ph/0005055 · Cited by 514 · see citing works

Fault-Tolerant Quantum Computation with Constant Error Rate

Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513 · see citing works

A Lemma on Systems of Knotted Curves

Alexander, J. W. (1923) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.9.3.93 · Cited by 502 · see citing works

On the computational complexity of the Jones and Tutte polynomials

Jaeger, F., Vertigan, D., & Welsh, D. J. A. (1990) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100068936 · Cited by 500 · see citing works

Optimum testing of multiple hypotheses in quantum detection theory

Yuen, H. P., Kennedy, R., & Lax, M. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055351 · Cited by 496 · see citing works

Complexity of Lattice Problems

Micciancio, D., & Goldwasser, S. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0897-7 · Cited by 488 · see citing works

Quantum measurements and the Abelian Stabilizer ProblemPreprint

Kitaev, A. (1995) · arXiv (Cornell University) · Cited by 472 · see citing works

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447323 · Cited by 457 · see citing works

Complexity of lattice problems : a cryptographic perspective

Micciancio, D., & Goldwasser, S. (2002) · Cited by 438 · see citing works

Introduction to Cryptography

Buchmann, J. A. (2004) · Undergraduate texts in mathematics · doi:10.1007/978-1-4419-9003-7 · Cited by 412 · see citing works

Encyclopedia of Complexity and Systems Science

Nowak, A., & Strawinska-Zanko, U. A. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3 · Cited by 409 · see citing works

Simulating quantum systems on a quantum computer

Zalka, C. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0162 · Cited by 387 · see citing works

Bounds for the adiabatic approximation with applications to quantum computation

Jansen, S., Ruskai, M.-B., & Seiler, R. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2798382 · Cited by 385 · see citing works

Fourier analysis on finite groups and applications

Terras, A. A. (2000) · Choice Reviews Online · doi:10.5860/choice.37-6316 · Cited by 381 · see citing works

Shor's discrete logarithm quantum algorithm for elliptic curves

Proos, J., & Zalka, C. (2003) · Quantum Information and Computation · doi:10.26421/qic3.4-3 · Cited by 367 · see citing works

A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

Kuperberg, G. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539703436345 · Cited by 357 · see citing works

Resilient quantum computation: error models and thresholds

Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346 · see citing works

Quantum Lower Bounds by Quantum Arguments

Ambainis, A. (2002) · Journal of Computer and System Sciences · doi:10.1006/jcss.2002.1826 · Cited by 345 · see citing works

An approximate Fourier transform useful in quantum factoring

Coppersmith, D. (2002) · arXiv · doi:10.48550/arxiv.quant-ph/0201067 · Cited by 343 · see citing works

A ‘Pretty Good’ Measurement for Distinguishing Quantum States

Hausladen, P. A., & Wootters, W. K. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552221 · Cited by 338 · see citing works

Algebraic aspects of cryptography

(1998) · Choice Reviews Online · doi:10.5860/choice.36-2204 · Cited by 336 · see citing works

Quantum Algorithms for the Triangle Problem

Magniez, F., Sántha, M., & Szegedy, M. (2007) · SIAM Journal on Computing · doi:10.1137/050643684 · Cited by 332 · see citing works

Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve

Gordon, D. M. (1993) · SIAM Journal on Discrete Mathematics · doi:10.1137/0406010 · Cited by 320 · see citing works

Fourier Analysis on Finite Groups and Applications

Terras, A. A. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626265 · Cited by 317 · see citing works

The Graph Isomorphism Problem

Köbler, J., Schöning, U., & Torán, J. (1993) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0333-9 · Cited by 301 · see citing works

Resilient Quantum Computation: Error Models and Thresholds

Knill, E. H., Laflamme, R., & Zurek, W. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 299 · see citing works

A Polynomial Quantum Algorithm for Approximating the Jones Polynomial

Aharonov, D., Jones, V. F. R., & Landau, Z. A. (2008) · Algorithmica · doi:10.1007/s00453-008-9168-0 · Cited by 296 · see citing works

New lattice-based cryptographic constructions

Regev, O. (2004) · Journal of the ACM · doi:10.1145/1039488.1039490 · Cited by 295 · see citing works

STIGLER'S LAW OF EPONYMY*

Stigler, S. M. (1980) · Transactions of the New York Academy of Sciences · doi:10.1111/j.2164-0947.1980.tb02775.x · Cited by 291 · see citing works

Reversing quantum dynamics with near-optimal quantum and classical fidelity

Barnum, H., & Knill, E. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1459754 · Cited by 280 · see citing works

Simulation of Topological Field Theories¶by Quantum Computers

Freedman, M. H., Kitaev, A., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200635 · Cited by 274 · see citing works

ACM-SIAM Symposium on Discrete Algorithms

Clifford, R., Jalsenius, M., & Sach, B. (2015) · Symposium on Discrete Algorithms · Cited by 273 · see citing works

Algebraic Aspects of Cryptography

Koblitz, N. (1998) · Algorithms and computation in mathematics · doi:10.1007/978-3-662-03642-6 · Cited by 268 · see citing works

Coins Make Quantum Walks FasterPreprint

Ambainis, A., Kempe, J., & Rivosh, A. (2004) · arXiv (Cornell University) · doi:10.5555/1070432.1070590 · Cited by 261 · see citing works

Quantum cryptanalysis of hash and claw-free functions: Invited paper

Brassard, G., HØyer, P., & Tapp, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054319 · Cited by 251 · see citing works

Quantum Computability

Adleman, L. M., DeMarrais, J., & Huang, M.-D. A. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293639 · Cited by 250 · see citing works

The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.Preprint

Ajtai, M. (1997) · Electronic colloquium on computational complexity · Cited by 244 · see citing works

On The Complexity Of Matrix Group Problems I

Babai, L., & Szemerédi, E. (1984) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715919 · Cited by 223 · see citing works

Fast parallel circuits for the quantum Fourier transform

Cleve, R., & Watrous, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892140 · Cited by 223 · see citing works

Hardness of approximating the shortest vector problem in lattices

Khot, S. (2005) · Journal of the ACM · doi:10.1145/1089023.1089027 · Cited by 217 · see citing works

Bounds for the adiabatic approximation with applications to quantum computationPreprint

Jansen, S., Ruskai, M. B., & Seiler, R. (2006) · Cited by 217 · see citing works

The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant

Micciancio, D. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539700373039 · Cited by 213 · see citing works

Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity

Watrous, J. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1732 · Cited by 212 · see citing works

A Computational Introduction to Number Theory and Algebra

Shoup, V. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9781139165464 · Cited by 207 · see citing works

How Powerful is Adiabatic Quantum ComputationPreprint

van Dam, W., Mosca, M., & Vazirani, U. V. (2001) · Cited by 203 · see citing works

Group-Theoretic Algorithms and Graph Isomorphism

(1982) · Lecture notes in computer science · doi:10.1007/3-540-11493-9 · Cited by 196 · see citing works

A new universal and fault-tolerant quantum basis

Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00084-3 · Cited by 194 · see citing works

Both Toffoli and Controlled-NOT need little help to universal quantum computing

Shi, Y.-Y. (2003) · Quantum Information and Computation · doi:10.26421/qic3.1-7 · Cited by 193 · see citing works

Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p

Schoof, R. (1985) · Mathematics of Computation · doi:10.2307/2007968 · Cited by 191 · see citing works

Factoring integers with the number field sieve

Buhler, J. P., Lenstra, H. W., & Pomerance, C. (1993) · Lecture Notes in Mathematics · doi:10.1007/bfb0091539 · Cited by 188 · see citing works

Quantum Computation and Lattice Problems

Regev, O. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703440678 · Cited by 188 · see citing works

Approximate quantum Fourier transform and decoherence

Barenco, A., EKERT, A. K., Suominen, K., & Törmä, P. (1996) · Physical Review A · doi:10.1103/physreva.54.139 · Cited by 175 · see citing works

Quantum Algorithms for Some Hidden Shift Problems

van Dam, W., Hallgren, S., & Ip, L. (2006) · SIAM Journal on Computing · doi:10.1137/s009753970343141x · Cited by 175 · see citing works

Complexity Limitations on Quantum Computation

Fortnow, L., & Rogers, J. D. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1651 · Cited by 169 · see citing works

An improved quantum Fourier transform algorithm and applications

Hales, L., & Hallgren, S. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892139 · Cited by 165 · see citing works

A Simple Proof that Toffoli and Hadamard are Quantum UniversalPreprint

Aharonov, D. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0301040 · Cited by 162 · see citing works

Isomorphism of graphs with bounded eigenvalue multiplicity

Babai, L., Grigoryev, D. Y., & Mount, D. M. (1982) · doi:10.1145/800070.802206 · Cited by 162 · see citing works

Quantum Cryptanalysis of Hidden Linear Functions

Boneh, D., & Lipton, R. J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_34 · Cited by 161 · see citing works

Another NP-complete problem and the complexity of computing short vectors in a lattice

Boas, P. V. E. (1981) · Medical Entomology and Zoology · Cited by 161 · see citing works

Quantum Query Complexity of Some Graph Problems

Dürr, C., Heiligman, M., Høyer, P., & Mhalla, M. (2006) · SIAM Journal on Computing · doi:10.1137/050644719 · Cited by 151 · see citing works

Isomorphism testing for graphs of bounded genus

Miller, G. L. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804670 · Cited by 148 · see citing works

Spatial search and the Dirac equation

Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.042312 · Cited by 146 · see citing works

Efficient discrete approximations of quantum gates

Harrow, A. W., Recht, B., & Chuang, I. L. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1495899 · Cited by 146 · see citing works

Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

Hallgren, S. (2007) · Journal of the ACM · doi:10.1145/1206035.1206039 · Cited by 143 · see citing works

The quantum query complexity of the hidden subgroup problem is polynomial

Ettinger, M., Høyer, P., & Knill, E. H. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.01.024 · Cited by 142 · see citing works

Quantum Computational Complexity

Watrous, J. (2013) · Springer eBooks · doi:10.1007/978-3-642-27737-5_428-3 · Cited by 141 · see citing works

Frobenius maps of abelian varieties and finding roots of unity in finite fields

Pila, J. (1990) · Mathematics of Computation · doi:10.1090/s0025-5718-1990-1035941-x · Cited by 140 · see citing works

Quantum computation of Fourier transforms over symmetric groups

Beals, R. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258548 · Cited by 138 · see citing works

The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

Maurer, U. M., & Wolf, S. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539796302749 · Cited by 137 · see citing works

Approximation by Quantum Circuits

Knill, E. (1995) · arXiv · doi:10.48550/arxiv.quant-ph/9508006 · Cited by 136 · see citing works

Quantum cryptanalysis of hash and claw-free functions

Gilles Brassard, A., Høyer, P., & Tapp, A. (1997) · ACM SIGACT News · doi:10.1145/261342.261346 · Cited by 132 · see citing works

Hidden translation and orbit coset in quantum computing

Friedl, K., Ivanyos, G., Magniez, F., Sántha, M., & Sen, P. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780544 · Cited by 130 · see citing works

Is code equivalence easy to decide?

Petrank, E., & Roth, R. M. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.623157 · Cited by 130 · see citing works

Simulations of Many-Body Quantum Systems by a Quantum ComputerPreprint

Wiesner, S. J. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9603028 · Cited by 129 · see citing works

Bounds for small-error and zero-error quantum algorithms

Buhrman, H., Cleve, R., de Wolf, R., & Zalka, C. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814607 · Cited by 124 · see citing works

Computational complexity and the classification of finite simple groups

Babai, L., Kantor, W. M., & Luks, E. M. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.10 · Cited by 123 · see citing works

Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer

Ambainis, A., Childs, A. M., Reichardt, B. W., Špalek, R., & Zhang, S. (2010) · SIAM Journal on Computing · doi:10.1137/080712167 · Cited by 122 · see citing works

Search via quantum walk

Magniez, F., Nayak, A., Roland, J., & Sántha, M. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250874 · Cited by 122 · see citing works

Quantum mechanical algorithms for the nonabelian hidden subgroup problem

Grigni, M., Schulman, L. J., Vazirani, M., & Vazirani, U. V. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380769 · Cited by 120 · see citing works

An Invitation to Arithmetic Geometry

Lorenzini, D. (1996) · Graduate studies in mathematics · doi:10.1090/gsm/009 · Cited by 117 · see citing works

A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus

Filotti, I. S., & Mayer, J. N. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804671 · Cited by 110 · see citing works

The quantum adiabatic optimization algorithm and local minima

Reichardt, B. W. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007428 · Cited by 110 · see citing works

On Quantum Algorithms for Noncommutative Hidden Subgroups

Ettinger, M., & Høyer, P. (2000) · Advances in Applied Mathematics · doi:10.1006/aama.2000.0699 · Cited by 109 · see citing works

The BQP-hardness of approximating the Jones polynomial

Aharonov, D., & Arad, I. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/3/035019 · Cited by 108 · see citing works

2006, Quantum verification of matrix products

Buhrman, H., & Špalek, R. (2004) · UvA-DARE (University of Amsterdam) · Cited by 105 · see citing works

Efficient Quantum TransformsPreprint

Høyer, P. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9702028 · Cited by 104 · see citing works

The Hidden Subgroup Problem and Quantum Computation Using Group Representations

Hallgren, S., Russell, A. C., & Ta‐Shma, A. (2003) · SIAM Journal on Computing · doi:10.1137/s009753970139450x · Cited by 103 · see citing works

On The Randomness of Legendre and Jacobi Sequences

Damgård, I. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_13 · Cited by 98 · see citing works

Fast, Rigorous Factorization and Discrete Logarithm Algorithms

Pomerance, C. B. (1987) · Elsevier eBooks · doi:10.1016/b978-0-12-386870-1.50014-9 · Cited by 96 · see citing works

Span-program-based quantum algorithm for evaluating formulas

Reichardt, B. W., & Špalek, R. (2008) · doi:10.1145/1374376.1374394 · Cited by 96 · see citing works

Estimating Jones polynomials is a complete problem for one clean qubitPreprint

Shor, P. W., & Jordan, S. P. (2008) · doi:10.5555/2017011.2017012 · Cited by 95 · see citing works

Quantum algorithms for element distinctness

Buhrman, H., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Sántha, M., & de Wolf, R. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2001.933880 · Cited by 94 · see citing works

2013 IEEE Conference on Computational Complexity

(2013) · doi:10.1109/ccc30504.2013 · Cited by 94 · see citing works

QUANTUM COMPUTATION AND INFORMATION

Carlini, A. (2002) · The Ninth Marcel Grossmann Meeting · doi:10.1142/9789812777386_0042 · Cited by 93 · see citing works

Faster isomorphism testing of strongly regular graphs

Spielman, D. A. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.238006 · Cited by 90 · see citing works

Quantum algorithms for solvable groups

Watrous, J. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380759 · Cited by 88 · see citing works

Diffie-Hellman is as Strong as Discrete Log for Certain Primes

den Boer, B. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_38 · Cited by 88 · see citing works

Solving the Pell equation

Lenstra, H. W., & Jr. (2008) · doi:10.1017/9781139049801.002 · Cited by 85 · see citing works

Limitations of quantum coset states for graph isomorphism

Hallgren, S., Moore, C., Rötteler, M., Russell, A. C., & Sen, P. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132603 · Cited by 83 · see citing works

On Universal and Fault-Tolerant Quantum ComputingPreprint

Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9906054 · Cited by 81 · see citing works

Fast generalized Fourier transforms

Clausen, M. V. (1989) · Theoretical Computer Science · doi:10.1016/0304-3975(89)90021-2 · Cited by 81 · see citing works

Fast quantum algorithms for computing the unit group and class group of a number field

Hallgren, S. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060660 · Cited by 80 · see citing works

Fast parallel circuits for the quantum Fourier transformPreprint

Cleve, R., & Watrous, J. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0006004 · Cited by 79 · see citing works

EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM

Ivanyos, G., Magniez, F., & Sántha, M. (2003) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054103001996 · Cited by 76 · see citing works

Efficient Computation of the Fourier Transform on Finite Groups

Diaconis, P. W., & Rockmore, D. N. (1990) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1990-1030655-4 · Cited by 76 · see citing works

Accuracy threshold for quantum computation

Knill, E. H., Zurek, W. H., & Laflamme, R. (1996) · Cited by 75 · see citing works

Quantum Computer Algorithms

Mosca, M. (2003) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 73 · see citing works

Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem

Grigni, M., Schulman, L. J., Vazirani, M., & Vazirani, U. V. (2004) · COMBINATORICA · doi:10.1007/s00493-004-0009-8 · Cited by 72 · see citing works

Quantum Computation and the Evaluation of Tensor Networks

Arad, I., & Landau, Z. A. (2010) · SIAM Journal on Computing · doi:10.1137/080739379 · Cited by 72 · see citing works

The Jones polynomial: quantum algorithms and applications in quantum complexity theory

Wocjan, P., & Yard, J. (2008) · Quantum Information and Computation · doi:10.26421/qic8.1-2-10 · Cited by 71 · see citing works

Fast Monte Carlo algorithms for permutation groups

Babai, L., Cooperman, G. D., Finkelstein, L., Luks, E. M., & Seress, Á. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103435 · Cited by 71 · see citing works

On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography

Cheung, D., Maslov, D., Mathew, J., & Pradhan, D. K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89304-2_9 · Cited by 68 · see citing works

Quantum Complexity of Testing Group Commutativity

Magniez, F., & Nayak, A. (2007) · Algorithmica · doi:10.1007/s00453-007-0057-8 · Cited by 67 · see citing works

Quantum Algorithms for Hidden Nonlinear Structures

Childs, A. M., Schulman, L. J., & Vazirani, U. V. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.18 · Cited by 67 · see citing works

EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS

Mosca, M., & Zalka, C. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749904000109 · Cited by 65 · see citing works

Generic quantum Fourier transforms

Moore, C., Rockmore, D. N., & Russell, A. C. (2006) · ACM Transactions on Algorithms · doi:10.1145/1198513.1198525 · Cited by 64 · see citing works

FOURIER ANALYSIS ON FINITE GROUPS AND APPLICATIONS (London Mathematical Society Student Texts 43)

Rowlinson, P. (2000) · Bulletin of the London Mathematical Society · doi:10.1112/s0024609300227355 · Cited by 64 · see citing works

Optimal measurements for the dihedral hidden subgroup problem

Bacon, D., Childs, A. M., & van Dam, W. (2006) · Chicago Journal of Theoretical Computer Science · doi:10.48550/arxiv.quant-ph/0501044 · Cited by 63 · see citing works

Quantum Chemistry in the Age of Quantum Computing

Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560 · see citing works

Quantum Chemistry in the Age of Quantum Computing

Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265 · see citing works

Quantum algorithms: an overview

Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071 · see citing works

Machine learning & artificial intelligence in the quantum domain: a review of recent progress

Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,132 · see citing works

Quantum walks: a comprehensive review

Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 925 · see citing works

Quantum computing with defects

Weber, J. R., Koehl, W. F., Varley, J. B., Janotti, A., Buckley, B. B., de Walle, C. G. V., & Awschalom, D. D. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1003052107 · Cited by 816 · see citing works

Quantum random number generators

Herrero-Collantes, M., & García-Escartín, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 802 · see citing works

Semiconductor spin qubits

Burkard, G., Ladd, T. D., Pan, A., Nichol, J. M., & Petta, J. R. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.025003 · Cited by 772 · see citing works

A Survey on quantum computing technology

Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646 · see citing works

Quantum walks: a comprehensive reviewPreprint

Venegas-Andraca, S. E. (2012) · Cited by 533 · see citing works

Expressive power of parametrized quantum circuits

Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033125 · Cited by 318 · see citing works

Synthesis and optimization of reversible circuits—a survey

Saeedi, M., & Markov, I. L. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431220 · Cited by 294 · see citing works

Stabilizer Rényi Entropy

Leone, L., Oliviero, S. F. E., & Hamma, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.050402 · Cited by 297 · see citing works

Hybrid Quantum-Classical Approach to Quantum Optimal Control

Li, J., Yang, X., Peng, X., & Sun, C.-P. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.150503 · Cited by 278 · see citing works

Quantum Algorithm Implementations for Beginners

Jayakumar, A., Adedoyin, A. A., Ambrosiano, J. J., Anisimov, P. M., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H. N., Gunter, D., Karra, S., et al. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3517340 · Cited by 299 · see citing works

Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography

Maciejewski, F. B., Zimborás, Z., & Oszmaniec, M. (2020) · Quantum · doi:10.22331/q-2020-04-24-257 · Cited by 244 · see citing works

A novel quantum representation for log-polar images

Zhang, Y., Lü, K., Gao, Y., & Xu, K. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0587-8 · Cited by 204 · see citing works

Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography

Maciejewski, F., Zimborás, Z., & Oszmaniec, M. (2020) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · Cited by 184 · see citing works

Coherence depletion in the Grover quantum search algorithm

Shi, H., Liu, S., Wang, X.-H., Yang, W., Yang, Z.-Y., & Fan, H. (2017) · Physical Review A · doi:10.1103/physreva.95.032307 · Cited by 180 · see citing works

A novel image steganography technique based on quantum substitution boxes

El‐Latif, A. A. A., Abd-El-Atty, B., & Venegas-Andraca, S. E. (2019) · Optics & Laser Technology · doi:10.1016/j.optlastec.2019.03.005 · Cited by 179 · see citing works

Robust Encoding of a Qubit in a Molecule

Albert, V. V., Covey, J. P., & Preskill, J. P. (2020) · Physical Review X · doi:10.1103/physrevx.10.031050 · Cited by 154 · see citing works

Machine learning method for state preparation and gate synthesis on photonic quantum computers

Arrazola, J. M., Bromley, T. R., Izaac, J., Myers, C. R., Brádler, K., & Killoran, N. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aaf59e · Cited by 144 · see citing works

Quantum Search Algorithms for Wireless Communications

Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys &amp; Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149 · see citing works

Experimental quantum fast hitting on hexagonal graphs

Tang, H. L., Franco, C. D., Shi, Z.-Y., He, T.-S., Feng, Z., Gao, J., Sun, K., Li, Z.-M., Jiao, Z.-Q., Wang, T.-Y., et al. (2018) · Nature Photonics · doi:10.1038/s41566-018-0282-5 · Cited by 118 · see citing works

Theory for Equivariant Quantum Neural Networks

Nguyen, Q. T., Schatzki, L., Braccia, P., Ragone, M., Coles, P. J., Sauvage, F., Larocca, M., & Cerezo, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020328 · Cited by 125 · see citing works

An Efficient Quantum Computing technique for cracking RSA using Shor’s Algorithm

Bhatia, V., & Ramkumar, K. R. (2020) · International Conference on Computing, Communication and Automation · doi:10.1109/iccca49541.2020.9250806 · Cited by 111 · see citing works

Giant anomalous Hall and Nernst effect in magnetic cubic Heusler compounds

Noky, J., Zhang, Y., Gooth, J., Felser, C., & Sun, Y. (2020) · npj Computational Materials · doi:10.1038/s41524-020-0342-5 · Cited by 102 · see citing works

Quantum-Inspired Real-Time Optimization for 6G Networks: Opportunities, Challenges, and the Road Ahead

Duong, T. Q., Nguyen, L. D., Narottama, B., Ansere, J. A., Huynh, D. V., & Shin, H. (2022) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2022.3195219 · Cited by 105 · see citing works

Recent advances for quantum classifiers

Li, W., & Deng, D.-L. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1793-6 · Cited by 106 · see citing works

An encryption protocol for NEQR images based on one-particle quantum walks on a circle

Abd-El-Atty, B., El‐Latif, A. A. A., & Venegas-Andraca, S. E. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2386-3 · Cited by 101 · see citing works

High-Performance Computing with Quantum Processing Units

Britt, K. A., & Humble, T. S. (2017) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3007651 · Cited by 102 · see citing works

Efficiently Computable Bounds for Magic State Distillation

Wang, X., Wilde, M. M., & Su, Y. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090505 · Cited by 100 · see citing works

Quantum self-attention neural networks for text classification

Li, G., Zhao, X., & Wang, X. (2024) · Science China Information Sciences · doi:10.1007/s11432-023-3879-7 · Cited by 112 · see citing works

Quantum algorithm for nonhomogeneous linear partial differential equations

Arrazola, J. M., Kalajdzievski, T. Z., Weedbrook, C., & Lloyd, S. (2019) · Physical Review A · doi:10.1103/physreva.100.032306 · Cited by 91 · see citing works

Finding shortest lattice vectors faster using quantum search

Laarhoven, T., Mosca, M., & van de Pol, J. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0067-5 · Cited by 90 · see citing works

Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics

Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024) · Molecular Biotechnology · doi:10.1007/s12033-023-00765-4 · Cited by 84 · see citing works

Expressive power of parametrized quantum circuits

Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2018) · UTS ePRESS (University of Technology Sydney) · Cited by 99 · see citing works

Open quantum walks on graphs

Attal, S., Petruccione, F., & Sinayskiy, I. (2012) · Physics Letters A · doi:10.1016/j.physleta.2012.03.040 · Cited by 71 · see citing works

SCALLOP: Scaling the CSI-FiSh

Feo, L. D., Fouotsa, T. B., Kutas, P., Leroux, A., Merz, S.-P., Panny, L., & Wesolowski, B. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-31368-4_13 · Cited by 70 · see citing works

A quantum algorithm to solve nonlinear differential equations

Leyton, S. K., & Osborne, T. J. (2008) · arXiv · doi:10.48550/arxiv.0812.4423 · Cited by 65 · see citing works

Quantum computing with defects

Gordon, L., Weber, J. R., Varley, J. B., Janotti, A., Awschalom, D. D., & de Walle, C. G. V. (2013) · MRS Bulletin · doi:10.1557/mrs.2013.206 · Cited by 64 · see citing works

Generation of stable entanglement between two cavity mirrors by squeezed-reservoir engineering

Yang, C.-J., An, J., Yang, W., & Li, Y. (2015) · Physical Review A · doi:10.1103/physreva.92.062311 · Cited by 58 · see citing works

Search for supersymmetry in pp collisions at $\sqrt{s} =7$ TeV in events with a single lepton, jets, and missing transverse momentum

Chatrchyan, S., Khachatryan, V., Sirunyan, A. M., Tumasyan, A., Adam, W., Aguiló, E., Bergauer, T., Dragicevic, M., Erö, J., Fabjan, C. W., et al. (2013) · The European Physical Journal C · doi:10.1140/epjc/s10052-013-2404-z · Cited by 54 · see citing works

Primitive quantum gates for an SU(2) discrete subgroup: Binary tetrahedral

Gustafson, E., Lamm, H., Lovelace, F., & Musk, D. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.114501 · Cited by 54 · see citing works

Machine learning \& artificial intelligence in the quantum domainPreprint

Dunjko, V., & Briegel, H. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.02779 · Cited by 54 · see citing works

General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory

Davoudi, Z., Shaw, A. F., & Stryker, J. R. (2023) · Quantum · doi:10.22331/q-2023-12-20-1213 · Cited by 56 · see citing works

Primitive quantum gates for dihedral gauge theories

Alam, M. S., Hadfield, S., Lamm, H., & Li, A. C. Y. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.114501 · Cited by 49 · see citing works

Control by quantum dynamics on graphs

Godsil, C. D., & Simone Severini, B. (2010) · Physical Review A · doi:10.1103/physreva.81.052316 · Cited by 45 · see citing works

High‐Z Nanostructured Ceramics in Radiotherapy: First Evidence of Ta2O5‐Induced Dose Enhancement on Radioresistant Cancer Cells in an MV Photon Field

Brown, R., Tehei, M., Oktaria, S., Briggs, A., Stewart, C., Konstantinov, K., Rosenfeld, A. B., Corde, S., & Lerch, M. (2013) · Particle & Particle Systems Characterization · doi:10.1002/ppsc.201300276 · Cited by 45 · see citing works

Dissipative preparation of large W states in optical cavities

Sweke, R., Sinayskiy, I., & Petruccione, F. (2013) · Physical Review A · doi:10.1103/physreva.87.042323 · Cited by 43 · see citing works

Self-calibrating quantum state tomography

Brańczyk, A. M., Mahler, D. H., Rozema, L. A., Darabi, A., Steinberg, A. M., & James, D. F. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/8/085003 · Cited by 44 · see citing works

Programming quantum computers using design automation

Soeken, M., Häner, T., & Roetteler, M. (2018) · Design, Automation, and Test in Europe · doi:10.23919/date.2018.8341993 · Cited by 44 · see citing works

Validating quantum-classical programming models with tensor network simulations

McCaskey, A., Dumitrescu, E., Chen, M., Lyakh, D. I., & Humble, T. S. (2018) · PLoS ONE · doi:10.1371/journal.pone.0206704 · Cited by 45 · see citing works

Neural-network states for the classical simulation of quantum computingPreprint

Jónsson, B., Bauer, B., & Carleo, G. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.05232 · Cited by 60 · see citing works

A quantum annealing approach for boolean satisfiability problem

Su, J., Tu, T., & He, L. (2016) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2897937.2897973 · Cited by 39 · see citing works

Qunity: A Unified Language for Quantum and Classical Computing

Voichick, F., Li, L., Rand, R., & Hicks, M. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3571225 · Cited by 37 · see citing works

Provably Trainable Rotationally Equivariant Quantum Machine Learning

West, M. T., Heredge, J., Sevior, M. E., & Usman, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030320 · Cited by 41 · see citing works

Limitations of passive protection of quantum information

Pastawski, F., Kay, A., Schuch, N., & Cirac, J. I. (2010) · Quantum Information and Computation · doi:10.26421/qic10.7-8-3 · Cited by 41 · see citing works

Quantum algorithms for typical hard problems: a perspective of cryptanalysis

Suo, J., Wang, L., Yang, S., Zheng, W., & Zhang, J. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02673-x · Cited by 40 · see citing works

Mean Field Analysis of Quantum Annealing Correction

Matsuura, S., Nishimori, H., Albash, T., & Lidar, D. A. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.220501 · Cited by 38 · see citing works

Quantum computing for fusion energy science applications

Joseph, I., Shi, Y. C., Porter, M. D., Castelli, A. R., Geyko, V., Graziani, F. R., Libby, S. B., & DuBois, J. L. (2023) · Physics of Plasmas · doi:10.1063/5.0123765 · Cited by 34 · see citing works

Quantum Algorithms for Scientific Computing and Approximate OptimizationPreprint

Hadfield, S. (2018) · arXiv (Cornell University) · doi:10.7916/d8x650c9 · Cited by 63 · see citing works

A Comprehensive Survey on Quantum Machine Learning and Possible Applications

Umer, M. J., & Sharif, M. I. (2022) · International Journal of E-Health and Medical Communications · doi:10.4018/ijehmc.315730 · Cited by 35 · see citing works

General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography

Ji, Z., Qiao, Y., Song, F., & Yun, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36030-6_11 · Cited by 34 · see citing works

Models of quantum computation and quantum programming languages

Miszczak, J. A. (2011) · Bulletin of the Polish Academy of Sciences Technical Sciences · doi:10.2478/v10175-011-0039-5 · Cited by 38 · see citing works

Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model

Dallaire-Demers, P.-L., & Wilhelm, F. K. (2016) · Physical Review A · doi:10.1103/physreva.94.062304 · Cited by 33 · see citing works

Mitigating Barren Plateaus of Variational Quantum Eigensolvers

Liu, X., Liu, G., Zhang, H.-K., Huang, J., & Wang, X. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3383050 · Cited by 44 · see citing works

Experimental Realization of a One-Way Quantum Computer Algorithm Solving Simon’s Problem

Tame, M., Bell, B. A., Franco, C. D., Wadsworth, W. J., & Rarity, J. G. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.200501 · Cited by 33 · see citing works

A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems

Tamascelli, D., & Zanetti, L. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/32/325302 · Cited by 34 · see citing works

Pretty good state transfer of entangled states through quantum spin chains

Sousa, R., & Omar, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/12/123003 · Cited by 32 · see citing works

Quantum computation of discrete logarithms in semigroups

Childs, A. M., & Ivanyos, G. (2014) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2013-0038 · Cited by 32 · see citing works

Generalized Deutsch-Jozsa problem and the optimal quantum algorithm

Qiu, D., & Zheng, S. (2018) · Physical Review A · doi:10.1103/physreva.97.062331 · Cited by 31 · see citing works

Entanglement of two rotating mirrors coupled to a single Laguerre-Gaussian cavity mode

Chen, Z., Peng, J., Fu, J., & Feng, X. (2019) · Optics Express · doi:10.1364/oe.27.029479 · Cited by 31 · see citing works

Quantum algorithm for solving hyperelliptic curve discrete logarithm problem

Huang, Y. T., Su, Z., Zhang, F., Ding, Y., & Cheng, R. (2020) · Quantum Information Processing · doi:10.1007/s11128-019-2562-5 · Cited by 31 · see citing works

Tripartite entanglement in a Laguerre–Gaussian rotational-cavity system with an yttrium iron garnet sphere

Cheng, H.-J., Zhou, S.-J., Peng, J., Kundu, A., Li, H.-X., Jin, L., & Feng, X. (2020) · Journal of the Optical Society of America B · doi:10.1364/josab.405097 · Cited by 31 · see citing works

Quantum circuits for F2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {F}}_{2^{n}}$$\end{document}-multipli

Kepley, S., & Steinwandt, R. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0993-1 · Cited by 21 · see citing works

Six-electron semiconductor double quantum dot qubits

Nielsen, E., Barnes, E., Kestner, J. P., & Sarma, S. D. (2013) · Physical Review B · doi:10.1103/physrevb.88.195131 · Cited by 29 · see citing works

Classical simulations of Abelian-group normalizer circuits with intermediate measurements

Bermejo-Vega, J., & den Nest, M. V. (2014) · Quantum Information and Computation · doi:10.26421/qic14.3-4-1 · Cited by 30 · see citing works

An Efficient Exact Quantum Algorithm for the Integer Square-free Decomposition Problem

Li, J., Peng, X., Du, J., & Suter, D. (2012) · Scientific Reports · doi:10.1038/srep00260 · Cited by 28 · see citing works

Quantum Computing for Cybersecurity

Alauthman, M., Almomani, A., Al–Qerem, A., Khaldy, M. A. A., Aldweesh, A. Y., Maqousi, A. Y. A., & Alkasassbeh, M. S. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-5330-1.ch004 · Cited by 28 · see citing works

A brief introduction to quantum algorithms

Zhang, S., & Li, L. (2022) · CCF Transactions on High Performance Computing · doi:10.1007/s42514-022-00090-3 · Cited by 28 · see citing works

Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search

Laarhoven, T., Mosca, M., & van de Pol, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_6 · Cited by 26 · see citing works

Efficient quantum algorithms for analyzing large sparse electrical networks

Wang, G. (2017) · Quantum Information and Computation · doi:10.26421/qic17.11-12-5 · Cited by 29 · see citing works

Quantum algorithm for obtaining the energy spectrum of a physical system

Wang, H., Ashhab, S., & Nori, F. (2012) · Physical Review A · doi:10.1103/physreva.85.062304 · Cited by 26 · see citing works

Primitive quantum gates for an S U ( 3 ) discrete subgroup: Σ ( 36 × 3 )

Gustafson, E., Ji, Y., Lamm, H., Murairi, E. M., Perez, S. O., & Zhu, S. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.110.034515 · Cited by 25 · see citing works

On the role of dealing with quantum coherence in amplitude amplification

Rastegin, A. E. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1946-2 · Cited by 25 · see citing works

Analysis of electromagnetic forces and causality in electron microscopy

Reyes–Coronado, A., Ortíz-Solano, C. G., Zabala, N., Rivacoba, A., & Esquivel-Sirvent, R. (2018) · Ultramicroscopy · doi:10.1016/j.ultramic.2018.06.006 · Cited by 25 · see citing works

Impact of time-correlated noise on zero-noise extrapolation

Schultz, K., LaRose, R., Mari, A., Quiroz, G., Shammah, N., Clader, B. D., & Zeng, W. J. (2022) · Physical Review A · doi:10.1103/physreva.106.052406 · Cited by 25 · see citing works

Primitive quantum gates for an S U ( 2 ) discrete subgroup: Binary octahedral

Gustafson, E., Lamm, H., & Lovelace, F. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.109.054503 · Cited by 28 · see citing works

A quantum model for autonomous learning automata

Siomau, M. (2014) · Quantum Information Processing · doi:10.1007/s11128-013-0723-5 · Cited by 25 · see citing works

Quantum state transfer via Bloch oscillations

Tamascelli, D., Olivares, S., Rossotti, S., Osellame, R., & Paris, M. G. A. (2016) · Scientific Reports · doi:10.1038/srep26054 · Cited by 24 · see citing works

Quantum algorithms for highly non-linear Boolean functions

Rötteler, M. (2008) · Cited by 29 · see citing works

Single Channel Quantum Color Image Encryption Algorithm Based on HSI Model and Quantum Fourier Transform

Gong, L.-H., He, X.-T., Tan, R.-C., & Zhou, Z. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3541-1 · Cited by 23 · see citing works

Algorithms for Quantum Computers

Smith, J., & Mosca, M. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_43 · Cited by 23 · see citing works

Factorization of numbers with Gauss sums: I. Mathematical background

Wölk, S., Merkel, W., Schleich, W. P., Averbukh, I. S., & Girard, B. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/10/103007 · Cited by 23 · see citing works

Cloud Computing: Security and Reliability Issues

Ahamed, F., Shahrestani, S. A., & Ginige, A. (2013) · Communications of the IBIMA · doi:10.5171/2013.655710 · Cited by 22 · see citing works

Effective implementation of nonadiabatic geometric quantum gates of cat-state qubits using an auxiliary qutrit

Kang, Y., Xiao, Y., Shi, Z., Wang, Y., Yang, J., Song, J., & Xia, Y. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acc2de · Cited by 22 · see citing works

Can a quantum computer be applied for numerical weather prediction?

Фролов, А. В. (2017) · Russian Meteorology and Hydrology · doi:10.3103/s1068373917090011 · Cited by 21 · see citing works

Bloch–Landau–Zener dynamics induced by a synthetic field in a photonic quantum walk

D’Errico, A., Barboza, R., Tudor, R., Dauphin, A., Massignan, P., Marrucci, L., & Cardano, F. (2021) · APL Photonics · doi:10.1063/5.0037327 · Cited by 21 · see citing works

Laser-Controlled Implementation of Controlled-NOT, Hadamard, SWAP, and Pauli Gates as Well as Generation of Bell States in a 3d–4f Molecular Magnet

Mummaneni, B. C., Liu, J., Lefkidis, G., & Hübner, W. (2022) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.2c00172 · Cited by 21 · see citing works

QUANTUM ALGORITHMS FOR PROBLEMS IN NUMBER THEORY, ALGEBRAIC GEOMETRY, AND GROUP THEORY

van Dam, W., & Sasaki, Y. (2012) · doi:10.1142/9789814425988_0003 · Cited by 5 · see citing works

Quantum Computing Algorithms for Solving Complex Mathematical Problems

Trivedi, E. A. L. M. (2023) · International Journal on Recent and Innovation Trends in Computing and Communication · doi:10.17762/ijritcc.v11i10.8913 · Cited by 1 · see citing works

Quantum Algorithms Factoring Integers

Log, D. (2016)

Quantum computation and Shor's factoring algorithm

Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354 · see citing works

Quantum Algorithms and Hard Problems

Raj, C. V., Phaneendra, H. D., & Shivakumar, M. S. (2006) · IEEE International Conference on Cognitive Informatics · doi:10.1109/coginf.2006.365589 · Cited by 5 · see citing works