Quantum computation and quantum information
Quantum computation and quantum information
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Complexity of the Local Hamiltonian Problem
SIAM Journal on Computing
Programmable Hamiltonian for One-way Patterns
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of Stoquastic Frustration-Free Hamiltonians
SIAM Journal on Computing
Hi-index | 0.00 |
We use elementary variational arguments to prove, and improve on, gap estimates which arise in simulating quantum circuits by adiabatic evolution.