Journal ArticleDOI
Quantum annealing with manufactured spins
Mark W. Johnson,M. H. S. Amin,Gildert Suzanne,Trevor Lanting,Firas Hamze,Neil G. Dickson,Richard Harris,Andrew J. Berkley,J. Johansson,Paul I. Bunyk,E. M. Chapple,C. Enderud,Jeremy P. Hilton,Kamran Karimi,E. Ladizinsky,N. Ladizinsky,T. Oh,I. Perminov,C. Rich,Murray C. Thom,E. Tolkacheva,C. J. S. Truncik,Sergey Uchaikin,J. Wang,B. Wilson,Geordie Rose +25 more
TLDR
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.Abstract:
Many interesting but practically intractable problems can be reduced to that of finding the ground state of a system of interacting spins. It is believed that the ground state of some naturally occurring spin systems can be effectively attained through a process called quantum annealing. Johnson et al. use quantum annealing to find the ground state of an artificial Ising spin system comprised of an array of eight superconducting flux qubits with programmable spin–spin couplings. With an increased number of spins, the system may provide a practical physical means to implement quantum algorithms, possibly enabling more effective approaches towards solving certain classes of hard combinatorial optimization problems. Many interesting but practically intractable problems can be reduced to that of finding the ground state of a system of interacting spins; however, finding such a ground state remains computationally difficult1. It is believed that the ground state of some naturally occurring spin systems can be effectively attained through a process called quantum annealing2,3. If it could be harnessed, quantum annealing might improve on known methods for solving certain types of problem4,5. However, physical investigation of quantum annealing has been largely confined to microscopic spins in condensed-matter systems6,7,8,9,10,11,12. Here we use quantum annealing to find the ground state of an artificial Ising spin system comprising an array of eight superconducting flux quantum bits with programmable spin–spin couplings. We observe a clear signature of quantum annealing, distinguishable from classical thermal annealing through the temperature dependence of the time at which the system dynamics freezes. Our implementation can be configured in situ to realize a wide variety of different spin networks, each of which can be monitored as it moves towards a low-energy configuration13,14. This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples. Moreover, with an increased number of spins, such a system may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.read more
Citations
More filters
Journal ArticleDOI
Quantum machine learning
Jacob Biamonte,Jacob Biamonte,Peter Wittek,Nicola Pancotti,Patrick Rebentrost,Nathan Wiebe,Seth Lloyd +6 more
TL;DR: The field of quantum machine learning explores how to devise and implement quantum software that could enable machine learning that is faster than that of classical computers.
Journal ArticleDOI
Ising formulations of many NP problems
TL;DR: This work collects and extends mappings to the Ising model from partitioning, covering and satisfiability, and provides Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21NP-complete problems.
Journal ArticleDOI
On-chip quantum simulation with superconducting circuits
TL;DR: Superconducting circuits exhibit behavior analogues to natural quantum entities, such as atom, ions and photons as mentioned in this paper, and large-scale arrays of such circuits hold the promise of providing a unique route to quantum simulation.
Journal ArticleDOI
A quantum engineer's guide to superconducting qubits
Philip Krantz,Philip Krantz,Morten Kjaergaard,Fei Yan,Terry P. Orlando,Simon Gustavsson,William D. Oliver +6 more
TL;DR: In this paper, the authors provide an introductory guide to the central concepts and challenges in the rapidly accelerating field of superconducting quantum circuits, including qubit design, noise properties, qubit control and readout techniques.
Journal ArticleDOI
Scalable Quantum Simulation of Molecular Energies
Peter O'Malley,Ryan Babbush,Ian D. Kivlichan,Jonathan Romero,Jarrod R. McClean,Rami Barends,Julian Kelly,Pedram Roushan,Andrew Tranter,Andrew Tranter,Nan Ding,Brooks Campbell,Yu Chen,Zijun Chen,Ben Chiaro,Andrew Dunsworth,Austin G. Fowler,Evan Jeffrey,Anthony Megrant,Josh Mutus,Charles Neil,Chris Quintana,Daniel Sank,Ted White,James Wenner,Amit Vainsencher,Peter V. Coveney,Peter J. Love,Hartmut Neven,Alán Aspuru-Guzik,John M. Martinis,John M. Martinis +31 more
TL;DR: In this paper, the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation is reported, where a programmable array of superconducting qubits is used to compute the energy surface of molecular hydrogen using two distinct quantum algorithms.
References
More filters
Journal ArticleDOI
Reducing the Dimensionality of Data with Neural Networks
TL;DR: In this article, an effective way of initializing the weights that allows deep autoencoder networks to learn low-dimensional codes that work much better than principal components analysis as a tool to reduce the dimensionality of data is described.
Journal ArticleDOI
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
TL;DR: For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.
Journal ArticleDOI
Quantum annealing in the transverse Ising model
TL;DR: In this article, the authors introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. But quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach.
Journal ArticleDOI
Manipulating the Quantum State of an Electrical Circuit
Denis Vion,Abdelhanin Aassime,Audrey Cottet,Philippe Joyez,Hugues Pothier,Cristian Urbina,Daniel Esteve,Michel Devoret +7 more
TL;DR: A superconducting tunnel junction circuit that behaves as a two-level atom that can be programmed with a series of microwave pulses and a projective measurement of the state can be performed by a pulsed readout subcircuit is designed and operated.
Journal ArticleDOI
On the computational complexity of Ising spin glass models
TL;DR: In a spin glass with Ising spins, the problems of computing the magnetic partition function and finding a ground state are studied and are shown to belong to the class of NP-hard problems, both in the two-dimensional case within a magnetic field, and in the three-dimensional cases.