We show a significant reduction of errors for an architecture of quantum annealers where bosonic modes mediate the interaction between qubits. These systems have a large redundancy in the subspace of solutions, supported by arbitrarily large bosonic occupations. We explain how this redundancy leads to a mitigation of errors when the bosonic modes operate in the ultrastrong coupling regime. Numerical simulations also predict a large increase of qubit coherence for a specific annealing problem with mediated interactions. We provide evidence that noise reduction occurs in more general types of quantum computers with similar architectures.
We show that quantum diffusion near a quantum critical point can provide an efficient mechanism of quantum annealing. It is based on the diffusion-mediated recombination of excitations in open systems far from thermal equilibrium. We find that, for an Ising spin chain coupled to a bosonic bath and driven by a monotonically decreasing transverse field, excitation diffusion sharply slows down below the quantum critical region. This leads to spatial correlations and effective freezing of the excitation density. Still, obtaining an approximate solution of an optimization problem via the diffusion-mediated quantum annealing can be faster than via closed-system quantum annealing or Glauber dynamics.
Preparing ground states of Hamiltonians is important in the condensed matter physics and the quantum chemistry. The interaction Hamiltonians typically contain not only diagonal but also off-diagonal elements. Although quantum annealing provides a way to prepare a ground state of a Hamiltonian, we can only use the Hamiltonian with Ising interaction by using currently available commercial quantum annealing devices. In this work, we propose a quantum annealing for the XXZ model, which contains both Ising interaction and energy-exchange interaction, by using inductively coupled superconducting flux qubits. The key idea is to use a recently proposed spin-lock quantum annealing where the qubits are driven by microwave fields. As long as the rotating wave approximation is valid, the inductive coupling between the superconducting flux qubits produces the desired Hamiltonian in the rotating frame, and we can use such an interaction for the quantum annealing while the microwave fields driving play a role of the transverse fields. To quantify the performance of our scheme, we implement numerical simulations, and show that we can prepare ground states of the two-dimensional Heisenberg model with a high fidelity.
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach. The idea is tested by the transverse Ising model, in which the transverse field is a function of time similar to the temperature in the conventional method. The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible. We have solved the time-dependent Schr\"odinger equation numerically for small size systems with various exchange interactions. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum annealing leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule.
Quantum particle statistics fundamentally controls the way particles interact and plays an essential role in determining the properties of the system at low temperature. Here we study how the quantum statistics affects the computational power of quantum annealing. We propose an annealing Hamiltonian describing quantum particles moving on a square lattice and compare the computational performances of the atomic quantum annealers between two statistically different components: spinless fermions and hard-core bosons. In addition, we take an Ising quantum annealer driven by traditional transverse-field quantum fluctuations as a baseline. The potential of our quantum annealers to solve combinatorial optimization problems is demonstrated on random 3-regular graph partitioning. We find that the bosonic quantum annealer outperforms the fermionic case. The superior performance of the bosonic quantum annealer is attributed to larger excitation gaps and the consequent smoother adiabatic transformation of its instantaneous quantum ground states. Along our annealing schedule, the bosonic quantum annealer is less affected by the glass order and explores the Hilbert space more efficiently. Our theoretical finding could shed light on constructing atomic quantum annealers using Rydberg atoms in optical lattices.
Quantum annealing is a promising form of quantum computation, but it slows down at a small energy gap
Δ during the anneal, and the errors it makes there remain undetected. We introduce cavity quantum annealing, in which a cavity mode of frequency
O(1)≫Δ, coupled mid-schedule, swaps these errors into photons. In the
p-spin model, this reduces the annealing time to nearly the square root of that required without the cavity. Moreover, counting the photons certifies the result: high-photon runs, with an
O(1) yield, reach a ground-state fidelity above
99.99% orders of magnitude sooner, a gain that grows exponentially with system size. A pre-loaded photon instead runs the swap in reverse, preparing an excited state. More broadly, our work shows that cavities can enhance computations performed with qubits, paving the way toward high-fidelity quantum state preparation by quantum annealing.