Efficient optimization of perturbative gadgets
arXiv:1709.02705 · doi:10.26421/QIC17.9-10
Abstract
Perturbative gadgets are general techniques for reducing many-body spin interactions to two-body ones using perturbation theory. This allows for potential realization of effective many-body interactions using more physically viable two-body ones. In parallel with prior work (arXiv:1311.2555 [quant-ph]), here we consider minimizing the physical resource required for implementing the gadgets initially proposed by Kempe, Kitaev and Regev (arXiv:quant-ph/0406180) and later generalized by Jordan and Farhi (arXiv:0802.1874v4). The main innovation of our result is a set of methods that efficiently compute tight upper bounds to errors in the perturbation theory. We show that in cases where the terms in the target Hamiltonian commute, the bounds produced by our algorithm are sharp for arbitrary order perturbation theory. We provide numerics which show orders of magnitudes improvement over gadget constructions based on trivial upper bounds for the error term in the perturbation series. We also discuss further improvement of our result by adopting the Schrieffer-Wolff formalism of perturbation theory and supplement our observation with numerical results.
23 pages, 7 figures
References in corpus (20)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Schrieffer-Wolff transformation for quantum many-body systems
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Long-range quantum entanglement in noisy cluster states
- Adiabatic Quantum Simulation of Quantum Chemistry
- Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
- Perturbative Gadgets at Arbitrary Orders
- The one-way quantum computer -- a non-network model of quantum computation
- One-way Quantum Computation - a tutorial introduction
- Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
- Hamiltonian gadgets with reduced resource requirements
- Non-perturbative gadget for topological quantum codes
- The Complexity of Stoquastic Local Hamiltonian Problems
- Simulating highly nonlocal Hamiltonians with less nonlocal Hamiltonians
- Adiabatic Rotation, Quantum Search and Preparation of Superposition States
- Fermionic Hamiltonians for quantum simulations: a general reduction scheme
- Efficient estimation of perturbative error with cellular automata