Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems
| dc.creator | Kaminsky, William M. | |
| dc.creator | Lloyd, Seth | |
| dc.date | 2002-11-23 | |
| dc.date.accessioned | 2026-07-07T06:05:35Z | |
| dc.date.available | 2026-07-07T06:05:35Z | |
| dc.description | We present a comprehensive review of past research into adiabatic quantum computation and then propose a scalable architecture for an adiabatic quantum computer that can treat NP-hard problems without requiring local coherent operations. Instead, computation can be performed entirely by adiabatically varying a magnetic field applied to all the qubits simultaneously. Local (incoherent) operations are needed only for: (1) switching on or off certain pairwise, nearest-neighbor inductive couplings in order to set the problem to be solved and (2) measuring some subset of the qubits in order to obtain the answer to the problem. | |
| dc.description | Extension of presentation at MQC2 Conference (Napoli, June 2002) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0211152 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0211152 | |
| dc.identifier | Quantum Computing & Quantum Bits in Mesoscopic Systems (Kluwer Academic 2003) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90681 | |
| dc.subject | Quantum Physics | |
| dc.title | Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems | |
| dc.type | text |