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

• URL: http://arxiv.org/abs/2210.03099v4
• Date: Tue, 27 Aug 2024 13:42:07 GMT
• Title: Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions
• Authors: Simon Cichy, Paul K. Faehrmann, Sumeet Khatri, Jens Eisert,
• Abstract summary: We introduce a versatile universal, non-recursive, non-adiabatic perturbative gadget construction without subspace restrictions. Our construction requires $rk$ additional qubits for a $k$-body Hamiltonian comprising $r$ terms. We also provide a recipe for constructing similar gadgets, which can be tailored to different properties.
• Score: 0.9249657468385781
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization [38.59115551211364]
  Existing compilation techniques for Hamiltonian simulation struggle to provide gate counts feasible on current quantum computers. We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step. We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.
  arXiv  Detail & Related papers  (2025-04-09T18:41:31Z)
• On Infinite Tensor Networks, Complementary Recovery and Type II Factors [39.58317527488534]
  We study local operator algebras at the boundary of infinite tensor networks. We decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network.
  arXiv  Detail & Related papers  (2025-03-31T18:00:09Z)
• Robust analog quantum simulators by quantum error-detecting codes [22.034646136056804]
  We provide a recipe for error-resilient Hamiltonian simulations, making use of an excited encoding subspace stabilized by solely $2$-local commuting Hamiltonians. Our method is scalable as it only requires penalty terms that scale to system size.
  arXiv  Detail & Related papers  (2024-12-10T18:58:05Z)
• Fermion-qubit fault-tolerant quantum computing [39.58317527488534]
  We introduce fermion-qubit fault-tolerant quantum computing, a framework which removes this overhead altogether. We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates. Our framework opens the door to fermion-qubit fault-tolerant quantum computation in platforms with native fermions.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Diagonalization of large many-body Hamiltonians on a quantum processor [28.65071920454694]
  We use a superconducting quantum processor to compute eigenenergies of quantum many-body systems on two-dimensional lattices of up to 56 sites. We construct subspaces of the many-body Hilbert space using Trotterized unitary evolutions executed on the quantum processor.
  arXiv  Detail & Related papers  (2024-07-19T16:02:03Z)
• Explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations [0.6144680854063939]
  This paper introduces an efficient quantum protocol for the explicit construction of block-encoding for an important class of Hamiltonians. The proposed algorithm exhibits scaling with respect to the spatial size, suggesting an exponential speedup over classical finite-difference methods.
  arXiv  Detail & Related papers  (2024-05-21T15:13:02Z)
• On Commutative Penalty Functions in Parent-Hamiltonian Constructions [0.0]
  We consider the framework that enables one to engineer exact parent Hamiltonians from commutings. This work presents a framework that captures components of what is known about exact parent Hamiltonians and bridges a few techniques that are concerned with such constructions.
  arXiv  Detail & Related papers  (2023-11-28T22:00:05Z)
• Fermionic Hamiltonians without trivial low-energy states [12.961180148172197]
  We construct local fermionic Hamiltonians with no low-energy trivial states (NLTS) Distinctly from the qubit case, we define trivial states via finite-depth $textitfermionic$ quantum circuits. We define a fermionic analogue of the class quantum PCP and discuss its relation with the qubit version.
  arXiv  Detail & Related papers  (2023-07-25T18:00:02Z)
• Extension of exactly-solvable Hamiltonians using symmetries of Lie algebras [0.0]
  We show that a linear combination of operators forming a modest size Lie algebra can be substituted by determinants of the Lie algebra symmetries. The new class of solvable Hamiltonians can be measured efficiently using quantum circuits with gates that depend on the result of a mid-circuit measurement of the symmetries.
  arXiv  Detail & Related papers  (2023-05-29T17:19:56Z)
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models [44.99833362998488]
  Topological subsystem codes allow for quantum error correction with no time overhead, even in the presence of measurement noise. We provide a systematic construction of a class of codes in three dimensions built from abelian quantum double models in one fewer dimension. Our construction not only generalizes the recently introduced subsystem toric code, but also provides a new perspective on several aspects of the original model.
  arXiv  Detail & Related papers  (2023-05-10T18:00:01Z)
• Combinatorial NLTS From the Overlap Gap Property [2.594420805049218]
  Anshu, Breuckmann, and Nirkhe [ABN22] resolved positively the so-called No Low-Energy Trivial State conjecture by Freedman and Hastings. The conjecture postulated the existence of linear-size local Hamiltonians on n qubit systems for which no near-ground state can be prepared by a shallow (sublogarithmic depth) circuit.
  arXiv  Detail & Related papers  (2023-04-02T22:16:26Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54:43Z)
• Quantum Geometric Confinement and Dynamical Transmission in Grushin Cylinder [68.8204255655161]
  We classify the self-adjoint realisations of the Laplace-Beltrami operator minimally defined on an infinite cylinder. We retrieve those distinguished extensions previously identified in the recent literature, namely the most confining and the most transmitting.
  arXiv  Detail & Related papers  (2020-03-16T11:37:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.