The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Coherent Ising machines—optical neural networks operating at the quantum limit
Open accessAbstract
In this article, we will introduce the basic concept and the quantum feature of a novel computing system, coherent Ising machines, and describe their theoretical and experimental performance. We start with the discussion how to construct such physical devices as the quantum analog of classical neuron and synapse, and end with the performance comparison against various classical neural networks implemented in CPU and supercomputers.
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
Optical Coherence and Quantum Optics
Mandel, L., & Wolf, E. (1995) · doi:10.1017/cbo9781139644105 · Cited by 8,356
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
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
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
Cited by
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
Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2019) · Science Advances · doi:10.1126/sciadv.aau0823 · Cited by 328
Self-citationHigh-performance combinatorial optimization based on classical mechanics
Goto, H., Endo, K., Suzuki, M., Sakai, Y., Kanao, T., Hamakawa, Y., Hidaka, R., Yamasaki, M., & Tatsumura, K. (2021) · Science Advances · doi:10.1126/sciadv.abe7953 · Cited by 231
Metadata
- Authors
- Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H.
- Venue
- npj Quantum Information
- Published
- 2017-12-15
- Volume
- 3
- Issue
- 1
- ISSN
- 2056-6387 (ISSN-L)
- OpenAlex
- W2771114131
- Cited by
- 258
- References
- 48
- FWCI
- 8.04
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Coherent Ising machines—optical neural networks operating at the quantum limit. https://app.cochat.ai/papers/10.1038/s41534-017-0048-9
- The paper
- Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H. (2017). Coherent Ising machines—optical neural networks operating at the quantum limit. npj Quantum Information. https://doi.org/10.1038/s41534-017-0048-9
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.
