Spectral functions on a quantum computer through system-environment interaction
quant-ph
Submitted: 2026-05-02
Updated: 2026-10-11
Comments: 9 pages + supplemental. Typos corrected and conventions changed
License: http://creativecommons.org/licenses/by/4.0/
The gist: Spectral functions measured with angle-resolved photoemission spectroscopy (ARPES) provide key insight to elucidate the band structure of materials.
Terminology
Abstract
Spectral functions measured with angle-resolved photoemission spectroscopy (ARPES) provide key insight to elucidate the band structure of materials. Comparison with theory requires computing dynamical one-point functions in some equilibrium state, which can be classically challenging. Their measurement on quantum computers poses multiple problems and comes with a large sampling overhead when standard techniques are used. We introduce an efficient way of measuring spectral functions on a quantum computer by directly modeling the interaction of the system with the environment involved in ARPES experiments. We develop quantum circuits whose local expectation values are proportional to the spectral function A(k,ω) for all momentum k and a specific chosen frequency ω. Although coming with a qubit and two-qubit gate overhead, our approach requires O(N) times less sampling than previous approaches, translating into a factor O(N) faster in runtime, and is particularly adapted to ion-trap quantum computers. The algorithm requires to implement a fermionic Fourier transform (FFT). We write out an efficient gate decomposition for generic radix- n FFT and benchmark it on hardware for radix- 3 on 27 qubits. We finally demonstrate our algorithm on a Quantinuum System Model H2 ion-trap system, computing the spectral function on a one-dimensional system of 27 sites, using 54 qubits.
Sources
- Digital quantum magnetism on a trapped-ion quantum computer
- Programmable digital quantum simulation of 2D Fermi-Hubbard dynamics using 72 superconducting qubits
- Superconducting pairing correlations on a trapped-ion quantum computer
- Quantum Computed Green's Functions using a Cumulant Expansion of the Lanczos Method
- Quantum Algorithms for Ground-State Preparation and Green's Function Calculation
- Quantum subspace expansion algorithm for Green's functions
- Krylov variational quantum algorithm for first principles materials simulations
- Low-depth fermion routing without ancillas
- Fast simulation of fermions with reconfigurable qubits
- Fast stabilizer state preparation via AI-optimized graph decimation
- The quantum adiabatic algorithm suppresses the proliferation of errors
- On the stability to noise of fermion-to-qubit mappings
- Adiabatic preparation of thermal states and entropy-noise relation on noisy quantum computers
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians