The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Combinatorial optimization problems are ubiquitous but difficult to solve. Hardware devices for these problems have recently been developed by various approaches, including quantum computers. Inspired by recently proposed quantum adiabatic optimization using a nonlinear oscillator network, we propose a new optimization algorithm simulating adiabatic evolutions of classical nonlinear Hamiltonian systems exhibiting bifurcation phenomena, which we call simulated bifurcation (SB). SB is based on adiabatic and chaotic (ergodic) evolutions of nonlinear Hamiltonian systems. SB is also suitable for parallel computing because of its simultaneous updating. Implementing SB with a field-programmable gate array, we demonstrate that the SB machine can obtain good approximate solutions of an all-to-all connected 2000-node MAX-CUT problem in 0.5 ms, which is about 10 times faster than a state-of-the-art laser-based machine called a coherent Ising machine. SB will accelerate large-scale combinatorial optimization harnessing digital computer technologies and also offer a new application of computational and mathematical physics.

Quickly obtaining optimal solutions of combinatorial optimization problems has tremendous value but is extremely difficult. Thus, various kinds of machines specially designed for combinatorial optimization have recently been proposed and developed. Toward the realization of higher-performance machines, here, we propose an algorithm based on classical mechanics, which is obtained by modifying a previously proposed algorithm called simulated bifurcation. Our proposed algorithm allows us to achieve not only high speed by parallel computing but also high solution accuracy for problems with up to one million binary variables. Benchmarking shows that our machine based on the algorithm achieves high performance compared to recently developed machines, including a quantum annealer using a superconducting circuit, a coherent Ising machine using a laser, and digital processors based on various algorithms. Thus, high-performance combinatorial optimization is realized by massively parallel implementations of the proposed algorithm based on classical mechanics.

It has recently been shown that a parametrically driven oscillator with Kerr nonlinearity yields a Schrödinger cat state via quantum adiabatic evolution through its bifurcation point and a network of such nonlinear oscillators can be used for solving combinatorial optimization problems by bifurcation-based adiabatic quantum computation [H. Goto, Sci. Rep. 6, 21686 (2016)]. Here we theoretically show that such a nonlinear oscillator network with controllable parameters can also be used for universal quantum computation. The initialization is achieved by a quantum-mechanical bifurcation based on quantum adiabatic evolution, which yields a Schrödinger cat state. All the elementary quantum gates are also achieved by quantum adiabatic evolution, in which dynamical phases accompanying the adiabatic evolutions are controlled by the system parameters. Numerical simulation results indicate that high gate fidelities can be achieved, where no dissipation is assumed.PACS numbers: 03.67. Lx, Introduction. The standard model for quantum computation consists of quantum bits (qubits) and quantum gates [1] as present-day digital computers consist of bits and logic gates. A qubit is often represented by two discrete quantum states of various physical systems, such as electron or nuclear spins in neutral atoms, ions, molecules, or solids, polarization states or optical modes of single photons, and superconducting artificial atoms with Josephson junctions [2]. Another kind of implementation of a qubit uses a harmonic oscillator, which is described by an infinite-dimensional Hilbert space. In this case, the two computational basis states are defined as two orthogonal states of a harmonic oscillator, such as two coherent states with largely different amplitudes or two cat states with opposite parity [3]. It is known that a universal gate set for such coherent-state qubits can be achieved by gate teleportation with cat states [4,5]. Recently, universal quantum computation with harmonic oscillators accompanied by nonlinear losses has also been proposed [6,7]. Recent advances in circuit quantum electrodynamics with superconducting devices [8,9] make the proposals promising.

Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum superpositions of coherent states, such as Schrödinger cat states. Therefore, these quantum computers are referred to as "quantum bifurcation machines (QbMs)." QbMs can be used for qauntum adiabatic optimization and universal quantum computation. Superconducting circuits with Josephson junctions, Josephson parametric oscillators (JPOs) in particular, are promising for physical implementation of KPOs. Thus, KPOs and QbMs offer not only a new path toward the realization of quantum bits (qubits) and quantum computers, but also a new application of JPOs. Here we theoretically explain the physics of KPOs and QbMs, comparing them with their dissipative counterparts. Their physical implementations with superconducting circuits are also presented.

We numerically study reservoir computing on a spin-torque oscillator (STO) array, describing magnetization dynamics of the STO array by a nonlinear oscillator model. The STOs exhibit synchronized oscillation due to coupling by magnetic dipolar fields. We show that the reservoir computing can be performed by using the synchronized oscillation state. Its performance can be improved by increasing the number of the STOs. The performance becomes the highest at the boundary between the synchronized and disordered states. Using the STO array, we can achieve higher performance than an echo-state network with similar number of units. This result indicates that the STO array is promising for hardware implementation of reservoir computing.

The second-order intensity correlation function for the light transmitted from a driven optical cavity containing identical two-level atoms is calculated in the weak-field limit by using the equations for expectation values of operators. Atomic nonradiative dephasing is taken into account in addition to cavity-field damping and atomic radiative decay. The correlation function including the atomic nonradiative dephasing rate is numerically calculated. An analytic expression for the correlation function is also derived in the case of purely radiative atomic decay.

The seven-qubit quantum error-correcting code originally proposed by Steane is one of the best known quantum codes. The Steane code has a desirable property that most basic operations can be performed easily in a fault-tolerant manner. A major obstacle to fault-tolerant quantum computation with the Steane code is fault-tolerant preparation of encoded states, which requires large computational resources. Here we propose efficient state preparation methods for zero and magic states encoded with the Steane code, where the zero state is one of the computational basis states and the magic state allows us to achieve universality in fault-tolerant quantum computation. The methods minimize resource overheads for the fault-tolerant state preparation, and therefore reduce necessary resources for quantum computation with the Steane code. Thus, the present results will open a new possibility for efficient fault-tolerant quantum computation.