Turing-Completeness and Undecidability in Coupled Nonlinear Optical Resonators

Alireza Marandi; Gordon Li

REVIEW 3 major objections 6 minor 51 references

Turing-Completeness and Undecidability in Coupled Nonlinear Optical Resonators

T0 review · 3 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A 12-pulse degenerate optical parametric oscillator network can simulate any Turing machine, making the long-term behavior of such networks formally undecidable.

desk verdict Plausible and important claim that DOPONs are Turing-complete, but the proof has an unaddressed gap in the multi-cycle state update and the halting-to-steady-state bridge is asserted, not proven. read the letter →

arxiv 2501.06966 v1 pith:R4GU66FL submitted 2025-01-12 physics.optics

Gordon Li , Alireza Marandi This is my paper · ORCID

classification physics.optics PACS 42.65.Yj

keywords TuringcompletenesscouplednonlinearopticalresonatorsdegenerateparametricoscillatornetworkundecidabilityhaltingproblemCantor-likeencodingIsingmachinecomputing

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper argues that a network of coupled nonlinear optical resonators—specifically a Degenerate Optical Parametric Oscillator Network (DOPON) with only 12 optical pulses—can simulate any Turing machine. If the proof is right, devices currently built as optical Ising solvers and accelerators are in principle universal computers. A sharp consequence follows: no algorithm can always decide whether an arbitrary DOPON reaches a steady state or periodic oscillation, and no finite time-to-solution can bound all optimization runs. The proof works by an explicit construction that encodes the machine's state in one pulse amplitude and its two-sided tape in two other pulse amplitudes, with eight auxiliary pulses carrying the transition logic. The paper is careful to locate the idealization in the unbounded precision required for those tape amplitudes.

What carries the argument

The carrying mechanism is a time-periodic schedule of linear couplings among 12 real-valued pulse amplitudes, each evolving under the saturable-gain map rho. The tape is compressed into two real numbers r and l by a Cantor-like base-4 encoding that leaves gaps in the unit interval, so the leading bit (the symbol under the head) is read in constant time by the threshold operation rho(8r−3). Products between decoded state and symbol bits are built with the identity a·b = rho(a+b−2)+1 for a,b in {0,1}, and products with continuous variables with a·x = rho(x+2a−2)+1−a. The eight ancilla pulses store those products and intermediate updates so that everything is expressible as linear couplings Jij(t) plus one nonlinear gain function, with the coupling schedule repeating every 8m steps.

What would settle it

Implement the 12-pulse construction for a universal Turing machine with l and r truncated to a fixed bit depth (say 64-bit floats) and run a target machine that halts after a very long but finite number of steps; if the trajectory with truncated precision diverges from the exact simulation before halting, or if the network fails to reach a steady state when the simulated machine halts, then the claimed physical Turing-completeness fails in that regime.

Watch

Extended reading notes

Core claim

Theorem 1 constructs, for every Turing machine T, a DOPON with N = 12 pulses that exactly simulates T, with each step of T taking 8m resonator roundtrips where m is the number of control states. The state is encoded in the amplitude q using a unary-like alternating binary expansion, and the tape is encoded in two Cantor-like base-4 expansions r and l, chosen so that the symbol under the head can be read by a single threshold operation rather than by scanning the whole tape. A repeating 8-cycle of linear couplings, using eight ancilla pulses to store products and intermediate updates, implements the transition functions G, F, D. Because a universal Turing machine can be encoded this way, the paper concludes that deciding whether a DOPON ever reaches a steady state or periodic orbit is undecidable, and that no computable time-to-solution exists for DOPON optimization devices.

Load-bearing premise

Everything hinges on two idealizations: the tape-encoding pulse amplitudes l and r carry unbounded real-number precision, and halting of the simulated Turing machine corresponds to a steady-state or periodic oscillation in the optical network; if either fails, the undecidability results fall.

Editorial extensions

If this is right

For arbitrary DOPONs, the decision problem 'does this network eventually reach a steady state or periodic oscillation?' is undecidable; no algorithm can answer it for all couplings and initial conditions.
There is no finite time-to-solution that provably bounds all DOPON optimization runs, so finite cutoffs used in optical Ising-machine studies are heuristic restrictions, not guaranteed procedures.
Heuristics and scaling laws fitted on small networks cannot in principle be certified to generalize to large networks; in this model the divide sits at N = 12 pulses.
Because the construction is explicit and uses experimentally plausible ingredients—saturable gain and linear couplings—the undecidability results apply to the idealized model before any finite-precision or noise effects are added.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

If practical optical pulses carry finite precision and noise, physical DOPONs would implement at most finite automata, so the paper's Turing-completeness is a statement about an idealized mathematical model; mapping a hierarchy of computational power versus precision would be the natural next step.
The N = 12 threshold holds for time-varying, all-to-all, dissipative couplings; for static, nearest-neighbor, or conservative couplings the minimal universal size could be much larger, or universality could disappear entirely.
The same construction technique should transpose to other analog hardware governed by a saturable nonlinearity plus linear coupling, suggesting that a broader class of continuous-state physical systems carries undecidable dynamics.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

This paper makes a real claim: 12-pulse DOPONs simulate any Turing machine, and hence reachability of steady-state/periodic behavior is undecidable. That's worth taking seriously. The explicit construction with the Cantor-like tape encoding and the N=12 resource count is a genuine contribution, and the authors are honest about the unbounded precision hiding in the initial conditions.

But the proof as written has a load-bearing gap. The stress-test note is correct: for a two-state TM with G(q1,s0)=q2, Eq. (16) gives q(8)=5/8, which is not a U-encoding and lies outside the interval [1/4,1/2] used in Eq. (5a). The paper says the remaining m-1 cycles follow analogously and that dummy ones are added and then deleted, but no recurrence for the padded q is given. On the next cycle, the decoding step produces a3(3)=2, not a boolean, so the construction actually fails as written. This is not a cosmetic omission; it is the core of Theorem 1. The result may still be true with a modified encoding or an explicit normalization step, but the proof needs that step written down and verified.

The undecidability corollary has a second, separate gap: the map from TM halting to steady-state or periodic oscillation is asserted, not proven. The DOPON runs forever; what happens after the simulated TM halts is undefined in the construction. You need to show that the DOPON's trajectory has an observable condition equivalent to halting.

Smaller issues: the 'minimum threshold' language overstates an upper bound, and the paper cites Siegelmann-Sontag only for the tape encoding, ignoring that the overall construction is an adaptation of their analog-neural-network universality. That is not fatal, but the citation pattern undersells the prior art.

Bottom line: this is a significant idea with a fixable but real technical gap. I would send it to a serious referee, but not accept it as is. The authors need to supply the m-cycle recurrence and prove the halting correspondence. If they do, this will be a solid contribution to analog-computation theory.

Referee Report

3 major / 6 minor

Summary. The paper claims that a Degenerate Optical Parametric Oscillator Network (DOPON) with only 12 optical pulses is Turing-complete, and derives as a corollary that determining whether an arbitrary DOPON reaches a steady state or periodic oscillation is undecidable. The proof constructs an explicit embedding of a Turing machine's state, tape, and head in the continuous pulse amplitudes q, r, l, with auxiliary variables, and gives an 8-cycle of linear-plus-saturating updates that checks one machine state (q1). The paper asserts that the remaining state-checks and updates follow analogously over m 8-cycles per Turing step, with coupling weights periodic with period 8m. The undecidability claim is presented as a direct reduction from the Halting Problem.

Significance. If the construction and the undecidability corollary are correct, the paper establishes a striking result: a physically motivated model of coupled nonlinear optical resonators can compute any Turing-computable function with a fixed, small number of pulses, and several natural dynamical questions about such systems are formally undecidable. This would be a significant contribution to the theory of analog and optical computing, and it is made more credible by the explicit nature of the proposed simulation and by the authors' candid discussion of the unbounded-precision assumption. The paper also correctly distinguishes mathematical undecidability from practical limitations such as noise and finite precision, which is a strength. However, both the proof of Theorem 1 and the bridge from Turing halting to optical steady/periodic behavior contain load-bearing gaps that must be addressed before the results can be accepted.

major comments (3)

[Theorem 1 proof, Eqs. (16)-(19)] The proof specifies only the first 8-cycle, which checks whether the encoded state is q1, and states that the remaining m-1 cycles follow analogously. This is not a minor omission: the update rule in Eq. (16) with m=2 and G(q1,s0)=q2 yields q(8)=5/8 when s0=1, which is not a U-encoding (U(q2)=1/4). The paper says that 'dummy ones' are added to the front of q, but no mechanism for doing so is given, and the value 5/8=0.101 binary has a leading 1, so the same state-check procedure of Eqs. (5a)-(5c) would not produce a Boolean decision: for q(8)=5/8, q(1)=-1/4, leading to a3(3)=2, which is outside {0,1} and breaks the product identities used later. The full m-cycle recurrence, including the normalization or bit-deletion operations that restore q to a valid encoded state, must be written down and verified before Theorem 1 is established.
[Physical consequences, first paragraph] The undecidability corollary rests entirely on the sentence 'halting in the TM corresponds to a steady-state/periodic oscillation in the corresponding DOPON.' This correspondence is asserted, not derived. The transition functions G, F, D are partial; when the simulated TM halts, the paper does not define what coupling weights Jij(t) are applied or what the DOPON state does. Conversely, if the TM does not halt, the DOPON must be shown never to enter any periodic orbit despite its nonlinear saturating dynamics; this is also not argued. Without an explicit construction of the halted-DOPON behavior and a proof that non-halting TMs yield non-periodic DOPON dynamics, the reduction from the Halting Problem to steady-state/periodic-oscillation existence is incomplete.
[Physical consequences, overall] The decision problem whose undecidability is claimed is not formally specified. The DOPON is defined by the infinite sequence of coupling weights {Jij(t)}; an undecidability statement requires a precise notion of the input, e.g., a finite description of a Turing machine that generates the couplings, or a computable function for Jij(t). Without this, the claim that there is 'no algorithm that can always correctly answer' the existence of a steady state or periodic oscillation is not a well-defined statement about a decision problem with finite input strings. This should be made precise, along with the halt-to-periodic mapping, for the physical-consequences section to be rigorous.

minor comments (6)

[Definition 2, Eq. (2)] The function rho is defined on x >= 0 and said to be odd; the odd extension should be stated explicitly to avoid ambiguity for negative arguments, which are used throughout the proof (e.g., Eq. (5b) can produce negative values).
[Eq. (17a)] The expression '21' is confusing; it should be written as '2*1' (two times the constant pulse) or with a symbol for the constant auxiliary pulse, because in the PDF it appears as the integer 21.
[Fig. 3 caption] The phrase 'time step t ≡ 0, 1, 2, ... , 7 (mod 8)' is not standard; it should read 't mod 8' or 't = 0, 1, ..., 7 (mod 8)'.
[Introduction, second paragraph] There is a typo: 'dissipitive' should be 'dissipative'.
[Eqs. (10) and (13)] The bracket expressions are difficult to parse; a more explicit derivation of how these terms are realized with linear couplings and the rho function would improve readability, especially because the correctness of these equations is central to the construction.
[Discussion, 'hidden infinity' paragraph] The paper acknowledges that unbounded precision in l and r is needed; this is a serious limitation for the claim that the result is 'well-within current experimental capabilities.' The Discussion handles this, but the abstract's phrase 'profound physical consequences' may overstate the implications for real finite-precision devices.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the Turing-completeness proof is an explicit, self-contained construction from the TM transition functions, and the undecidability corollary is a standard reduction from the halting problem.

full rationale

The central claim, Theorem 1, is an explicit simulation construction: the TM state and tape are encoded in real pulse amplitudes via Table I, and the 8-cycle update equations (Eqs. 5-20) are written out for the first state, with the remaining cycles said to follow analogously. The construction consumes only the TM's own transition functions G, F, D as parameters; there is no fitted quantity, no output that is reused as an input, and no prediction that reduces to the definition of the model. The Cantor-like tape encoding is taken from the external reference [47] and is disclosed as such, which is using a published encoding as a component rather than a circular self-import. The undecidability consequences in 'Physical consequences' rest on Turing's halting problem [31] and the reduction direction is the standard one. Two rigor gaps do exist but they are not circularity: (i) the statement 'halting in the TM corresponds to a steady-state/periodic oscillation in the corresponding DOPON' is asserted without explicitly modeling the post-halting dynamics (e.g., a fixed-point continuation), and (ii) the induction over the remaining m-1 8-cycles is summarized as 'follows analogously' rather than fully specified. These are missing-proof concerns about the derivation chain, not instances where a result is equivalent to its input by construction, so under the hard rules they do not raise the circularity score. Self-citations (e.g., Refs. [4,26,44,50]) are used for physical background or prior DOPON models, and none is the load-bearing justification for the simulation or the undecidability claim. No uniqueness theorem is imported from the authors' prior work. The paper is therefore not circular; it is an independent, if partly under-specified, mathematical construction.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claim rests on an idealized mathematical model: exact real amplitudes, noiseless evolution, and a priori known rational couplings. No parameters are fitted to data. The key assumption beyond standard mathematics is the availability of unbounded precision in initial conditions, which the paper explicitly acknowledges. The halting-to-steady-state mapping is an additional unproven bridge needed for the undecidability corollaries.

assumptions (5)

standard math The Halting Problem is undecidable (Turing 1937).
Used in the Physical consequences section to derive the undecidability of steady-state existence and time-to-solution.
domain assumption The DOPON model (Eq. 1) is an exact representation of a coupled nonlinear optical resonator network, with noiseless deterministic evolution and exact real-valued amplitudes.
The whole Turing-completeness proof operates inside this idealized model; the paper acknowledges noise and finite precision are ignored.
domain assumption The initial tape encodings r(0) and l(0) can be set to arbitrary real numbers in the relevant intervals, requiring unbounded precision.
The 'hidden infinity' discussed in the Discussion section; the infinite tape is packed into finite-width real intervals, so exact encoding requires infinite information.
domain assumption The coupling weights Jij(t) are programmable to arbitrary rational values with a known 8m-periodic schedule that does not depend on intermediate computation.
Stated in Definition 2 remarks and used in the construction; the paper argues this is experimentally plausible for the two proposed implementations.
ad hoc to paper Halting in the simulated Turing machine corresponds to a steady-state or periodic oscillation in the DOPON.
Invoked in the Physical consequences section to derive undecidability, but never proven or constructed. The paper does not specify what the DOPON does when the TM's transition functions are undefined.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Turing-Completeness and Undecidability in Coupled Nonlinear Optical Resonators." pith.science (2026). https://pith.science/paper/R4GU66FL

@misc{pith2026250106966,
  author       = {Pith},
  title        = {Pith review of: Turing-Completeness and Undecidability in Coupled Nonlinear Optical Resonators},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/R4GU66FL}},
  note         = {Machine review of arXiv:2501.06966}
}

read the original abstract

Networks of coupled nonlinear optical resonators have emerged as an important class of systems in ultrafast optical science, enabling richer and more complex nonlinear dynamics compared to their single-resonator or travelling-wave counterparts. In recent years, these coupled nonlinear optical resonators have been applied as application-specific hardware accelerators for computing applications including combinatorial optimization and artificial intelligence. In this work, we rigorously prove a fundamental result showing that coupled nonlinear optical resonators are Turing-complete computers, which endows them with much greater computational power than previously thought. Furthermore, we show that the minimum threshold of hardware complexity needed for Turing-completeness is surprisingly low, which has profound physical consequences. In particular, we show that several problems of interest in the study of coupled nonlinear optical resonators are formally undecidable. These theoretical findings can serve as the foundation for better understanding the promise of next-generation, ultrafast all-optical computers.

Figures

Figures reproduced from arXiv: 2501.06966 by the authors.

**Figure 1.** Computational models. (a) A Turing Machine (TM) consists of a bi-infinite tape of symbols, a head that can read/write symbols and move left/right, and a finite state control. A degenerate optical parametric oscillator network (DOPON) can be implemented using time-multiplexing in which short laser pulses act as independent nonlinear resonators that interact via either (b) intra-cavity time-delayed couplings or (c) … view at source ↗

**Figure 2.** Cantor-like tape encoding. The Cantor-like encoding in base 4 introduces gaps into the unit interval such that the most-significant bit of the tape can be read in constant O(1) time without traversing the entire tape sequence. all t ∈ N, and let aj (0) = 0 for j = 1, 2, . . . , 8. The ancillary variables begin and end with zero amplitude during each step of T . For the coupling weights Jij (t), the general strat… view at source ↗

**Figure 3.** Turing Machine simulation steps. Network connectivity for a DOPON simulating a TM where red pulses represent the time-multiplexed laser pulses in the DOPON during each time step t ≡ 0, 1, 2, . . . , 7 (mod 8) and blue lines show the active pulse couplings Jij (t) ̸= 0 during each 8-cycle. The 8-cycle repeats m times per step of the TM where m is the number of TM finite control states, so the coupling weights Jij (t)… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

51 extracted references · 44 canonical work pages

[1]

Zhang, C

M. Zhang, C. Wang, Y. Hu, A. Shams-Ansari, T. Ren, S. Fan, and M. Lonˇ car, Electronically programmable pho- tonic molecule, Nature Photonics 13, 36 (2019)

work page 2019
[2]

Tikan, J

A. Tikan, J. Riemensberger, K. Komagata, S. H¨ onl, M. Churaev, C. Skehan, H. Guo, R. N. Wang, J. Liu, P. Seidler, et al. , Emergent nonlinear phenomena in a driven dissipative photonic dimer, Nature Physics 17, 604 (2021)

work page 2021
[3]

Yelo-Sarri´ on, P

J. Yelo-Sarri´ on, P. Parra-Rivas, N. Englebert, C. M. Arab ´ ı, F. Leo, and S.-P. Gorza, Self-pulsing in driven- dissipative photonic bose-hubbard dimers, Physical Re- view Research 3, L042031 (2021)

work page 2021
[4]

Marandi, Z

A. Marandi, Z. Wang, K. Takata, R. L. Byer, and Y. Ya- mamoto, Network of time-multiplexed optical parametric oscillators as a coherent ising machine, Nature Photonics 8, 937 (2014)

2014
[5]

Parto, W

M. Parto, W. Hayenga, A. Marandi, D. N. Christodoulides, and M. Khajavikhan, Realizing spin hamiltonians in nanoscale active photonic lattices, Nature materials 19, 725 (2020)

work page 2020
[6]

Tusnin, A

A. Tusnin, A. Tikan, K. Komagata, and T. J. Kippen- berg, Nonlinear dynamics and kerr frequency comb for- mation in lattices of coupled microresonators, Communi- cations Physics 6, 317 (2023)

work page 2023
[7]

Okawachi, M

Y. Okawachi, M. Yu, J. K. Jang, X. Ji, Y. Zhao, B. Y. Kim, M. Lipson, and A. L. Gaeta, Demonstration of chip- based coupled degenerate optical parametric oscillators for realizing a nanophotonic spin-glass, Nature Commu- nications 11, 4119 (2020)

work page 2020
[8]

L. Yuan, Q. Lin, M. Xiao, and S. Fan, Synthetic dimen- sion in photonics, Optica 5, 1396 (2018)

work page 2018

Show all 51 references

[9]

Z. Yuan, M. Gao, Y. Yu, H. Wang, W. Jin, Q.-X. Ji, A. Feshali, M. Paniccia, J. Bowers, and K. Vahala, Soli- ton pulse pairs at multiple colours in normal dispersion microresonators, Nature Photonics 17, 977 (2023)

2023
[10]

Q.-X. Ji, P. Liu, W. Jin, J. Guo, L. Wu, Z. Yuan, J. Pe- ters, A. Feshali, M. Paniccia, J. E. Bowers, et al. , Mul- timodality integrated microresonators using the moir´ e speedup effect, Science 383, 1080 (2024)

2024
[11]

M. Gao, Z. Yuan, Y. Yu, W. Jin, Q.-X. Ji, J. Ge, A. Fes- hali, M. Paniccia, J. E. Bowers, and K. J. Vahala, Obser- vation of interband kelly sidebands in coupled-ring soli- ton microcombs, Optica 11, 940 (2024)

2024
[12]

A. Roy, R. Nehra, C. Langrock, M. Fejer, and A. Marandi, Non-equilibrium spectral phase transitions in coupled nonlinear optical resonators, Nature Physics 19, 427 (2023)

2023
[13]

A. Roy, M. Parto, R. Nehra, C. Leefmans, and A. Marandi, Topological optical parametric oscillation, Nanophotonics 11, 1611 (2022)

2022
[14]

C. R. Leefmans, M. Parto, J. Williams, G. H. Li, A. Dutt, F. Nori, and A. Marandi, Topological temporally mode- locked laser, Nature Physics , 1 (2024)

2024
[15]

C. R. Leefmans, N. Englebert, J. Williams, R. M. Gray, N. Goldman, S.-P. Gorza, F. Leo, and A. Marandi, Cav- ity soliton-induced topological edge states, arXiv preprint arXiv:2311.04873 (2023)

2023 arXiv
[16]

A. Roy, S. Jahani, Q. Guo, A. Dutt, S. Fan, M.-A. Miri, and A. Marandi, Nondissipative non-hermitian dynam- ics and exceptional points in coupled optical parametric oscillators, Optica 8, 415 (2021)

2021
[17]

A. C. Triscari, A. Tusnin, A. Tikan, and T. J. Kippen- berg, Quiet point engineering for low-noise microwave generation with soliton microcombs, Communications Physics 6, 318 (2023)

2023
[18]

Kudelin, W

I. Kudelin, W. Groman, Q.-X. Ji, J. Guo, M. L. Kelle- her, D. Lee, T. Nakamura, C. A. McLemore, P. Shirmo- hammadi, S. Hanifi, et al., Photonic chip-based low-noise microwave oscillator, Nature 627, 534 (2024)

2024
[19]

Scheuer, A

J. Scheuer, A. A. Sukhorukov, and Y. S. Kivshar, All- optical switching of dark states in nonlinear coupled mi- croring resonators, Optics Letters 35, 3712 (2010)

2010
[20]

Chen and D

F. Chen and D. Yao, Tunable multiple all-optical switch based on multi-nanoresonator-coupled waveguide sys- tems containing kerr material, Optics Communications 312, 143 (2014)

2014
[21]

Zhou and Y

X. Zhou and Y. Chong, Pt symmetry breaking and non- linear optical isolation in coupled microcavities, Optics Express 24, 6916 (2016)

2016
[22]

X. Zhou, Y. Wang, D. Leykam, and Y. D. Chong, Op- tical isolation with nonlinear topological photonics, New Journal of Physics 19, 095002 (2017)

2017
[23]

Yokoyama, R

S. Yokoyama, R. Ukai, S. C. Armstrong, C. Sornphiphat- phong, T. Kaji, S. Suzuki, J.-i. Yoshikawa, H. Yonezawa, 10 N. C. Menicucci, and A. Furusawa, Ultra-large-scale continuous-variable cluster states multiplexed in the time domain, Nature Photonics 7, 982 (2013)

2013
[24]

Asavanant, Y

W. Asavanant, Y. Shiozawa, S. Yokoyama, B. Charoen- sombutamon, H. Emura, R. N. Alexander, S. Takeda, J.-i. Yoshikawa, N. C. Menicucci, H. Yonezawa, et al. , Generation of time-domain-multiplexed two-dimensional cluster state, Science 366, 373 (2019)

2019
[25]

M. V. Larsen, X. Guo, C. R. Breum, J. S. Neergaard- Nielsen, and U. L. Andersen, Deterministic generation of a two-dimensional cluster state, Science 366, 369 (2019)

2019
[26]

Z. Wang, A. Marandi, K. Wen, R. L. Byer, and Y. Ya- mamoto, Coherent ising machine based on degenerate optical parametric oscillators, Physical Review A 88, 063853 (2013)

2013
[27]

Inagaki, K

T. Inagaki, K. Inaba, R. Hamerly, K. Inoue, Y. Ya- mamoto, and H. Takesue, Large-scale ising spin network based on degenerate optical parametric oscillators, Na- ture Photonics 10, 415 (2016)

2016
[28]

J. R. Basani, M. Heuck, D. R. Englund, and S. Kras- tanov, All-photonic artificial-neural-network processor via nonlinear optics, Physical Review Applied 22, 014009 (2024)

2024
[29]

Feldmann, N

J. Feldmann, N. Youngblood, C. D. Wright, H. Bhaskaran, and W. H. Pernice, All-optical spiking neurosynaptic networks with self-learning capabilities, Nature 569, 208 (2019)

2019
[30]

Makinwa, K

T. Makinwa, K. Inaba, T. Inagaki, Y. Yamada, T. Leleu, T. Honjo, T. Ikuta, K. Enbutsu, T. Umeki, R. Kasa- hara, et al. , Experimental observation of chimera states in spiking neural networks based on degenerate optical parametric oscillators, Communications Physics 6, 121 (2023)

2023
[31]

A. M. Turing, On computable numbers, with an appli- cation to the entscheidungsproblem, Proceedings of the London Mathematical Society s2-42, 230 (1937)

1937
[32]

Fredkin and T

E. Fredkin and T. Toffoli, Conservative logic, Interna- tional Journal of theoretical physics 21, 219 (1982)

1982
[33]

Moore, Unpredictability and undecidability in dynam- ical systems, Physical Review Letters 64, 2354 (1990)

C. Moore, Unpredictability and undecidability in dynam- ical systems, Physical Review Letters 64, 2354 (1990)

1990
[34]

N. C. da Costa and F. A. Doria, Undecidability and in- completeness in classical mechanics, International Jour- nal of Theoretical Physics 30, 1041 (1991)

1991
[35]

Tao, Finite time blowup for an averaged three- dimensional navier-stokes equation, Journal of the Amer- ican Mathematical Society 29, 601 (2016)

T. Tao, Finite time blowup for an averaged three- dimensional navier-stokes equation, Journal of the Amer- ican Mathematical Society 29, 601 (2016)

2016
[36]

Cardona, E

R. Cardona, E. Miranda, D. Peralta-Salas, and F. Presas, Constructing turing complete euler flows in dimension 3, Proceedings of the National Academy of Sciences 118, e2026818118 (2021)

2021
[37]

T. S. Cubitt, D. Perez-Garcia, and M. M. Wolf, Unde- cidability of the spectral gap, Nature 528, 207 (2015)

2015
[38]

Bausch, T

J. Bausch, T. S. Cubitt, and J. D. Watson, Uncom- putability of phase diagrams, Nature Communications 12, 452 (2021)

2021
[39]

Shiraishi and K

N. Shiraishi and K. Matsumoto, Undecidability in quan- tum thermalization, Nature Communications 12, 5084 (2021)

2021
[40]

Komar, Undecidability of macroscopically distinguish- able states in quantum field theory, Physical Review133, B542 (1964)

A. Komar, Undecidability of macroscopically distinguish- able states in quantum field theory, Physical Review133, B542 (1964)

1964
[41]

Tachikawa, Undecidable problems in quantum field theory, International Journal of Theoretical Physics 62, 199 (2023)

Y. Tachikawa, Undecidable problems in quantum field theory, International Journal of Theoretical Physics 62, 199 (2023)

2023
[42]

Geroch and J

R. Geroch and J. B. Hartle, Computability and physical theories, Foundations of Physics 16, 533 (1986)

1986
[43]

M. L. Minsky, Computation: Finite and Infinite Ma- chines (Prentice-Hall Englewood Cliffs, 1967)

1967
[44]

R. M. Gray, R. Sekine, L. Ledezma, G. H. Li, S. Zhou, A. Roy, M. Parto, and A. Marandi, Large-scale time- multiplexed nanophotonic parametric oscillators, arXiv preprint arXiv:2405.17355 (2024)

2024 arXiv
[45]

Ledezma, R

L. Ledezma, R. Sekine, Q. Guo, R. Nehra, S. Jahani, and A. Marandi, Intense optical parametric amplifica- tion in dispersion-engineered nanophotonic lithium nio- bate waveguides, Optica 9, 303 (2022)

2022
[46]

C. Wang, M. Zhang, X. Chen, M. Bertrand, A. Shams- Ansari, S. Chandrasekhar, P. Winzer, and M. Lonˇ car, In- tegrated lithium niobate electro-optic modulators operat- ing at cmos-compatible voltages, Nature 562, 101 (2018)

2018
[47]

H. T. Siegelmann and E. D. Sontag, On the computa- tional power of neural nets, in Proceedings of the fifth an- nual workshop on Computational learning theory (1992) pp. 440–449

1992
[48]

Reifenstein, S

S. Reifenstein, S. Kako, F. Khoyratee, T. Leleu, and Y. Yamamoto, Coherent ising machines with optical er- ror correction circuits, Advanced Quantum Technologies 4, 2100077 (2021)

2021
[49]

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, Physical Review Research 4, 013009 (2022)

2022
[50]

G. H. Li, R. Sekine, R. Nehra, R. M. Gray, L. Ledezma, Q. Guo, and A. Marandi, All-optical ultrafast relu func- tion for energy-efficient nanophotonic deep learning, Nanophotonics 12, 847 (2023)

2023
[51]

Yamamoto, K

Y. Yamamoto, K. Aihara, T. Leleu, K.-i. Kawarabayashi, S. Kako, M. Fejer, K. Inoue, and H. Takesue, Coherent ising machines—optical neural networks operating at the quantum limit, npj Quantum Information 3, 49 (2017)

2017

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.

[1] [1]

Zhang, C

M. Zhang, C. Wang, Y. Hu, A. Shams-Ansari, T. Ren, S. Fan, and M. Lonˇ car, Electronically programmable pho- tonic molecule, Nature Photonics 13, 36 (2019)

work page 2019

[2] [2]

Tikan, J

A. Tikan, J. Riemensberger, K. Komagata, S. H¨ onl, M. Churaev, C. Skehan, H. Guo, R. N. Wang, J. Liu, P. Seidler, et al. , Emergent nonlinear phenomena in a driven dissipative photonic dimer, Nature Physics 17, 604 (2021)

work page 2021

[3] [3]

Yelo-Sarri´ on, P

J. Yelo-Sarri´ on, P. Parra-Rivas, N. Englebert, C. M. Arab ´ ı, F. Leo, and S.-P. Gorza, Self-pulsing in driven- dissipative photonic bose-hubbard dimers, Physical Re- view Research 3, L042031 (2021)

work page 2021

[4] [4]

Marandi, Z

A. Marandi, Z. Wang, K. Takata, R. L. Byer, and Y. Ya- mamoto, Network of time-multiplexed optical parametric oscillators as a coherent ising machine, Nature Photonics 8, 937 (2014)

2014

[5] [5]

Parto, W

M. Parto, W. Hayenga, A. Marandi, D. N. Christodoulides, and M. Khajavikhan, Realizing spin hamiltonians in nanoscale active photonic lattices, Nature materials 19, 725 (2020)

work page 2020

[6] [6]

Tusnin, A

A. Tusnin, A. Tikan, K. Komagata, and T. J. Kippen- berg, Nonlinear dynamics and kerr frequency comb for- mation in lattices of coupled microresonators, Communi- cations Physics 6, 317 (2023)

work page 2023

[7] [7]

Okawachi, M

Y. Okawachi, M. Yu, J. K. Jang, X. Ji, Y. Zhao, B. Y. Kim, M. Lipson, and A. L. Gaeta, Demonstration of chip- based coupled degenerate optical parametric oscillators for realizing a nanophotonic spin-glass, Nature Commu- nications 11, 4119 (2020)

work page 2020

[8] [8]

L. Yuan, Q. Lin, M. Xiao, and S. Fan, Synthetic dimen- sion in photonics, Optica 5, 1396 (2018)

work page 2018