Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians

Details Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians

2009-08-28

arxiv.org/abs/0908.4219v3

Journal of Mathematical Physics, 51 (6), 062201 (2010)

Physics

Quantum Physics

Added references to work by de Falco et al., and realized that Feynman's '85 paper already contained the idea of a switch in i

Scientific paper

We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build on Feynman's Hamiltonian computer idea and use a railroad-switch type clock register. The resources required to simulate a quantum circuit with L gates in this model are O(L) small-dimensional quantum systems (qubits or qutrits), a time-independent Hamiltonian composed of O(L) local, constant norm, projector terms, the possibility to prepare computational basis product states, a running time O(L log^2 L), and the possibility to measure a few qubits in the computational basis. Our models also give a simplified proof of the universality of 3-local Adiabatic Quantum Computation.

Affiliated with

Also associated with

No associations

Rating

Fast Universal Quantum Computation with Railroad-switch Local 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 Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193736