Scalable Superconducting Architecture for Adiabatic Quantum Computation
arXiv:quant-ph/0403090
Abstract
A scalable superconducting architecture for adiabatic quantum computers is proposed. The architecture is based on time-independent, nearest-neighbor interqubit couplings: it can handle any problem in the class NP even in the presence of measurement errors, noise, and decoherence. The implementation of this architecture with superconducting persistent-current qubits and the natural robustness of such an implementation to manufacturing imprecision and decoherence are discussed.
v1: 5 pages, 2 figures, RevTeX4 v2: 4 pages, 2 figures, RevTeX4. Submitted to PRL. Minor prose changes to fit in space limit. No changes in results or conclusions. Acknowledgement to DARPA QuIST program added
References in corpus (6)
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- A Superconducting Persistent Current Qubit
- Theory of Quantum Annealing of an Ising Spin Glass
- Robustness of adiabatic quantum computation
- Noise resistance of adiabatic quantum computation using random matrix theory
- Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
Cited by in corpus (14)
- Simulating chemistry using quantum computers
- Error corrected quantum annealing with hundreds of qubits
- A scalable control system for a superconducting adiabatic quantum optimization processor
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
- Adiabatic quantum computation with flux qubits, first experimental results
- Multi-qubit quantum computing using discrete-time quantum walks on closed graphs
- Anneal-path correction in flux qubits
- Modernizing Quantum Annealing II: Genetic algorithms with the Inference Primitive Formalism
- Permutational Quantum Computing
- Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem
- Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
- High-performance Energy Minimization with Applications to Adiabatic Quantum Computing
- Liquid State Machines in Adbiatic Quantum Computers for General Computation