Hamiltonian quantum computation

Short description: Form of quantum computing

Hamiltonian quantum computation is a form of quantum computing. Unlike methods of quantum computation such as the adiabatic, measurement-based and circuit model where eternal control is used to apply operations on a register of qubits, Hamiltonian quantum computers operate without external control.

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. However, his model was not time-independent and local. 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. Superconducting qubits, Ultracold atoms and non-linear photonics have been proposed as potential experimental implementations of Hamiltonian quantum computers.

Definition

Given a list of quantum gates described as unitaries $U_1,U_2...U_k$, define a hamiltonian

$H=\sum _{i=1}^{k-1}|i+1⟩⟨i|\otimes U_{i+1}+|i⟩⟨i+1|\otimes U_{i+1}^{†}$

Evolving this Hamiltonian on a state $|{\varphi }_0⟩=|100..00⟩\otimes |{\psi }_0⟩$ composed of a clock register ( $|100..00⟩$) that constaines $k+1$ qubits and a data register ($|{\psi }_0⟩$) will output $|{\varphi }_k⟩=e^{-iHt}|{\varphi }_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 $U_1,U_2...U_k|{\psi }_0⟩$. The computation is complete and $|{\varphi }_k⟩=|000..01⟩\otimes U_1,U_2...U_k|{\psi }_0⟩$.

See also

• Adiabatic quantum computation
• One-way quantum computer