Quadratic fermionic interactions yield effective Hamiltonians for adiabatic quantum computing

Abstract

Polynomially-large ground-state energy gaps are rare in many-body quantum systems, but useful for adiabatic quantum computing. We show analytically that the gap is generically polynomially-large for quadratic fermionic Hamiltonians. We then prove that adiabatic quantum computing can realize the ground states of Hamiltonians with certain random interactions, as well as the ground states of one, two, and three-dimensional fermionic interaction lattices, in polynomial time. Finally, we use the Jordan-Wigner transformation and a related transformation for spin-3/2 particles to show that our results can be restated using spin operators in a surprisingly simple manner. A direct consequence is that the one-dimensional cluster state can be found in polynomial time using adiabatic quantum computing.

14 pages

References in corpus (8)

• Matchgates and classical simulation of quantum circuits
• Adiabatic quantum algorithms as quantum phase transitions: first versus second order
• Ground state fidelity and quantum phase transitions in free Fermi systems
• Graph states as ground states of many-body spin-1/2 Hamiltonians
• Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
• Adiabatic preparation without Quantum Phase Transitions
• An Index Theorem for Graphene
• The adiabatic theorem in the presence of noise

Cited by in corpus (2)

• Symmetry Principles in Quantum Systems Theory
• A Dynamic Systems Approach to Fermions and Their Relation to Spins