Entangling problem Hamiltonian for adiabatic quantum computation
Oleg Lychkovskiy

TL;DR
This paper introduces a novel approach to constructing problem Hamiltonians in adiabatic quantum computation that entangles excited states while keeping the ground state separable, potentially enhancing computational performance.
Contribution
It demonstrates how to design non-diagonal, entangling problem Hamiltonians that preserve the solution in the ground state, offering a new perspective for improving adiabatic quantum algorithms.
Findings
Entangling excited states can improve adiabatic quantum computation.
Constructed Hamiltonians maintain a product ground state.
Potential performance benefits in quantum algorithms.
Abstract
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, , is normally chosen to be diagonal in the computational basis, that is a product basis for qubits. We point out that can be chosen to be non-diagonal in the computational basis. To be more precise, we show how to construct in such a way that all its excited states are entangled with respect to the qubit tensor product structure, while the ground state is still of the product form and encodes the solution to the problem. We discuss how such entangling problem Hamiltonians can improve the performance of the adiabatic quantum computation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
