Universal quantum computation in thermal equilibrium
APA
(2018). Universal quantum computation in thermal equilibrium. Perimeter Institute. https://pirsa.org/18010085
MLA
Universal quantum computation in thermal equilibrium. Perimeter Institute, Jan. 24, 2018, https://pirsa.org/18010085
BibTex
@misc{ pirsa_PIRSA:18010085, doi = {10.48660/18010085}, url = {https://pirsa.org/18010085}, author = {}, keywords = {Quantum Information}, language = {en}, title = {Universal quantum computation in thermal equilibrium}, publisher = {Perimeter Institute}, year = {2018}, month = {jan}, note = {PIRSA:18010085 see, \url{https://pirsa.org}} }
Adiabatic quantum computation (AQC) is a method for performing universal quantum computation in the ground state of a slowly evolving local Hamiltonian, and in an ideal setting AQC is known to capture all of the computational power of the quantum circuit model. However, despite having an inherent robustness to noise as a result of the adiabatic theorem and the spectral gap of the Hamiltonian, it has been a longstanding theoretical challenge to show that fault-tolerant AQC can in principle be performed below some fixed noise threshold. There are many aspects to this challenge, including the difficulty of adapting known ideas from circuit model fault-tolerance as well as the need to develop an error model that is appropriately tailored for open system AQC. In this talk I will introduce a scheme for combining Feynman-Kitaev history state Hamiltonians with topological quantum error correction, in order to show that universal quantum computation can be encoded not only in the ground state but also in the finite temperature Gibbs state of a local Hamiltonian. Using only local interactions with bounded strength and a polynomial overhead in the number of qubits, the scheme is intended to serve as a proof of principle that universal AQC can be performed at non-zero temperature, and also to further our understanding of the complexity of highly entangled quantum systems in thermal equilibrium.