The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
A fully programmable 100-spin coherent Ising machine with all-to-all connections
Abstract
Taking the pulse of optimization: Finding the optimum solution of multiparameter or multifunctional problems is important across many disciplines, but it can be computationally intensive. Many such problems defined as computationally difficult can be mathematically mapped onto the so-called Ising problem, which looks at finding the minimum energy configuration for an array of coupled spins. Inagaki et al.and McMahon et al.show that an optical processing approach based on a network of coupled optical pulses in a ring fiber can be used to model and optimize large-scale Ising systems. Such a scalable architecture could help to optimize solutions to a wide range of complex problems. Science, this issue pp.603 and 614
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
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
Tank, D., & Hopfield, J. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085953 · Cited by 2,194
Computing with Neural Circuits: A Model
Hopfield, J. J., & Tank, D. W. (1986) · Science · doi:10.1126/science.3755256 · Cited by 2,116
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
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
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
(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
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
Bollobás, B. (1980) · European Journal of Combinatorics · doi:10.1016/s0195-6698(80)80030-8 · Cited by 1,151
Neural network computation with DNA strand displacement cascades
Qian, L., Winfree, E., & Bruck, J. (2011) · Nature · doi:10.1038/nature10262 · Cited by 1,071
DNA Solution of Hard Computational Problems
Lipton, R. J. (1995) · Science · doi:10.1126/science.7725098 · Cited by 1,057
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
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
Defining 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 1×
“Benchmarking relatively small Ising problem instances is fraught with difficulty (12), and it is not even particularly obvious what benchmarks are appropriate in any given situation.”
BackgroundModels of Random Regular Graphs
Wormald, N. C. (1999) · Surveys in Combinatorics, 1999 · doi:10.1017/cbo9780511721335.010 · Cited by 598
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W. K., & Adleman, L. (2002) · Science · doi:10.1126/science.1069528 · Cited by 568
Network 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-citationQuantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Wavelength-multiplexed quantum networks with ultrafast frequency combs
Roslund, J., de Araújo, R. M., Jiang, S., Fabre, C., & Treps, N. (2014) · Nature Photonics · doi:10.1038/nphoton.2013.340 · Cited by 513
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · Nature · doi:10.1038/nature17658 · Cited by 463
30 years of squeezed light generation
Andersen, U. L., Gehring, T., Marquardt, C., & Leuchs, G. (2016) · Physica Scripta · doi:10.1088/0031-8949/91/5/053001 · Cited by 442
(1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57811-0 · Cited by 417
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-citationFinding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366
Boson sampling for molecular vibronic spectra
Huh, J., Guerreschi, G. G., Peropadre, B., McClean, J. R., & Aspuru-Guzik, A. (2015) · Nature Photonics · doi:10.1038/nphoton.2015.153 · Cited by 341
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
Bunyk, P. I., Hoskinson, E. M., Johnson, M. W., Tolkacheva, E., Altomare, F., Berkley, A. J., Harris, R., Hilton, J. P., Lanting, T., Przybysz, A. J., et al. (2014) · IEEE Transactions on Applied Superconductivity · doi:10.1109/tasc.2014.2318294 · Cited by 312
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-citationA 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
30 years of squeezed light generation
Andersen, U. L., Gehring, T., Marquardt, C., & Leuchs, G. (2016) · Cited by 176
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
Linear optical quantum computing in a single spatial mode
Humphreys, P. C., Metcalf, B. J., Spring, J. B., Moore, M., Jin, X.-M., Barbieri, M., Kolthammer, W. S., & Walmsley, I. A. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.150501 · Cited by 145
Optimization hardness as transient chaos in an analog approach to constraint satisfaction
Ercsey-Ravasz, M., & Toroczkai, Z. (2011) · Nature Physics · doi:10.1038/nphys2105 · Cited by 142
Scalable Boson Sampling with Time-Bin Encoding Using a Loop-Based Architecture
Motes, K. R., Gilchrist, A., Dowling, J. P., & Rohde, P. P. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.120501 · Cited by 141
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
Statistical mechanics, three-dimensionality and NP-completeness
Istrail, S. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335316 · Cited by 123
Dual-pumped degenerate Kerr oscillator in a silicon nitride microresonator
Okawachi, Y., Yu, M., Luke, K. J., de Carvalho, D. O., Ramelow, S., Farsi, A., Lipson, M. F., & Gaeta, A. L. (2015) · Optics Letters · doi:10.1364/ol.40.005267 · Cited by 90
Barnett, S. M., & Pegg, D. T. (1997) · Springer eBooks · doi:10.1007/978-1-4615-5923-8_44 · Cited by 69
Haribara, Y., Utsunomiya, S., & Yamamoto, Y. (2016) · Entropy · doi:10.3390/e18040151 · Cited by 69
Self-citationQuantum correlation in degenerate optical parametric oscillators with mutual injections
Takata, K., Marandi, A., & Yamamoto, Y. (2015) · Physical Review A · doi:10.1103/physreva.92.043821 · Cited by 53
Self-citationMaruo, D., Utsunomiya, S., & Yamamoto, Y. (2016) · Physica Scripta · doi:10.1088/0031-8949/91/8/083010 · Cited by 44
Self-citationTopological evolution of networks : case studies in the US airlines and language Wikipedias
Bounova, G. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 27
Cited by
Probing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
Photonics for artificial intelligence and neuromorphic computing
Shastri, B. J., Tait, A. N., Ferreira de Lima, T., Pernice, W. H. P., Bhaskaran, H., Wright, C. D., & Prucnal, P. R. (2021) · Nature Photonics · doi:10.1038/s41566-020-00754-y · Cited by 1,756
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
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
Embedded Devices for Neuromorphic Time-Series Assessment
Mazumder, A. N., Hosseini, M., & Mohsenin, T. (2022) · Research Explorer (The University of Manchester) · doi:10.13016/m2ksy0-wxr3 · Cited by 652
Metadata
- Authors
- McMahon, P. L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., Byer, R. L., Fejer, M. M., Mabuchi, H., & Yamamoto, Y.
- Venue
- Science
- Published
- 2016-11-04
- Volume
- 354
- Issue
- 6312
- Pages
- 614-617
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2538025098
- Cited by
- 702
- References
- 44
- FWCI
- 41.22
- Type
- journal article
- Language
- en
- Open access
- closed
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.