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

TL;DR

This paper introduces a universal, non-recursive perturbative gadget construction that encodes arbitrary many-body Hamiltonians into a three-body Hamiltonian's low-energy subspace, suitable for gate-based quantum computing.

Contribution

It presents a versatile gadget construction without subspace restrictions, applicable to arbitrary Hamiltonians, and provides a general recipe for tailored gadget designs.

Findings

Encodes any many-body Hamiltonian into a three-body Hamiltonian's low-energy subspace.

Requires $rk$ additional qubits for a $k$-body Hamiltonian with $r$ terms.

Offers a flexible construction method adaptable to different properties.

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.