The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
Open accessAbstract
A network of four degenerate optical parametric oscillators (OPOs) is employed to find the ground state of the Ising Hamiltonian. The good performance of the network reveals the potential of OPOs for many similar problems. Finding the ground states of the Ising Hamiltonian1 maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence and social network. So far, no efficient classical and quantum algorithm is known for these problems and intensive research is focused on creating physical systems—Ising machines—capable of finding the absolute or approximate ground states of the Ising Hamiltonian2,3,4,5,6. Here, we report an Ising machine using a network of degenerate optical parametric oscillators (OPOs). Spins are represented with above-threshold binary phases of the OPOs and the Ising couplings are realized by mutual injections7. The network is implemented in a single OPO ring cavity with multiple trains of femtosecond pulses and configurable mutual couplings, and operates at room temperature. We programmed a small non-deterministic polynomial time-hard problem on a 4-OPO Ising machine and in 1,000 runs no computational error was detected.
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
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
The Fokker-Planck Equation: Methods of Solution and Applications
Risken, H. (1996) · Springer Series in Synergetics · doi:10.1007/978-3-642-61544-3 · Cited by 9,056
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Spin glasses: Experimental facts, theoretical concepts, and open questions
Binder, K., & Young, A. P. (1986) · Reviews of Modern Physics · doi:10.1103/revmodphys.58.801 · Cited by 5,177
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
Docking and scoring in virtual screening for drug discovery: methods and applications
Kitchen, D. B., Decornez, H., Furr, J. R., & Bajorath, J. (2004) · Nature Reviews Drug Discovery · doi:10.1038/nrd1549 · Cited by 4,150
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
A family of embedded Runge-Kutta formulae
Dormand, J. R., & Prince, P. J. (1980) · Journal of Computational and Applied Mathematics · doi:10.1016/0771-050x(80)90013-3 · Cited by 3,634
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
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
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
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
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
The Fokker-Planck Equation: Methods of Solution and Applications
Elgin, J. N. (1984) · Optica Acta: International Journal of Optics · doi:10.1080/713821438 · Cited by 1,089
Quantum simulation of antiferromagnetic spin chains in an optical lattice
Simon, J., Bakr, W. S., Ma, R., Tai, M. E., Preiss, P. M., & Greiner, M. (2011) · Nature · doi:10.1038/nature09994 · Cited by 898
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
Quantum simulation of frustrated Ising spins with trapped ions
Kim, K., Chang, M.-S., Korenblit, S., Islam, R., Edwards, E. E., Freericks, J. K., Lin, G.-D., Duan, L.-M., & Monroe, C. (2010) · Nature · doi:10.1038/nature09071 · Cited by 750 · cited 2×
“r -1. To implement an artificial Ising spin system, elements with binary degrees of freedom and configurable couplings are required. This has been demonstrated experimentally in cold ion or atom system [17,18] with practical difficulties in scalability. Artificial Ising spin systems based on a network of injection locked…”
BackgroundTheory 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
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
Self-citationWavelength-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
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-citationThe Heisenberg Representation of Quantum Computers
Gottesman, D. (1998) · University of North Texas Digital Library (University of North Texas) · Cited by 385
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
Non-equilibrium Transitions in Sub/second Harmonic Generation
Drummond, P. D., McNeil, K. J., & Walls, D. F. (1981) · Optica Acta: International Journal of Optics · doi:10.1080/713820531 · Cited by 280
Thermally assisted quantum annealing of a 16-qubit problem
Dickson, N. G., Johnson, M. W., Amin, M. H., Harris, R., Altomare, F., Berkley, A. J., Bunyk, P., Cai, J., Chapple, E. M., Chavez, P., et al. (2013) · Nature Communications · doi:10.1038/ncomms2920 · Cited by 225
Mapping of Ising models onto injection-locked laser systems
Utsunomiya, S., Takata, K., & Yamamoto, Y. (2011) · Optics Express · doi:10.1364/oe.19.018091 · Cited by 199
Self-citationQuantum noise in the parametric oscillator: From squeezed states to coherent-state superpositions
Wolinsky, M., & Carmichael, H. J. (1988) · Physical Review Letters · doi:10.1103/physrevlett.60.1836 · Cited by 196
A combinatorial, primal-dual approach to semidefinite programs
Arora, S., & Kale, S. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250823 · Cited by 163
Optical frequency transfer via 146 km fiber link with 10^−19 relative accuracy
Grosche, G., Terra, O., Predehl, K., Holzwarth, R., Lipphardt, B., Vogt, F., Sterr, U., & Schnatz, H. (2009) · Optics Letters · doi:10.1364/ol.34.002270 · Cited by 161
Coherence properties of a doubly resonant monolithic optical parametric oscillator
Nabors, C. D., Yang, S. T., Day, T., & Byer, R. L. (1990) · Journal of the Optical Society of America B · doi:10.1364/josab.7.000815 · Cited by 115
Self-citationMarandi, A., Leindecker, N. C., Pervak, V., Byer, R. L., & Vodopyanov, K. L. (2012) · Optics Express · doi:10.1364/oe.20.007255 · Cited by 110
Self-citationAll-optical quantum random bit generation from intrinsically binary phase of parametric oscillators
Marandi, A., Leindecker, N. C., Vodopyanov, K. L., & Byer, R. L. (2012) · Optics Express · doi:10.1364/oe.20.019322 · Cited by 106
Self-citationNew Algorithm for the Ising Problem: Partition Function for Finite Lattice Graphs
Galluccio, A., Loebl, M., & Vondrák, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.5924 · Cited by 61
An optical fiber network oracle for NP-complete problems
Wu, K., de Abajo, F. J. G., Soci, C., Shum, P. P., & Zheludev, N. I. (2014) · Light Science & Applications · doi:10.1038/lsa.2014.28 · Cited by 58
All-Optical Quantum Random Bit Generation from Intrinsically Binary Phase of Parametric OscillatorsPreprint
Marandi, A., Leindecker, N. C., Vodopyanov, K. L., & Byer, R. L. (2014) · Cited by 58
Self-citationEfficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
Klein, P. N., & Lu, H.-I. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237980 · Cited by 47
Transient time of an Ising machine based on injection-locked laser network
Takata, K., Utsunomiya, S., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/1/013052 · Cited by 45
Self-citation
Cited by
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
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-citationA 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-citationIsing 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
Stabilization and operation of a Kerr-cat qubit
Grimm, A., Frattini, N. E., Puri, S., Mundhada, S. O., Touzard, S., Mirrahimi, M., Girvin, S. M., Shankar, S., & Devoret, M. H. (2020) · Nature · doi:10.1038/s41586-020-2587-z · Cited by 460
Metadata
- Authors
- Marandi, A., Wang, Z., Takata, K., Byer, R. L., & Yamamoto, Y.
- Venue
- Nature Photonics
- Published
- 2014-10-26
- Volume
- 8
- Issue
- 12
- Pages
- 937-942
- ISSN
- 1749-4885 (ISSN-L)
- 1749-4893
- OpenAlex
- W2042545232
- Cited by
- 541
- References
- 43
- FWCI
- 25.09
- Type
- journal article
- Language
- en
- Open access
- green
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.