Hamiltonian quantum computation

From testwiki
Jump to navigation Jump to search

Template:Short description Hamiltonian quantum computation is a form of quantum computing. Unlike methods of quantum computation such as the adiabatic, measurement-based and circuit model where external control is used to apply operations on a register of qubits, Hamiltonian quantum computers operate without external control.[1][2][3]

Background

Hamiltonian quantum computation was the pioneering model of quantum computation, first proposed by Paul Benioff in 1980. Benioff's motivation for building a quantum mechanical model of a computer was to have a quantum mechanical description of artificial intelligence and to create a computer that would dissipate the least amount of energy allowable by the laws of physics.[1] However, his model was not time-independent and local.[4] Richard Feynman, independent of Benioff, also wanted to provide a description of a computer based on the laws of quantum physics. He solved the problem of a time-independent and local Hamiltonian by proposing a continuous-time quantum walk that could perform universal quantum computation.[2] Superconducting qubits,[5] Ultracold atoms and non-linear photonics[6] have been proposed as potential experimental implementations of Hamiltonian quantum computers.

Definition

Given a list of quantum gates described as unitaries U1,U2...Uk, define a hamiltonian

H=∑i=1k−1|i+1⟩⟨i|⊗Ui+1+|i⟩⟨i+1|⊗Ui+1†

Evolving this Hamiltonian on a state |ϕ0⟩=|100..00⟩⊗|ψ0⟩ composed of a clock register ( |100..00⟩) that constaines k+1 qubits and a data register (|ψ0⟩) will output |ϕk⟩=e−iHt|ϕ0⟩. At a time t, the state of the clock register can be |000..01⟩. When that happens, the state of the data register will be U1,U2...Uk|ψ0⟩. The computation is complete and |ϕk⟩=|000..01⟩⊗U1,U2...Uk|ψ0⟩.[7]

See also

References

Template:Reflist Template:Quantum information