Hamiltonian Quantum Cellular Automata in 1D

Details Hamiltonian Quantum Cellular Automata in 1D Hamiltonian Quantum Cellular Automata in 1D

2008-02-06

arxiv.org/abs/0802.0886v4

Phys. Rev. A 78, 032311 (2008)

Physics

Quantum Physics

explanation in Section II largely rewritten, 2 new figures, accepted for publication in PRA

Scientific paper

10.1103/PhysRevA.78.032311

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process. We only require the ability to prepare an initial computational basis state which encodes both the quantum circuit and its input. The computational process is then carried out by the autonomous Hamiltonian time evolution. After a time polynomially long in the size of the quantum circuit has passed, the result of the computation is obtained with high probability by measuring a few qudits in the computational basis. This result also implies that there cannot exist efficient classical simulation methods for generic translationally invariant nearest-neighbor Hamiltonians on qudit chains, unless quantum computers can be efficiently simulated by classical computers (or, put in complexity theoretic terms, unless BPP=BQP).

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364284