Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction

Abstract

We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a function of time to simulate the quantum circuit. We bound the eigenvalue gap above the unique groundstate by mapping our model onto the ferromagnetic XXZ chain with kink boundary conditions; the gap of this spin chain was computed exactly by Koma and Nachtergaele using its $q$-deformed version of SU(2) symmetry. We also discuss a related time-independent Hamiltonian which was shown by Janzing to be capable of universal computation. We observe that in the limit of large system size, the time evolution is equivalent to the exactly solvable quantum walk on Young's lattice.

References in corpus (7)

• Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Hamiltonian gadgets with reduced resource requirements
• Ground State Quantum Computation
• Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
• Space-Time Circuit-to-Hamiltonian Construction and Its Applications

Cited by in corpus (30)

• Adiabatic Quantum Computing
• Quantum Computational Supremacy
• Decoherence in adiabatic quantum computation
• Quantum Hamiltonian Complexity
• Direct certification of a class of quantum simulations
• Nested Quantum Annealing Correction
• Mean Field Analysis of Quantum Annealing Correction
• Dynamical structure factors of dynamical quantum simulators
• The Feynman-Kitaev computer's clock: bias, gaps, idling and pulse tuning
• Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
• Adiabatic Decoherence-Free Subspaces and its Shortcuts
• Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
• The Complexity of Translationally-Invariant Spin Chains with Low Local Dimension
• Quantum Language Processing
• Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
• Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
• Customized quantum annealing schedules
• Hamiltonian quantum computing with superconducting qubits
• Effects of non-Markovian squeezed bath on the dynamics of open systems
• The pair-flip model: a very entangled translationally invariant spin chain
• Phase transitions in the frustrated Ising ladder with stoquastic and nonstoquastic catalysts
• Quantum advantage from energy measurements of many-body quantum systems
• Proof of efficient, parallelized, universal adiabatic quantum computation
• Efficient optimization of perturbative gadgets
• Quantumness and the role of locality on quantum correlations
• Measurement-driven quantum computing: Performance of a 3-SAT solver
• A measure for adiabatic contributions to quantum transitions
• Superposition of Macroscopically Distinct States in Adiabatic Quantum Computation
• Pinned QMA: The power of fixing a few qubits in proofs
• Improving adiabatic quantum factorization via chopped random-basis optimization