4.2 Article

Quantum Computing vs. Coherent Computing

Journal

NEW GENERATION COMPUTING
Volume 30, Issue 4, Pages 327-355

Publisher

SPRINGER
DOI: 10.1007/s00354-012-0403-5

Keywords

Fault-tolerant quantum computing; topological surface code; factoring algorithm; phase estimation algorithm; Ising model; injection-locked laser network

Funding

  1. JSPS through FIRST program
  2. DARPA
  3. NICT
  4. Grants-in-Aid for Scientific Research [12J07264] Funding Source: KAKEN

Ask authors/readers for more resources

In this review article, we compare the performance of two computing systems: quantum computing and coherent computing. A layered architecture for circuit-model quantum computing, employing surface code quantum error correction, has been recently discussed. Using this concrete hardware platform, it is possible to provide resource analysis for executing the fault-tolerent quantum computing for prime number factoring and molecular eigen-energy calculation that cannot be solved by the present day computing systems. A particular quantum computing system could solve such problems on the time scale of 1-10 days by using 10(8) - 10(9) physical qubits. We discuss an alternative computing system based on an injection-locked laser network wnicn is called a coherent computing system here. A three-dimensional Ising model is mapped onto the mutually injection-locked slave laser network, while the independent injection signal from a master laser implements a Zeeman Hamiltonian. In this computing system, an Ising spin taking either up or down state is represented by the polarization degrees of freedom, right or left circular polarizations, of the lasing photons in each slave laser. A spin-spin coupling coefficient is implemented by simple linear polarization optics connecting the two slave lasers. We numerically study the scaling law of the proposed machine against the anti-ferromagnetic Ising model with varying problem size M. A transient time to reach a steady state polarization configuration is inversely proportional to the locking bandwidth and does not depend on the problem size strongly up to M=1000.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available