Quantum simulators, continuous-time automata, and translationally invariant systems

Details Quantum simulators, continuous-time automata, and translationally invariant systems Quantum simulators, continuous-time automata, and translationally invariant systems

2007-04-25

arxiv.org/abs/0704.3432v2

Phys. Rev. Lett. 100, 010501 (2008)

Physics

Quantum Physics

partily rewritten and important references included

Scientific paper

10.1103/PhysRevLett.100.010501

The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum computer can be built in a 1D chain with a fixed, translationally invariant Hamitonian consisting of nearest--neighbor interactions only. The result of the computation is obtained after a prescribed time with high probability.

Affiliated with

Also associated with

No associations

Rating

Quantum simulators, continuous-time automata, and translationally invariant systems 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 Quantum simulators, continuous-time automata, and translationally invariant systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum simulators, continuous-time automata, and translationally invariant systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-707656