Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.17732

Quantum fast-forwarding fermion-boson interactions via the polaron transform

Harriet Apel, Burak Şahinoğlu

quant-phSubmitted Jan 25, 2026• Announced Jan 27, 2026• 3 citations
arXivHTMLPDF

Abstract

Simulating interactions between fermions and bosons is central to understanding correlated phenomena, yet these systems are inherently difficult to treat classically. Previous quantum algorithms for fermion-boson models exhibit computation costs that scale polynomially with the bosonic truncation parameter, $Λ$. In this work we identify the efficient unitary transformation enabling fast-forwarded evolution of the fermion-boson interaction term, yielding an interaction-picture based simulation algorithm with complexity polylogarithmic in $Λ$. We apply this transformation to explicitly construct an efficient quantum algorithm for the Hubbard-Holstein model and discuss its generalisation to other fermion-boson interacting models. This approach yields an important asymptotic improvement in the dependence on the bosonic cutoff and establishes that, for certain models, fermion-boson interactions can be simulated with resources comparable to those required for purely fermionic systems.

Related papers

Digital quantum computation of fermion-boson interacting systems

Alexandru Macridin, Panagiotis Spentzouris, James Frederick Amundson +1 more

We introduce a method for representing the low-energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the continuous theory thanks to the Nyquist-Shannon sampling theorem. The method makes the implementation of quantum algorithms for purely bosonic systems as well as fermion-boson interacting systems feasible. We present algorithmic circuits for computing the time evolution of these systems. The complexity of the algorithms scales polynomially with the system size. The algorithm is a natural extension of the existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed-matter physics to systems involving bosons and fermion-boson interactions and has a broad variety of potential applications in particle physics, condensed matter, etc. Due to the relatively small amount of additional resources required by the inclusion of bosons in our algorithm, the simulation of electron-phonon and similar systems can be placed in the same near-future reach as the simulation of interacting electron systems. We benchmark our algorithm by implementing it for a two-site Holstein polaron problem on an Atos Quantum Learning Machine quantum simulator. The polaron quantum simulations are in excellent agreement with the results obtained by exact diagonalization.

arXiv:1805.09928•Physical Review A•Oct 9, 2018•115 citations

Solving free fermion problems on a quantum computer

Maarten Stroeks, Daan Lenterman, Barbara M. Terhal +1 more

Simulating noninteracting fermion systems is a common task in computational many-body physics. In the absence of translational symmetries, modeling free fermions on N modes usually requires poly ( N ) computational resources. While often moderate, these costs can be prohibitive in practice when large systems are considered. We present several free fermion problems that can be solved by a quantum algorithm with substantially reduced computational costs. The memory costs are exponentially improved, poly log ( N ) . The run-time improvement, compared to the best known classical algorithms, is either exponential or significantly polynomial, depending on the geometry of the problem. The simulation of free fermion dynamics belongs to the BQP-hard complexity class (i.e., as hard as any (decision) problem that can be solved on a quantum computer). This implies (under standard assumptions) that our algorithm yields an exponential speedup for classical algorithm at least for some geometries. The key technique in our algorithm is the block encoding of objects such as correlation matrices and Green's functions into a unitary. We demonstrate how such unitaries can be efficiently realized as quantum circuits, in the context of dynamics and thermal states of tight-binding Hamiltonians. The special cases of disordered and inhomogeneous lattices, as well as large nonlattice graphs, are presented in detail. Finally, we show that our simulation algorithm generalizes to other promising targets, including free-boson systems.

arXiv:2409.04550•Physical Review Research•Nov 18, 2025•15 citations

Digital-analog quantum computing of fermion-boson models in superconducting circuits

Shubham Kumar, Narendra N. Hegade, Anne-Maria Visuri +5 more

High-fidelity quantum simulations demand hardware-software co-design architectures, which are crucial for adapting to complex problems such as strongly correlated dynamics in condensed matter. By leveraging co-design strategies, we can enhance the performance of state-of-the-art quantum devices in the noisy intermediate quantum (NISQ) and early error-correction regimes. In this direction, we propose a digital-analog quantum algorithm for simulating the Hubbard–Holstein model, describing strongly correlated fermion-boson interactions, in a suitable architecture with superconducting circuits. It comprises a linear chain of qubits connected by resonators, emulating electron–electron (e–e) and electron–phonon (e–p) interactions, as well as fermion tunneling. Our approach is adequate for digital-analog quantum computing (DAQC) of fermion-boson models, including those described by the Hubbard–Holstein model. We show the reduction in the circuit depth of the DAQC algorithm, a sequence of digital steps and analog blocks, outperforming the purely digital approach. We exemplify the quantum simulation of a half-filled two-site Hubbard–Holstein model. In this example, we obtain time-dependent state fidelities larger than 0.98, showing that our proposal is suitable for studying the dynamical behavior of solid-state systems. Our proposal opens the door to computing complex systems for chemistry, materials, and high-energy physics.

arXiv:2308.12040•npj Quantum Information•Mar 11, 2025•18 citations

Hybridized Methods for Quantum Simulation in the Interaction Picture

Abhishek Rajput, Alessandro Roggero, Nathan Wiebe

Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic advantages for some Hamiltonians, but incurs prohibitive constant factors and is incompatible with methods like qubitization. We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations over known algorithms. These approaches show asymptotic improvements over the individual methods that comprise them and further make interaction picture simulation methods practical in the near term. Physical applications of these hybridized methods yield a gate complexity scaling as log2⁡Λ in the electric cutoff Λ for the Schwinger Model and independent of the electron density for collective neutrino oscillations, outperforming the scaling for all current algorithms with these parameters. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter λ used to impose an energy cost on time-evolution into an unphysical subspace.

arXiv:2109.03308•Quantum•Aug 17, 2022•63 citations

Efficient classical simulation of time dynamics in Fermi-Hubbard models with imaginary interactions

Raul A. Santos

Using a map between the Lindbladian evolution of dephasing in free fermions and the time evolution of imaginary-interaction Fermi-Hubbard models in bipartite lattices, we present an efficient classical algorithm to solve the Schrödinger equation in these interacting systems. This algorithm leverages the recently discovered algorithm for simulating Lindbladian evolution by sampling mixed unitary channels (Wang et al arXiv:2601.06298). We comment on the expected classical complexity of the problem for general complex values of the parameters and discuss some applications.

quant-pharXiv:2601.12368•Jan 20, 2026•0 citations

Quantum Fast Forwarding of Non-Markovian Quantum Dynamics

Avin Seneviratne, Peter Walters, Fei Wang

In this work, we present a quantum algorithm for simulating non-Markovian quantum dynamics based on the Feynman-Vernon influence functional formalism, which provides an exact description of the dynamics of a quantum system linearly coupled to a harmonic bath. In condensed-phase environments, the bath correlation functions typically decay over time, allowing them to be truncated beyond a finite time scale and enabling an iterative propagation scheme. We implement the finite-memory propagator using a fast-forwarding algorithm that achieves constant circuit depth with respect to the number of propagation steps, while the nonunitary matrices are realized on quantum circuits using unitary dilation. We further exploit the structure of the unitary dilation to show that the additional circuit complexity introduced by the dilation scales polynomially with the number of dilation ancilla qubits, while the dominant computational cost arises from the implementation of the underlying 1-dilation. The algorithm is compared with classical benchmark calculations for the spin-boson model and shows close agreement. Together, these developments establish a quantum-circuit framework for fast forwarding non-Markovian dynamics and identify the principal computational bottlenecks that must be overcome to achieve quantum advantage.

The Journal of Physical Chemistry Letters•Oct 12, 2026•0 citations
Simulating interactions between fermions and bosons is central to understanding correlated phenomena, yet these systems are inherently difficult to treat classically. Previous quantum algorithms for fermion-boson models exhibit computation costs that scale polynomially with the bosonic truncation parameter, ΛΛΛ. In this work we identify the efficient unitary transformation enabling fast-forwarded evolution of the fermion-boson interaction term, yielding an interaction-picture based simulation algorithm with complexity polylogarithmic in ΛΛΛ. We apply this transformation to explicitly construct an efficient quantum algorithm for the Hubbard-Holstein model and discuss its generalisation to other fermion-boson interacting models. This approach yields an important asymptotic improvement in the dependence on the bosonic cutoff and establishes that, for certain models, fermion-boson interactions can be simulated with resources comparable to those required for purely fermionic systems.
We introduce a method for representing the low-energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the continuous theory thanks to the Nyquist-Shannon sampling theorem. The method makes the implementation of quantum algorithms for purely bosonic systems as well as fermion-boson interacting systems feasible. We present algorithmic circuits for computing the time evolution of these systems. The complexity of the algorithms scales polynomially with the system size. The algorithm is a natural extension of the existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed-matter physics to systems involving bosons and fermion-boson interactions and has a broad variety of potential applications in particle physics, condensed matter, etc. Due to the relatively small amount of additional resources required by the inclusion of bosons in our algorithm, the simulation of electron-phonon and similar systems can be placed in the same near-future reach as the simulation of interacting electron systems. We benchmark our algorithm by implementing it for a two-site Holstein polaron problem on an Atos Quantum Learning Machine quantum simulator. The polaron quantum simulations are in excellent agreement with the results obtained by exact diagonalization.
Simulating noninteracting fermion systems is a common task in computational many-body physics. In the absence of translational symmetries, modeling free fermions on N modes usually requires poly ( N ) computational resources. While often moderate, these costs can be prohibitive in practice when large systems are considered. We present several free fermion problems that can be solved by a quantum algorithm with substantially reduced computational costs. The memory costs are exponentially improved, poly log ( N ) . The run-time improvement, compared to the best known classical algorithms, is either exponential or significantly polynomial, depending on the geometry of the problem. The simulation of free fermion dynamics belongs to the BQP-hard complexity class (i.e., as hard as any (decision) problem that can be solved on a quantum computer). This implies (under standard assumptions) that our algorithm yields an exponential speedup for classical algorithm at least for some geometries. The key technique in our algorithm is the block encoding of objects such as correlation matrices and Green's functions into a unitary. We demonstrate how such unitaries can be efficiently realized as quantum circuits, in the context of dynamics and thermal states of tight-binding Hamiltonians. The special cases of disordered and inhomogeneous lattices, as well as large nonlattice graphs, are presented in detail. Finally, we show that our simulation algorithm generalizes to other promising targets, including free-boson systems.
High-fidelity quantum simulations demand hardware-software co-design architectures, which are crucial for adapting to complex problems such as strongly correlated dynamics in condensed matter. By leveraging co-design strategies, we can enhance the performance of state-of-the-art quantum devices in the noisy intermediate quantum (NISQ) and early error-correction regimes. In this direction, we propose a digital-analog quantum algorithm for simulating the Hubbard–Holstein model, describing strongly correlated fermion-boson interactions, in a suitable architecture with superconducting circuits. It comprises a linear chain of qubits connected by resonators, emulating electron–electron (e–e) and electron–phonon (e–p) interactions, as well as fermion tunneling. Our approach is adequate for digital-analog quantum computing (DAQC) of fermion-boson models, including those described by the Hubbard–Holstein model. We show the reduction in the circuit depth of the DAQC algorithm, a sequence of digital steps and analog blocks, outperforming the purely digital approach. We exemplify the quantum simulation of a half-filled two-site Hubbard–Holstein model. In this example, we obtain time-dependent state fidelities larger than 0.98, showing that our proposal is suitable for studying the dynamical behavior of solid-state systems. Our proposal opens the door to computing complex systems for chemistry, materials, and high-energy physics.
Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic advantages for some Hamiltonians, but incurs prohibitive constant factors and is incompatible with methods like qubitization. We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations over known algorithms. These approaches show asymptotic improvements over the individual methods that comprise them and further make interaction picture simulation methods practical in the near term. Physical applications of these hybridized methods yield a gate complexity scaling as log2⁡Λ in the electric cutoff Λ for the Schwinger Model and independent of the electron density for collective neutrino oscillations, outperforming the scaling for all current algorithms with these parameters. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter λ used to impose an energy cost on time-evolution into an unphysical subspace.
Using a map between the Lindbladian evolution of dephasing in free fermions and the time evolution of imaginary-interaction Fermi-Hubbard models in bipartite lattices, we present an efficient classical algorithm to solve the Schrödinger equation in these interacting systems. This algorithm leverages the recently discovered algorithm for simulating Lindbladian evolution by sampling mixed unitary channels (Wang et al arXiv:2601.06298). We comment on the expected classical complexity of the problem for general complex values of the parameters and discuss some applications.
In this work, we present a quantum algorithm for simulating non-Markovian quantum dynamics based on the Feynman-Vernon influence functional formalism, which provides an exact description of the dynamics of a quantum system linearly coupled to a harmonic bath. In condensed-phase environments, the bath correlation functions typically decay over time, allowing them to be truncated beyond a finite time scale and enabling an iterative propagation scheme. We implement the finite-memory propagator using a fast-forwarding algorithm that achieves constant circuit depth with respect to the number of propagation steps, while the nonunitary matrices are realized on quantum circuits using unitary dilation. We further exploit the structure of the unitary dilation to show that the additional circuit complexity introduced by the dilation scales polynomially with the number of dilation ancilla qubits, while the dominant computational cost arises from the implementation of the underlying 1-dilation. The algorithm is compared with classical benchmark calculations for the spin-boson model and shows close agreement. Together, these developments establish a quantum-circuit framework for fast forwarding non-Markovian dynamics and identify the principal computational bottlenecks that must be overcome to achieve quantum advantage.