Hamiltonian quantum computation
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. [1] [2] [3]
Background
[edit]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
[edit]Given a list of quantum gates described as unitaries , define a hamiltonian
Evolving this Hamiltonian on a state composed of a clock register ( ) that constaines qubits and a data register () will output . At a time , the state of the clock register can be . When that happens, the state of the data register will be . The computation is complete and .[7]
See also
[edit]References
[edit]- ^ a b Benioff Paul (1980). "The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines". Journal of Statistical Physics. 22 (5): 563–591. doi:10.1007/BF01011339.
- ^ a b Feynman, Richard P. (1986). "Quantum mechanical computers". Foundations of Physics. 16 (6): 507–531. doi:10.1007/BF01886518.
- ^ Janzing, Dominik (2007). "Spin-1∕2 particles moving on a two-dimensional lattice with nearest-neighbor interactions can realize an autonomous quantum computer". Physical Review A. 75 (1): 012307. arXiv:quant-ph/0506270. doi:10.1103/PhysRevA.75.012307.
- ^ LLoyd, Seth (1993). "Review of quantum computation". Vistas in Astronomy. 37: 291–295. doi:10.1016/0083-6656(93)90051-K.
- ^ Ciani, A.; Terhal, B. M.; DiVincenzo, D. P. (2019). "Hamiltonian quantum computing with superconducting qubits". IOP Publishing. 4 (3): 035002. arXiv:1310.5100. doi:10.1088/2058-9565/ab18dd.
- ^ Lahini, Yoav; Steinbrecher, Gregory R.; Bookatz, Adam D.; Englund, Dirk (2018). "Quantum logic using correlated one-dimensional quantum walks". npj Quantum Information. 4 (1): 2. arXiv:1501.04349. doi:10.1038/s41534-017-0050-2.
- ^ Costales, R. J.; Gunning, A.; Dorlas, T. (2025). "Efficiency of Feynman's quantum computer". Physical Review A. 111 (2): 022615. arXiv:2309.09331. doi:10.1103/PhysRevA.111.022615.