Fetching the paper…
Reading the bibliography…
We investigate the use of amplitude amplification on the gate-based model of quantum computing as a means for solving combinatorial optimization problems.
R. Karp, Reducibility among combinatorial problems. Proceedings of a symposium on the complexity of computer computations
1972
Earlier work this paper cites.
M. R. Garey, D. S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems. Theoretical Computer Science 1, 3 p.237-267 (1976)
1976
Earlier work this paper cites.
B. Korte, L. Lovasz, Mathematical structures underlying greedy algorithms. Fundamentals of Comp. Theory (1981)
1981
Earlier work this paper cites.
K. D. Jong, Learning with genetic algorithms: an overview. Machine Language 3
1988
Earlier work this paper cites.
S. Forrest, Genetic algorithms: principles of natural selection applied to computation. Science 261
1993
Earlier work this paper cites.
M. Srinivas, L. M. Patnaik, Genetic algorithms: a survey. IEEE Computer 27
1994
Earlier work this paper cites.
A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, J. D. Doll, Quantum annealing: a new method for minimizing multidimensional functions. Chemical Physics Letters 219
1994
Earlier work this paper cites.
R. J. Parsons, S. Forrest, C. Burks, Genetic algorithms, operators, and DNA fragment assembly. Machine Learning 21
1995
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search. arXiv: 9605043 (1996)
1996
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, Strengths and weaknesses of quantum computing. SIAM Journal on Computing 26
1997
Earlier work this paper cites.
M. Boyer, G. Brassard, P. Hoyer, A. Tapp, Tight bounds on quantum searching. Fortschritte der Physik 46
1998
Earlier work this paper cites.
E. Farhi and S. Gutmann, Analog analogue of a digital quantum computation. Phys. Rev. A 57, 2403 (1998)
1998
Earlier work this paper cites.
G. Brassard, P. Hoyer, A. Tapp, Quantum counting. 25th Intl. Colloquium on Automata, Languages, and Programming (ICALP), LNCS 1443, p. 820-831, (1998)
1998
Earlier work this paper cites.
S. Lloyd, Quantum search without entanglement. Phys. Rev. A 61
1999
Earlier work this paper cites.
G. L. Long, W. L. Zhang, Y. S. Li, L. Niu, Arbitrary phase rotation of the marked state cannot be used for Grover’s quantum search algorithm. Commun. Theor. Phys. 32
1999
Earlier work this paper cites.
G. L. Long, Y. S. Li, W. L. Zhang, L. Niu, Phase matching in quantum searching. Phys. Lett. A 262
1999
Earlier work this paper cites.
M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information
2000
Earlier work this paper cites.
P. Hoyer, Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62
2000
Earlier work this paper cites.
P. H. Song and I. Kim, Computational leakage: Grover’s algorithm with imperfections. European Phys. Jour. D 23
2000
Earlier work this paper cites.
F. Glover, G. Gutin, A. Yeo, A. Zverovich, Construction heuristics for the asymmetric TSP. European Journ. of Operational Research 129
2001
Earlier work this paper cites.
G. Brassard, P. Hoyer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation. Quantum Computation and Quantum Information: AMS Contemporary Mathematics 305
2002
Earlier work this paper cites.
P. Festa, P. M. Pardalos, M. G. C. Resende, C. C. Ribeiro, Randomized heuristics for the Max-Cut problem. Optimization Methods and Software 17
2002
Earlier work this paper cites.
A. M. Childs, J. Goldstone, Spatial search by quantum walk. Phys. Rev. A 70
2004
Earlier work this paper cites.
G. F. Viamontes, I. L. Markov, J. P. Hayes, Is quantum search practical? arXiv: 0405001 (2004)
2004
Earlier work this paper cites.
A. A. Pomeransky, O. V. Zhirov, D. L. Shepelyansky, Phase diagram for the Grover algorithm with static imperfections. European Phys. Jour. D 31
2004
Cited alongside, same era.
Z. Zhang, S. Schwartz, L. Wagner, W. Miller, A greedy algorithm for aligning DNA sequences. Journal of Comp. Biology 7
2004
Cited alongside, same era.
L. Lin, L. Cao, J. Wang, C. Zhang, The applications of genetic algorithms in stock market data mining optimisation. WIT Trans. on Info. and Comm. Tech. 33
2004
Cited alongside, same era.
J. Bang-Jensen, G. Gutin, A. Yeo, When the greedy algorithm fails. Discrete Optimization 1
2004
Cited alongside, same era.
B. P. Lanyon, M. Barbieri, M. P. Almeida, T. Jennewein, T. C. Ralph, K. J. Resch, G. J. Pryde, J. L. O’Brien, A. Gilchrist, A. G. White, Quantum computing using shortcuts through higher dimensions. Nature Physics 5
2009
M. Streif, M. Leib, Comparison of QAOA with quantum and simulated annealing. arXiv: 1901.01903 (2019)
2019
Later among the works it cites.
T. Satoh, Y. Ohkura, R. V. Meter, Subdivided phase oracle for NISQ search algorithms. IEEE Transactions on Quantum Engineering (2020)
2020
Later among the works it cites.
Y. Koshka, M. A. Novotny, Comparison of D-Wave quantum annealing and classical simulated annealing for local minima determination. IEEE Journal on Selected Areas in Information Theory 1
2020
Later among the works it cites.
D. Wierichs, C. Gogolin, M. Kastoryano, Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer. Phys. Rev. Research 2
2020
Later among the works it cites.
J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, E. Kashefi, Quantum certification and benchmarking. Nature Reviews Physics 2
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A. Ambainis, Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations. arXiv: 1010.4458 (2010)
2010
Cited alongside, same era.
J. Bang, S. Yoo, J. Lim, J. Ryu, C. Lee, J. Lee, Quantum heuristic algorithm for traveling salesman problem. J. Korean Phys. Soc. 61
2012
Cited alongside, same era.
A. Younes, Towards more reliable fixed phase quantum search algorithm. Applied Math. & Info. Sciences 1
2013
Cited alongside, same era.
T. Li, W-S. Bao, W-Q. Lin, H. Zhang, X-Q. Fu, Quantum search algorithm based on multi-phase. Chinese Phys. Lett. 31
2014
Cited alongside, same era.
J. Janmark, D. A. Meyer, T. G. Wong, Global symmetry is unnecessary for fast quantum search. Phys. Rev. Lett. 112
2014
Cited alongside, same era.
G. Kochenberger, J-K. Hao, F. Glover, M. Lewis, Z. Lu, H. Wang, Y. Wang, The unconstrained binary quadratic programming problem: a survey. Journal of Combinatorial Optimization 28
2014
Cited alongside, same era.
A. Lucas, Ising formulations of many NP problems. Front. Phys. 12
2014
Cited alongside, same era.
2020
Later among the works it cites.
Y. Wang, Z. Hu, B. C. Sanders, S. Kais, Qudits and high-dimensional quantum computing. Front. Phys. 10
2020
Later among the works it cites.
R. L. Singleton Jr., M. L. Rogers, D. L. Ostby, Grover’s algorithm with diffusion and amplitude steering. arXiv: 2110.11163 (2021)
2021
Later among the works it cites.
P. Shyamsundar, Non-boolean quantum amplitude amplification and quantum mean estimation. arXiv: 2102.04975 (2021)
2021
Later among the works it cites.
A. Gilliam, S. Woerner, C. Gonciulea, Grover adaptive search for constrained polynomial binary optimization. Quantum 5
2021
Later among the works it cites.
P. Date, D. Arthur, L. Pusey-Nazzaro, QUBO formulations for training machine learning models. Scientific Reports 11
2021
Later among the works it cites.
G. G. Guerreschi, Solving quadratic unconstrained binary optimization with divide-and-conquer and quantum algorithms. arXiv: 2101.07813 (2021)
2021
Later among the works it cites.
J. Rivera-Dean, P. Huembeli, A. Acin, J. Bowles, Avoiding local minima in variational quantum algorithms with neural networks. arXiv: 2104.02955 (2021)
2021
Later among the works it cites.
S. H. Sack, M. Serbyn, Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum 5
2021
Later among the works it cites.
D. Koch, M. Cutugno, S. Karlson, S. Patel, L. Wessing, P. M. Alsing, Gaussian amplitude amplification for quantum pathfinding. Entropy 24
2022
Later among the works it cites.
N. Benchasattabuse, T. Satoh, M. Hajdušek, R. V. Meter, Amplitude amplification for optimization via subdivided phase oracle. arXiv: 2205.00602 (2022)
2022
Later among the works it cites.
T. Roy, L. Jiang, D. I. Schuster, Deterministic Grover search with a restricted oracle. Phys. Rev. Research 4
2022
Later among the works it cites.
K. Plekhanov, M. Rosenkranz, M. Fiorentini, M. Lubasch, Variational quantum amplitude estimation. Quantum 6
2022
Later among the works it cites.
D. Herman, C. Googin, X. Liu, A. Galda, I. Safro, Y. Sun, M. Pistoia, Y. Alexeev, A survey of quantum computing for finance. arXiv: 2201.02773 (2022)
2022
Later among the works it cites.
T. Gabor, M. L. Rosenfeld, S. Feld, C. Linnhoff-Popien, How to approximate any objective function via quadratic unconstrained binary optimization. arXiv: 2204.11035 (2022)
2022
Later among the works it cites.
D. Willsch, M. Willsch, C. D. G. Calaza, F. Jin, H. De Raedt, M. Svensson, K. Michielsen, Benchmarking advantage and D-Wave 2000Q quantum annealers with exact cover problems. Quantum Inf. Process. 21
2022
Later among the works it cites.
A. Noiri, K. Takeda, T. Nakajima, T. Kobayashi, A. Sammak, G. Scappucci, S. Tarucha, Fast universal quantum gate above the fault-tolerance threshold in silicon. Nature 601
2022
Later among the works it cites.
R. Seidel, C. K-U. Becker, S. Bock, N. Tcholtchev, I-D. Gheorge-Pop, M. Hauswirth, Automatic generation of grover quantum oracles for arbitrary data structures. Quantum Sci. Tech. 8
2023
Closest in time.
E. Pelofske, A. Bartschi, S. Eidenbenz, Quantum annealing vs. QAOA: 127 qubit higher-order ising problems on NISQ computers. arXiv: 2301.00520 (2023)
2023
Closest in time.
K. Nieman, H. Durand, S. Patel, D. Koch, and P. M. Alsing, Application of quantum computing amplitude amplification techniques for solving problems in control and optimization. journal pending. (2023)
2023
Closest in time.