Abstract
The subject of this report is the comparison of the conventional deterministic computers versus the analogue computer based on the quantum optical system in resolving some NP-hard computational problems. We describe an optical machine which can be realized physically.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of Np-Completeness (W H Freeman & Co., 1979).
C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Inc., 1982).
Author information
Authors and Affiliations
Additional information
The text was submitted by the authors in English.