Entangling problem Hamiltonian for adiabatic quantum computation
From MaRDI portal
Publication:2095868
DOI10.1134/S1995080222100262OpenAlexW3009085780MaRDI QIDQ2095868
Publication date: 15 November 2022
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.09453
Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Computer science (68-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum stochastic optimization
- Anderson localization makes adiabatic quantum optimization fail
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Bounds for the adiabatic approximation with applications to quantum computation
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Complexity of Stoquastic Frustration-Free Hamiltonians
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Elimination of perturbative crossings in adiabatic quantum optimization
This page was built for publication: Entangling problem Hamiltonian for adiabatic quantum computation