Universal quantum walks and adiabatic algorithms by 1D Hamiltonians

Details Universal quantum walks and adiabatic algorithms by 1D Hamiltonians Universal quantum walks and adiabatic algorithms by 1D Hamiltonians

2008-02-08

arxiv.org/abs/0802.1207v1

Physics

Quantum Physics

14 pages

Scientific paper

We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a continuous-time quantum walk or by terminating an adiabatic algorithm. In either case, the universality property can be understood as arising from an efficient simulation of a programmable quantum circuit. Using gadget perturbation theory, one can demonstrate the same kind of universality for related Hamiltonian families acting on qubits in 2D. Our results demonstrate that simulating 1D chains of spin-7/2 particles is BQP-hard, and indeed BQP-complete because the outputs of decision problems can be encoded in the outputs of such simulations.

Affiliated with

Also associated with

No associations

Rating

Universal quantum walks and adiabatic algorithms by 1D Hamiltonians 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 Universal quantum walks and adiabatic algorithms by 1D Hamiltonians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal quantum walks and adiabatic algorithms by 1D Hamiltonians will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-402531