Efficient Quantum Algorithm for Filtering Product States

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Irmejs, Reinis, Bañuls, Mari Carmen, Cirac, J. Ignacio
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909239580033024
author Irmejs, Reinis
Bañuls, Mari Carmen
Cirac, J. Ignacio
author_facet Irmejs, Reinis
Bañuls, Mari Carmen
Cirac, J. Ignacio
contents We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $δ$. Given a local Hamiltonian on $N$ qubits, we construct a parent Hamiltonian whose ground state corresponds to the filtered product state with variable energy variance proportional to $δ\sqrt{N}$. We prove that the parent Hamiltonian is gapped and its ground state can be efficiently implemented in $\mathrm{poly}(N,1/δ)$ time via adiabatic evolution. We numerically benchmark the algorithm for a particular non-integrable model and find that the adiabatic evolution time to prepare the filtered state with a width $δ$ is independent of the system size $N$. Furthermore, the adiabatic evolution can be implemented with circuit depth $\mathcal{O}(N^2δ^{-4})$. Our algorithm provides a way to study the finite energy regime of many body systems in quantum simulators by directly preparing a finite energy state, providing access to an approximation of the microcanonical properties at an arbitrary energy.
format Preprint
id arxiv_https___arxiv_org_abs_2312_13892
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Efficient Quantum Algorithm for Filtering Product States
Irmejs, Reinis
Bañuls, Mari Carmen
Cirac, J. Ignacio
Quantum Physics
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $δ$. Given a local Hamiltonian on $N$ qubits, we construct a parent Hamiltonian whose ground state corresponds to the filtered product state with variable energy variance proportional to $δ\sqrt{N}$. We prove that the parent Hamiltonian is gapped and its ground state can be efficiently implemented in $\mathrm{poly}(N,1/δ)$ time via adiabatic evolution. We numerically benchmark the algorithm for a particular non-integrable model and find that the adiabatic evolution time to prepare the filtered state with a width $δ$ is independent of the system size $N$. Furthermore, the adiabatic evolution can be implemented with circuit depth $\mathcal{O}(N^2δ^{-4})$. Our algorithm provides a way to study the finite energy regime of many body systems in quantum simulators by directly preparing a finite energy state, providing access to an approximation of the microcanonical properties at an arbitrary energy.
title Efficient Quantum Algorithm for Filtering Product States
topic Quantum Physics
url https://arxiv.org/abs/2312.13892