Efficient Simulation of Sparse, Non-Local Fermion Models
- URL: http://arxiv.org/abs/2512.15843v1
- Date: Wed, 17 Dec 2025 18:50:39 GMT
- Title: Efficient Simulation of Sparse, Non-Local Fermion Models
- Authors: Reinis Irmejs, J. Ignacio Cirac,
- Abstract summary: We study models with $N$ fermionic modes in which each participates in at most a constant number $d$ of interactions.<n>We introduce an encoding that augments each physical fermionic mode with a small number of auxiliary fermions, enabling the removal of Jordan--Wigner strings.
- Score: 0.12277343096128711
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with $N$ fermionic modes in which each participates in at most a constant number $d$ of interactions and study the circuit depth required to implement the Trotterized time evolution on qubit hardware with all-to-all connectivity. We introduce an encoding that augments each physical fermionic mode with a small number of auxiliary fermions, enabling the removal of Jordan--Wigner strings. Although the preparation of the auxiliary fermion state incurs an initial overhead, this state remains invariant under time evolution. As a result, long-time evolution can be implemented with asymptotically optimal circuit depth, reducing a previously multiplicative $O(\log N)$ overhead to an additive overhead. Our results thus establish that the simulation of sparse fermionic models on qubit hardware matches the performance achievable on ideal fermionic hardware up to constant factors and $O(dN)$ ancillary qubits.
Related papers
- Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors [40.72140849821964]
We consider the massive Thirring and Gross-Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$.<n>We prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$.<n>Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models.
arXiv Detail & Related papers (2026-02-25T19:00:01Z) - FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
arXiv Detail & Related papers (2025-10-13T07:57:21Z) - Low-depth fermion routing without ancillas [32.445850550281726]
We show that fermion routing can be performed in depth $O(log2 N)$ emph without ancillas, measurements, or feedforward.<n>We construct efficient mappings with $O(log2 N)$ depth between all product-preserving ternary tree fermionic encodings.
arXiv Detail & Related papers (2025-10-06T17:59:13Z) - Fast simulation of fermions with reconfigurable qubits [0.43553942673960666]
We present a method for faster fermionic simulation with space-time overhead of O(log(N)) in the worst case.<n>This exponential reduction is achieved by using reconfigurable quantum systems with non-local connectivity.<n>We show that the algorithms themselves can be adapted to use only the O(1)-overhead structures.
arXiv Detail & Related papers (2025-09-10T18:01:02Z) - Programming optical-lattice Fermi-Hubbard quantum simulators [39.58317527488534]
We develop ground-state preparation algorithms for different fermionic models.<n>In particular, we first design variational, pre-compiled quantum circuits to prepare the ground state of the native Fermi-Hubbard model.<n>We discuss how to approximate the imaginary-time evolution using variational fermionic circuits.
arXiv Detail & Related papers (2025-02-07T16:40:58Z) - Fault-tolerant fermionic quantum computing [39.58317527488534]
We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
arXiv Detail & Related papers (2024-11-13T19:00:02Z) - Optimizing random local Hamiltonians by dissipation [44.99833362998488]
We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum.
Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
arXiv Detail & Related papers (2024-11-04T20:21:16Z) - Fermionic Simulators for Enhanced Scalability of Variational Quantum
Simulation [0.7673339435080445]
Near-term quantum simulators are mostly based on qubit-based architectures.
Fermionic quantum simulators are becoming viable thanks to advances in trapping and manipulation of neutral atoms in optical tweezers.
We show that the fermionic simulators indeed outperform their qubit counterparts with respect to resources for quantum evolution.
arXiv Detail & Related papers (2023-06-26T16:50:36Z) - Fermionic quantum processing with programmable neutral atom arrays [0.539215791790606]
Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics.
We present a fermionic quantum processor, where fermionic models are encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates.
arXiv Detail & Related papers (2023-03-13T10:35:48Z) - Unimon qubit [42.83899285555746]
Superconducting qubits are one of the most promising candidates to implement quantum computers.
Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
arXiv Detail & Related papers (2022-03-11T12:57:43Z) - Second-quantized fermionic operators with polylogarithmic qubit and gate
complexity [0.0]
We present a method for encoding second-quantized fermionic systems in qubits when the number of fermions is conserved.
This is the first second-quantized encoding of fermions in qubits whose costs in qubits and gates are both polylogarithmic in $M$.
arXiv Detail & Related papers (2021-09-29T14:53:23Z) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates.
We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene.
We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
arXiv Detail & Related papers (2020-04-08T18:00:06Z)
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.