Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions

Abstract

Perturbative gadgets are a tool to encode part of a Hamiltonian, usually the low-energy subspace, into a different Hamiltonian with favorable properties, for instance, reduced locality. Many constructions of perturbative gadgets have been proposed over the years. Still, all of them are restricted in some ways: Either they apply to some specific classes of Hamiltonians, they involve recursion to reduce locality, or they are limited to studying time evolution under the gadget Hamiltonian, e.g., in the context of adiabatic quantum computing, and thus involve subspace restrictions. In this work, we fill the gap by introducing a versatile universal, non-recursive, non-adiabatic perturbative gadget construction without subspace restrictions, that encodes an arbitrary many-body Hamiltonian into the low-energy subspace of a three-body Hamiltonian and is therefore applicable to gate-based quantum computing. Our construction requires $rk$ additional qubits for a $k$-body Hamiltonian comprising $r$ terms. Besides a specific gadget construction, we also provide a recipe for constructing similar gadgets, which can be tailored to different properties, which we discuss.

arXiv commentFixed typos

References in corpus (37)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Schrieffer-Wolff transformation for quantum many-body systems
• Training variational quantum algorithms is NP-hard
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• The randomized measurement toolbox
• Quantum-assisted quantum compiling
• Layerwise learning for quantum neural networks
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Variational Quantum State Diagonalization
• Variational Quantum Linear Solver
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Large gradients via correlation in random parameterized quantum circuits
• Avoiding barren plateaus using classical shadows
• On barren plateaus and cost function locality in variational quantum algorithms
• Universal Quantum Hamiltonians
• Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
• Perturbative Gadgets at Arbitrary Orders
• Barren plateaus in quantum tensor network optimization
• Learning quantum data with the quantum Earth Mover's distance
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Hamiltonian gadgets with reduced resource requirements
• Toric codes and quantum doubles from two-body Hamiltonians
• Non-perturbative gadget for topological quantum codes
• Simulating topological tensor networks with Majorana qubits
• Simulating highly nonlocal Hamiltonians with less nonlocal Hamiltonians
• Measurement-induced entanglement phase transitions in variational quantum circuits
• Perturbation Gadgets: Arbitrary Energy Scales from a Single Strong Interaction

Cited by in corpus (2)

• Barren Plateaus in Variational Quantum Computing
• Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets