Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems

Details Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems

2002-11-23

arxiv.org/abs/quant-ph/0211152v1

Quantum Computing & Quantum Bits in Mesoscopic Systems (Kluwer Academic 2003)

Physics

Quantum Physics

Extension of presentation at MQC2 Conference (Napoli, June 2002)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-79855