The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Experimental investigation of performance differences between coherent Ising machines and a quantum annealer
Open accessAbstract
Benchmarking the coherent Ising machine and the D-Wave quantum annealer sheds light on the importance of connectivity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Solvable Model of a Spin-Glass
Sherrington, D., & Kirkpatrick, S. (1975) · Physical Review Letters · doi:10.1103/physrevlett.35.1792 · Cited by 4,265
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Deep learning with coherent nanophotonic circuits
Shen, Y., Harris, N. C., Skirlo, S., Prabhu, M., Baehr-Jones, T., Hochberg, M., Sun, X., Zhao, S., Larochelle, H., Englund, D., et al. (2017) · Nature Photonics · doi:10.1038/nphoton.2017.93 · Cited by 3,340
Self-citationQuantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Generation of Squeezed States by Parametric Down Conversion
Wu, L.-A., Kimble, H. J., Hall, J. L., & Wu, H. (1986) · Physical Review Letters · doi:10.1103/physrevlett.57.2520 · Cited by 1,653
(2008) · doi:10.1007/978-3-540-28574-8 · Cited by 1,386
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Neuromorphic photonic networks using silicon photonic weight banks
Tait, A. N., de Lima, T. F., Zhou, E., Wu, A. X., Nahmias, M. A., Shastri, B. J., & Prucnal, P. R. (2017) · Scientific Reports · doi:10.1038/s41598-017-07754-z · Cited by 849
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
A coherent Ising machine for 2000-node optimization problems
Inagaki, T., Haribara, Y., Igarashi, K., Sonobe, T., Tamate, S., Honjo, T., Marandi, A., McMahon, P. L., Umeki, T., Enbutsu, K., et al. (2016) · Science · doi:10.1126/science.aah4243 · Cited by 796
Self-citationTheory of Quantum Annealing of an Ising Spin Glass
Santoro, G. E., Martoňák, R., Tosatti, E., & Car, R. (2002) · Science · doi:10.1126/science.1068774 · Cited by 734
A fully programmable 100-spin coherent Ising machine with all-to-all connections
McMahon, P. L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., et al. (2016) · Science · doi:10.1126/science.aah5178 · Cited by 702
Self-citationDefining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601 · cited 4×
“This makes clear that, as in quantum annealing, there is a tradeoff between success probability and annealing time [18].”
BackgroundInfluentialNetwork of time-multiplexed optical parametric oscillators as a coherent Ising machine
Marandi, A., Wang, Z., Takata, K., Byer, R. L., & Yamamoto, Y. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.249 · Cited by 541
Self-citationMinor-embedding in adiabatic quantum computation: I. The parameter setting problem
Choi, V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0082-9 · Cited by 410
Coherent Ising machine based on degenerate optical parametric oscillators
Wang, Z., Marandi, A., Wen, K., Byer, R. L., & Yamamoto, Y. (2013) · Physical Review A · doi:10.1103/physreva.88.063853 · Cited by 391
Self-citationOptimization using quantum mechanics: quantum annealing through adiabatic evolution
Santoro, G. E., & Tosatti, E. (2006) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/39/36/r01 · Cited by 354
Application of statistical mechanics to NP-complete problems in combinatorial optimisation
Fu, Y., & Anderson, P. W. (1986) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/19/9/033 · Cited by 317
Non-equilibrium Transitions in Sub/Second Harmonic Generation
Drummond, P. D., McNeil, K. J., & Walls, D. F. (1980) · Optica Acta International Journal of Optics · doi:10.1080/713820226 · Cited by 290
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Choi, V. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0200-3 · Cited by 278
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G., & Wiegele, A. (2010) · Mathematical Programming · doi:10.1007/s10107-008-0235-8 · Cited by 264
Large-scale Ising spin network based on degenerate optical parametric oscillators
Inagaki, T., Inaba, K., Hamerly, R., Inoue, K., Yamamoto, Y., & Takesue, H. (2016) · Nature Photonics · doi:10.1038/nphoton.2016.68 · Cited by 258
Self-citationCoherent Ising machines—optical neural networks operating at the quantum limit
Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0048-9 · Cited by 258
Self-citationDemonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238 · cited 1×
“It has been observed empirically on D-Wave quantum annealers that, for Chimera graph spin glasses, optimal time to solution scales as Tsoln o exp (O(N )) (18, 19, 49), while Tsoln at fixed anneal times increases more steeply (18).”
BackgroundIntrinsic optimization using stochastic nanomagnets
Sutton, B., Camsari, K. Y., Behin-Aein, B., & Datta, S. (2017) · Scientific Reports · doi:10.1038/srep44370 · Cited by 226
A case study in programming a quantum annealer for hard operational planning problems
Rieffel, E. G., Venturelli, D., O’Gorman, B., Do, M. B., Prystay, E. M., & Smelyanskiy, V. N. (2015) · Quantum Information Processing · doi:10.1007/s11128-014-0892-x · Cited by 218
Self-citationQuantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209
Self-citationQuantum Speedup by Quantum Annealing
Somma, R. D., Nagaj, D., & Kieferová, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050501 · Cited by 176
Fast clique minor generation in Chimera qubit connectivity graphs
Boothby, T., King, A. D., & Roy, A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1150-6 · Cited by 174
Katzgraber, H. G., Hamze, F., & Andrist, R. S. (2014) · Physical Review X · doi:10.1103/physrevx.4.021008 · Cited by 157
Hardness of approximating problems on cubic graphs
Alimonti, P., & Kann, V. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62592-5_80 · Cited by 146
Quantum dynamics of the parametric oscillator
Kinsler, P., & Drummond, P. D. (1991) · Physical Review A · doi:10.1103/physreva.43.6194 · Cited by 138
Breakout Local Search for the Max-Cutproblem
Benlic, U., & Hao, J. (2012) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2012.09.001 · Cited by 138
Vertex coloring of graphs via phase dynamics of coupled oscillatory networks
Parihar, A., Shukla, N., Jerry, M., Datta, S., & Raychowdhury, A. (2017) · Scientific Reports · doi:10.1038/s41598-017-00825-1 · Cited by 136
Mandrà, S., Zhu, Z., Wang, W., Perdomo‐Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 112
Gardas, B., Dziarmaga, J., Zurek, W. H., & Zwolak, M. (2018) · Scientific Reports · doi:10.1038/s41598-018-22763-2 · Cited by 100
Adiabatic quantum programming: minor embedding with hard faults
Klymko, C., Sullivan, B. D., & Humble, T. S. (2014) · Quantum Information Processing · doi:10.1007/s11128-013-0683-9 · Cited by 99
Computational Complexity Theory
Rudich, S., & Wigderson, A. (2004) · IAS/Park City mathematics series · doi:10.1090/pcms/010 · Cited by 96
A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
Takata, K., Marandi, A., Hamerly, R., Haribara, Y., Maruo, D., Tamate, S., Hiromasa, S., Utsunomiya, S., & Yamamoto, Y. (2016) · Scientific Reports · doi:10.1038/srep34089 · Cited by 87
Self-citationA deceptive step towards quantum speedup detection
Mandrà, S., & Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac8b2 · Cited by 82
Haribara, Y., Utsunomiya, S., & Yamamoto, Y. (2016) · Entropy · doi:10.3390/e18040151 · Cited by 69
Self-citationMaruo, D., Utsunomiya, S., & Yamamoto, Y. (2016) · Physica Scripta · doi:10.1088/0031-8949/91/8/083010 · Cited by 44
Self-citationTakesue, H., & Inagaki, T. (2016) · Optics Letters · doi:10.1364/ol.41.004273 · Cited by 41
Self-citationEfficient Analog Circuits for Boolean Satisfiability
Yin, X., Sedighi, B., Varga, M., Ercsey-Ravasz, M., Toroczkai, Z., & Hu, X. S. (2017) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2017.2754192 · Cited by 41
Uncertain behaviours of integrated circuits improve computational performance
Yoshimura, C., Yamaoka, M., Hayashi, M., Okuyama, T., Aoki, H., Kawarabayashi, K., & Mizuno, H. (2015) · Scientific Reports · doi:10.1038/srep16213 · Cited by 39
Self-citationGaussian optical Ising machines
Clements, W. R., Renema, J. J., Wen, Y., Chrzanowski, H. M., Kolthammer, W. S., & Walmsley, I. A. (2017) · Physical Review A · doi:10.1103/physreva.96.043850 · Cited by 36
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35
Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2018) · arXiv (Cornell University) · Cited by 14
Self-citation
Cited by
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 543
Self-citationCai, F., Kumar, S., Van Vaerenbergh, T., Sheng, X., Liu, R., Li, C., Liu, Z., Foltin, M., Yu, S., Xia, Q., et al. (2020) · Nature Electronics · doi:10.1038/s41928-020-0436-6 · Cited by 393
Third-order nanocircuit elements for neuromorphic engineering
Kumar, S., Williams, R. S., & Wang, Z. (2020) · Nature · doi:10.1038/s41586-020-2735-5 · Cited by 368
100,000-spin coherent Ising machine
Honjo, T., Sonobe, T., Inaba, K., Inagaki, T., Ikuta, T., Yamada, Y., Kazama, T., Enbutsu, K., Umeki, T., Kasahara, R., et al. (2021) · Science Advances · doi:10.1126/sciadv.abh0952 · Cited by 341
Self-citation
Metadata
- Authors
- Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., Enbutsu, K., Umeki, T., Kasahara, R., Utsunomiya, S., Kako, S., Kawarabayashi, K.-I., Byer, R. L., Fejer, M. M., Mabuchi, H., Englund, D., Rieffel, E., Takesue, H., & Yamamoto, Y.
- Venue
- Science Advances
- Published
- 2019-05-03
- Volume
- 5
- Issue
- 5
- Pages
- eaau0823-eaau0823
- ISSN
- 2375-2548 (ISSN-L)
- OpenAlex
- W2887462821
- Cited by
- 328
- References
- 51
- FWCI
- 14.74
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.