Fetching the paper…
Reading the bibliography…
We study the performance scaling of three quantum algorithms for combinatorial optimization: measurement-feedback coherent Ising machines (MFB-CIM), discrete adiabatic quantum computation (DAQC), and the D\"urr-Hoyer algorithm for quantum minimum finding (DH-QMF) that is based on Grover's search.
M. Born and V. Fock, Beweis des Adiabatensatzes, Zeitschrift für Physik 51
1928
Earlier work this paper cites.
F. Barahona, On the computational complexity of Ising spin glass models, Journal of Physics A: Mathematical and General 15
1982
Earlier work this paper cites.
S. Kirkpatric, Optimization by simulated annealing, Science 220
1983
Earlier work this paper cites.
D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning, Operations Research 37
1989
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM (JACM) 42
1995
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996) pp. 212–219
1996
Earlier work this paper cites.
C. Dürr and P. Høyer, A quantum algorithm for finding the minimum, arXiv: quant-ph/9607014 (1996)
1996
Earlier work this paper cites.
L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Physical Review Letters 79
1997
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58
1998
Earlier work this paper cites.
M. Boyer, G. Brassard, P. Høyer, and A. Tapp, Tight bounds on quantum searching, Fortschritte der Physik: Progress of Physics 46
1998
Earlier work this paper cites.
J. Brooke, D. Bitko, G. Aeppli, et al. , Quantum annealing of a disordered magnet, Science 284
1999
Earlier work this paper cites.
B. Pablo-Norman and M. Ruiz-Altaba, Noise in Grover’s quantum search algorithm, Phys. Rev. A 61
1999
Earlier work this paper cites.
G. L. Long, Y. S. Li, W. L. Zhang, and C. C. Tu, Dominant gate imperfection in Grover’s quantum search algorithm, Phys. Rev. A 61
2000
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, arXiv preprint quant-ph/0001106 (2000)
2000
Earlier work this paper cites.
T. G. Draper, Addition on a quantum computer, arXiv: quant-ph/0008033 (2000)
2000
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science 292
2001
Earlier work this paper cites.
H. Azuma, Decoherence in Grover’s quantum algorithm: Perturbative approach, Phys. Rev. A 65
2002
Earlier work this paper cites.
J. Roland and N. J. Cerf, Quantum search by local adiabatic evolution, Physical Review A 65
2002
Earlier work this paper cites.
N. Shenvi, K. R. Brown, and K. B. Whaley, Effects of a random noisy oracle on search algorithm complexity, Phys. Rev. A 68
2003
Earlier work this paper cites.
D. Shapira, S. Mozes, and O. Biham, Effect of unitary noise on Grover’s quantum search algorithm, Phys. Rev. A 67
2003
Earlier work this paper cites.
V. Choi, Minor-embedding in adiabatic quantum computation: I. The parameter setting problem, Quantum Information Processing 7
2008
Earlier work this paper cites.
P. J. Salas, Noise effect on Grover algorithm, The European Physical Journal D 46
2008
Earlier work this paper cites.
S. Utsunomiya, K. Takata, and Y. Yamamoto, Mapping of Ising models onto injection-locked laser systems, Optics Express 19
2011
Cited alongside, same era.
P. Gawron, J. Klamka, and R. Winiarczyk, Noise effects in the quantum search algorithm from the viewpoint of computational complexity, International Journal of Applied Mathematics and Computer Science 22
2012
Cited alongside, same era.
Z. Wang, A. Marandi, K. Wen, R. L. Byer, and Y. Yamamoto, Coherent Ising machine based on degenerate optical parametric oscillators, Physical Review A 88
2013
Cited alongside, same era.
A. Lucas, Ising formulations of many NP problems, Frontiers in Physics 2
2014
Cited alongside, same era.
2014
R. Hamerly, T. Inagaki, P. L. McMahon, D. Venturelli, A. Marandi, T. Onodera, E. Ng, C. Langrock, K. Inaba, T. Honjo, et al. , Experimental investigation of performance differences between coherent Ising machines and a quantum annealer, Science Advances 5
2019
Later among the works it cites.
T. Leleu, Y. Yamamoto, P. L. McMahon, and K. Aihara, Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity, Physical review letters 122
2019
Later among the works it cites.
2019
Later among the works it cites.
G. G. Guerreschi and A. Y. Matsuura, QAOA for max-cut requires hundreds of qubits for quantum speed-up, Scientific Reports 9
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
S. Boixo, T. F. Rønnow, S. V. Isakov, Z. Wang, D. Wecker, D. A. Lidar, J. M. Martinis, and M. Troyer, Evidence for quantum annealing with more than one hundred qubits, Nature Physics 10
2014
Cited alongside, same era.
A. Marandi, Z. Wang, K. Takata, R. L. Byer, and Y. Yamamoto, Network of time-multiplexed optical parametric oscillators as a coherent Ising machine, Nature Photonics 8
2014
Cited alongside, same era.
K. Takata, A. Marandi, and Y. Yamamoto, Quantum correlation in degenerate optical parametric oscillators with mutual injections, Phys. Rev. A 92
2015
Cited alongside, same era.
T. Inagaki, K. Inaba, R. Hamerly, K. Inoue, Y. Yamamoto, and H. Takesue, Large-scale Ising spin network based on degenerate optical parametric oscillators, Nature Photonics 10
2016
Cited alongside, same era.
P. L. McMahon, A. Marandi, Y. Haribara, R. Hamerly, C. Langrock, S. Tamate, T. Inagaki, H. Takesue, S. Utsunomiya, K. Aihara, et al. , A fully programmable 100-spin coherent Ising machine with all-to-all connections, Science 354
2016
Cited alongside, same era.
D. Maruo, S. Utsunomiya, and Y. Yamamoto, Truncated wigner theory of coherent ising machines based on degenerate optical parametric oscillator network, Physica Scripta 91
2016
Cited alongside, same era.
U. Benlic, E. K. Burke, and J. R. Woodward, Breakout local search for the multi-objective gate allocation problem, Computers & Operations Research 78
2017
Cited alongside, same era.
2019
Later among the works it cites.
E. Campbell, A. Khurana, and A. Montanaro, Applying quantum algorithms to constraint satisfaction problems, Quantum 3
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Kako, T. Leleu, Y. Inui, F. Khoyratee, S. Reifenstein, and Y. Yamamoto, Coherent Ising machines with error correction feedback, Advanced Quantum Technologies , 2000045 (2020)
2020
Later among the works it cites.
J. Marshall, F. Wudarski, S. Hadfield, and T. Hogg, Characterizing local noise in QAOA circuits, IOP SciNotes 1
2020
Later among the works it cites.
2020
Later among the works it cites.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, Phys. Rev. X 10
2020
Later among the works it cites.
2020
Later among the works it cites.
M. Willsch, D. Willsch, F. Jin, H. De Raedt, and K. Michielsen, Benchmarking the quantum approximate optimization algorithm, Quantum Information Processing 19
2020
Later among the works it cites.
2021
Closest in time.
R. Babbush, J. R. McClean, M. Newman, C. Gidney, S. Boixo, and H. Neven, Focus beyond quadratic speedups for error-corrected quantum advantage, PRX Quantum 2
2021
Closest in time.
C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5
2021
Closest in time.
T. Leleu, F. Khoyratee, T. Levi, R. Hamerly, T. Kohno, and K. Aihara, Scaling advantage of chaotic amplitude control for high-performance combinatorial optimization, Communications Physics 4
2021
Closest in time.
H. Goto, K. Endo, M. Suzuki, Y. Sakai, T. Kanao, Y. Hamakawa, R. Hidaka, M. Yamasaki, and K. Tatsumura, High-performance combinatorial optimization based on classical mechanics, Science Advances 7
2021
Closest in time.
K. Tatsumura, M. Yamasaki, and H. Goto, Scaling out Ising machines using a multi-chip architecture for simulated bifurcation, Nature Electronics 4
2021
Closest in time.
S. Reifenstein, S. Kako, F. Khoyratee, T. Leleu, and Y. Yamamoto, Coherent Ising Machines with optical Error Correction Circuits, Adv. Quantum Technol. 4
2021
Closest in time.
E. Ng, T. Onodera, S. Kako, P. L. McMahon, H. Mabuchi, and Y. Yamamoto, Efficient sampling of ground and low-energy ising spin configurations with a coherent ising machine, Phys. Rev. Research 4
2022
Closest in time.
T. P. McKenna, H. S. Stokowski, V. Ansari, J. Mishra, M. Jankowski, C. J. Sarabalis, J. F. Herrmann, C. Langrock, M. M. Fejer, and A. H. Safavi-Naeini, Ultra-low-power second-order nonlinear optics on a chip, Nature Communications 13
2022
Closest in time.