Scalable Superconducting Architecture for Adiabatic Quantum Computation
William M. Kaminsky, Seth Lloyd, Terry P. Orlando

TL;DR
This paper proposes a scalable superconducting architecture for adiabatic quantum computers that uses time-independent, nearest-neighbor couplings, capable of solving NP problems despite errors and noise.
Contribution
It introduces a novel architecture based on persistent-current qubits with inherent robustness to manufacturing imperfections and decoherence.
Findings
Architecture handles NP problems with noise and errors
Utilizes superconducting persistent-current qubits
Discusses implementation robustness
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
