Adiabatic preparation without Quantum Phase Transitions

Abstract

Many physically interesting models show a quantum phase transition when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate. When this parameter appears as a coupling constant, these models can be understood as straight-line interpolations between different Hamiltonians $H_{\mathrm{I}}$ and $H_{\mathrm{F}}$. For finite-size realizations however, there will usually be a finite energy gap between ground and first excited state. By slowly changing the coupling constant through the point with the minimum energy gap one thereby has an adiabatic algorithm that prepares the ground state of $H_{\mathrm{F}}$ from the ground state of $H_{\mathrm{I}}$. The adiabatic theorem implies that in order to obtain a good preparation fidelity the runtime $\tau$ should scale with the inverse energy gap and thereby also with the system size. In addition, for open quantum systems not only non-adiabatic but also thermal excitations are likely to occur. It is shown that -- using only local Hamiltonians -- for the 1d quantum Ising model and the cluster model in a transverse field the conventional straight line path can be replaced by a series of straight-line interpolations, along which the fundamental energy gap is always greater than a constant independent on the system size. The results are of interest for adiabatic quantum computation since strong similarities between adiabatic quantum algorithms and quantum phase transitions exist.

9 pages, 4 figures, published version (references and remarks on implementation added, typos corrected)

References in corpus (31)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Mechanics helps in searching for a needle in a haystack
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Measurement-based quantum computation with cluster states
• Effective quantum spin systems with ion traps
• Ground state overlap and quantum phase transitions
• Dynamics of quantum phase transition: exact solution in quantum Ising model
• Quantum Search by Local Adiabatic Evolution
• Robustness of adiabatic quantum computation
• Bounds for the adiabatic approximation with applications to quantum computation
• Three-spin interactions in optical lattices and criticality in cluster Hamiltonians
• Entropy of entanglement and correlations induced by a quench: Dynamics of a quantum phase transition in the quantum Ising model
• Long-distance entanglement in spin systems
• On the entanglement entropy for a XY spin chain
• Quantum Holonomies for Quantum Computing
• Preservation of Positivity by Dynamical Coarse-Graining
• Strong-weak coupling self-duality in the two-dimensional quantum phase transition of $p+ip$ superconducting arrays
• Adiabatic quantum algorithms as quantum phase transitions: first versus second order
• Universality of Entanglement and Quantum Computation Complexity
• A simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation
• General error estimate for adiabatic quantum computing
• Exponential complexity of an adiabatic algorithm for an NP-complete problem
• Adiabatic quantum computation and quantum phase transitions
• Robustness of adiabatic passage trough a quantum phase transition
• Adiabatic Quantum Transport in a Spin Chain with a Moving Potential
• Simulation of many-qubit quantum computation with matrix product states
• Scaling of running time of quantum adiabatic algorithm for propositional satisfiability
• Computational Difficulty of Global Variations in the Density Matrix Renormalization Group
• Decoherence in the dynamical quantum phase transition of the transverse Ising chain
• Adiabatic Rotation, Quantum Search and Preparation of Superposition States
• A relation between fidelity and quantum adiabatic evolution

Cited by in corpus (25)

• Adiabatic Quantum Computing
• Dynamics of a Quantum Phase Transition and Relaxation to a Steady State
• Long-range interacting quantum systems
• Quantum Adiabatic Brachistochrone
• First Order Quantum Phase Transition in Adiabatic Quantum Computation
• Intrinsic geometry of quantum adiabatic evolution and quantum phase transitions
• Accuracy vs run time in adiabatic quantum search
• Dynamics of an inhomogeneous quantum phase transition
• Adiabatic Gate Teleportation
• Dissipation in adiabatic quantum computers: Lessons from an exactly solvable model
• Dynamical critical scaling and effective thermalization in quantum quenches: the role of the initial state
• Relaxation vs. adiabatic quantum steady state preparation: which wins?
• Inhomogeneous quasi-adiabatic driving of quantum critical dynamics in weakly disordered spin chains
• Adiabatic Cluster State Quantum Computing
• Adiabatic dynamics of an inhomogeneous quantum phase transition: the case of z > 1 dynamical exponent
• Dynamics of a quantum phase transition with decoherence: the quantum Ising chain in a static spin environment
• High-fidelity non-adiabatic cutting and stitching of a spin chain via local control
• Deep recurrent networks predicting the gap evolution in adiabatic quantum computing
• Quantum search using non-Hermitian adiabatic evolution
• Decoherence in a dynamical quantum phase transition
• Probing nonlinear adiabatic paths with a universal integrator
• Quadratic fermionic interactions yield effective Hamiltonians for adiabatic quantum computing
• Many-body thermal states on a quantum computer: a variational approach
• Saving resources through repeat-until-success positive-operator-valued-measure measurements in quantum computation
• Duality in spin systems via the $SU(4)$ algebra