Fast simulation of fermions with reconfigurable qubits

• URL: http://arxiv.org/abs/2509.08898v1
• Date: Wed, 10 Sep 2025 18:01:02 GMT
• Title: Fast simulation of fermions with reconfigurable qubits
• Authors: Nishad Maskara, Marcin Kalinowski, Daniel Gonzalez-Cuadra, Mikhail D. Lukin,
• Abstract summary: 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.
• Score: 0.43553942673960666
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Performing large-scale, accurate quantum simulations of many-fermion systems is a central challenge in quantum science, with applications in chemistry, materials, and high-energy physics. Despite significant progress, realizing generic fermionic algorithms with qubit systems incurs significant space-time overhead, scaling as O(N) for N fermionic modes. Here we present a method for faster fermionic simulation with asymptotic space-time overhead of O(log(N)) in the worst case, and O(1) for circuits with additional structure, including important subroutines like the fermionic fast Fourier transform. This exponential reduction is achieved by using reconfigurable quantum systems with non-local connectivity, mid-circuit measurement, and classical feedforward, to generate dynamical fermion-to-qubit mappings. We apply this technique to achieve efficient compilation for key simulation tasks, including Hamiltonian simulation of the sparse Sachdev-Ye-Kitaev model and periodic materials, as well as free-fermion state-preparation. Moreover, we show that the algorithms themselves can be adapted to use only the O(1)-overhead structures to further reduce resource overhead. These techniques can lower gate counts by orders of magnitude for practical system sizes and are natively compatible with error corrected computation, making them ideal for early fault-tolerant quantum devices. Our results tightly bound the computational gap between fermionic and qubit models and open new directions in quantum simulation algorithm design and implementation.

Related papers

• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme [11.915190522925199]
  We propose a hybrid quantization scheme for electronic simulations that employs a conversion circuit to switch efficiently between the two quantizations.<n>This way, plane-wave Hamiltonian simulations can be done efficiently in the first-quantization before converting to the second quantization.<n>We discuss applications of this hybrid quantization scheme to bring improvements in the characterization of ground-state and excited-state properties.
  arXiv  Detail & Related papers  (2025-07-06T06:06:48Z)
• Entanglement renormalization circuits for $2d$ Gaussian Fermion States [0.0]
  This work introduces a quantum circuit compression algorithm for Gaussian fermion states based on the multi-scale entanglement renormalization ansatz (MERA)<n>The algorithm is shown to accurately capture area-law entangled states including topologically trivial insulators, Chern insulators, and critical Dirac semimetals.<n>We also develop a novel fermion-to-qubit encoding scheme, based on an expanding $2d$ topological order, that enables implementing fermionic rotations via qubit Pauli rotations with constant Pauli weight independent of system size.
  arXiv  Detail & Related papers  (2025-06-04T17:44:17Z)
• Classical simulation of parity-preserving quantum circuits [0.0]
  We present a classical simulation method for fermionic quantum systems without loss of generality.<n>We map such circuits to a fermionic tensor network and introduce a novel decomposition of non-Matchgate gates.<n>Our algorithm significantly lowers resource requirements for simulating parity-preserving circuits while retaining high accuracy.
  arXiv  Detail & Related papers  (2025-04-27T17:42:39Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Benchmarking a novel efficient numerical method for localized 1D Fermi-Hubbard systems on a quantum simulator [0.0]
  We show that a quantum simulator can be used to in-effect solve for the dynamics of a many-body system. We use a neutral-atom Fermi-Hubbard quantum simulator with $L_textexpsimeq290$ lattice sites to benchmark its performance. We derive a simple prediction of the behaviour of interacting Bloch oscillations for spin-imbalanced Fermi-Hubbard systems.
  arXiv  Detail & Related papers  (2021-05-13T16:03:11Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.