Universal 2-local Hamiltonian Quantum Computing

Details Universal 2-local Hamiltonian Quantum Computing Universal 2-local Hamiltonian Quantum Computing

2010-02-02

arxiv.org/abs/1002.0420v2

Phys. Rev. A 85, 032330 (2012)

Physics

Quantum Physics

recomputed the necessary number of interactions, new geometric layout, added references

Scientific paper

We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local qubit-qubit interaction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits. The computer runs in three steps - starts in a simple initial product-state, evolves it for time of order L^2 (up to logarithmic factors) and wraps up with a two-qubit measurement. Our model differs from the previous universal 2-local Hamiltonian constructions in that it does not use perturbation gadgets, does not need large energy penalties in the Hamiltonian and does not need to run slowly to ensure adiabatic evolution.

Affiliated with

Also associated with

No associations

Rating

Universal 2-local Hamiltonian Quantum Computing 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 2-local Hamiltonian Quantum Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal 2-local Hamiltonian Quantum Computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706394