2026-07-24T00:04:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4324 2024-03-06T10:34:49Z ddc:004 open_access

Realistic Cost for the Model of Coherent Computing SaiToh, Akira Reliability Laser-network computing Computational complexity For the model of so-called coherent computing recently proposed by Yamamoto et al. [Y. Yamamoto et al., New Gen. Comput. 30 (2012) 327-355], a theoretical analysis of the success probability is given. Although it was claimed as their prospect that the Ising spin configuration problem would be efficiently solvable in the model, here it is shown that the probability of finding a desired spin configuration decreases exponentially in the number of spins for certain hard instances. The model is thus physically unfeasible for solving the problem within a polynomial cost. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Akira SaiToh 2013 Is Part Of LIPIcs, Volume 22, 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TQC.2013.244 urn:nbn:de:0030-drops-43249 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.244 eng https://creativecommons.org/licenses/by/3.0/legalcode