No Arabic abstract
In the quest to reboot computing, quantum annealing (QA) is an interesting candidate for a new capability. While it has not demonstrated an advantage over classical computing on a real-world application, many important regions of the QA design space have yet to be explored. In IARPAs Quantum Enhanced Optimization (QEO) program, we have opened some new lines of inquiry to get to the heart of QA, and are designing testbed superconducting circuits and conducting key experiments. In this paper, we discuss recent experimental progress related to one of the key design dimensions: qubit coherence. Using MIT Lincoln Laboratorys qubit fabrication process and extending recent progress in flux qubits, we are implementing and measuring QA-capable flux qubits. Achieving high coherence in a QA context presents significant new engineering challenges. We report on techniques and preliminary measurement results addressing two of the challenges: crosstalk calibration and qubit readout. This groundwork enables exploration of other promising features and provides a path to understanding the physics and the viability of quantum annealing as a computing resource.
We present a generalization of the binary paint shop problem (BPSP) to tackle an automotive industry application, the multi-car paint shop (MCPS) problem. The objective of the optimization is to minimize the number of color switches between cars in a paint shop queue during manufacturing, a known NP-hard problem. We distinguish between different sub-classes of paint shop problems, and show how to formulate the basic MCPS problem as an Ising model. The problem instances used in this study are generated using real-world data from a factory in Wolfsburg, Germany. We compare the performance of the D-Wave 2000Q and Advantage quantum processors to other classical solvers and a hybrid quantum-classical algorithm offered by D-Wave Systems. We observe that the quantum processors are well-suited for smaller problems, and the hybrid algorithm for intermediate sizes. However, we find that the performance of these algorithms quickly approaches that of a simple greedy algorithm in the large size limit.
Quantum annealing is an optimization technique which potentially leverages quantum tunneling to enhance computational performance. Existing quantum annealers use superconducting flux qubits with short coherence times, limited primarily by the use of large persistent currents $I_mathrm{p}$. Here, we examine an alternative approach, using qubits with smaller $I_mathrm{p}$ and longer coherence times. We demonstrate tunable coupling, a basic building block for quantum annealing, between two flux qubits with small ($sim 50~mathrm{nA}$) persistent currents. Furthermore, we characterize qubit coherence as a function of coupler setting and investigate the effect of flux noise in the coupler loop on qubit coherence. Our results provide insight into the available design space for next-generation quantum annealers with improved coherence.
New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule. To derive this conclusion, the asymptotic form of the excitation probability for quantum annealing is explicitly obtained in the limit of long annealing time. Its first-order term, which is inversely proportional to the square of the annealing time, is shown to be determined only by the information at the initial and final times. Our annealing schedules make it possible to drop this term, thus leading to a higher order (smaller) excitation probability. We verify these results by solving numerically the time-dependent Schrodinger equation for small size systems
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent state space has been proposed theoretically and realized experimentally. However, due to the inherent characteristics of coherent states, it is challenging to control the number of photons when we need the coherent space to be a nearly orthogonal space in practice. Here, we demonstrate that the nonorthogonality of coherent sates, on the one hand can be cancelled by multiple measurement, on the other hand, it is useful resource to characterize the nature of the system. Thus the number of photons of the system is controllable. We first present a feasible scheme to measure the wave function of quantum walks. Then we show that the expected number of photons of the coherent space is good observable to represent topological properties of the system, which reflected the advantage of coherent state space quantum walks. In addition, we propose an experimental protocol in a circuit quantum electrodynamics architecture, where a superconducting qubit is a coin while the cavity mode is used for quantum walk.
We present a general error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. Given any Ising model optimization problem, the encoding replaces each logical qubit by a complete graph of degree $C$, representing the distance of the error-correcting code. A subsequent minor-embedding step then implements the encoding on the underlying hardware graph of the quantum annealer. We demonstrate experimentally that the performance of a D-Wave Two quantum annealing device improves as $C$ grows. We show that the performance improvement can be interpreted as arising from an effective increase in the energy scale of the problem Hamiltonian, or equivalently, an effective reduction in the temperature at which the device operates. The number $C$ thus allows us to control the amount of protection against thermal and control errors, and in particular, to trade qubits for a lower effective temperature that scales as $C^{-eta}$, with $eta leq 2$. This effective temperature reduction is an important step towards scalable quantum annealing.