Efficient and Noise-Resilient Molecular Quantum Simulation with the Generalized Superfast Encoding

• URL: http://arxiv.org/abs/2511.09322v1
• Date: Thu, 13 Nov 2025 01:46:27 GMT
• Title: Efficient and Noise-Resilient Molecular Quantum Simulation with the Generalized Superfast Encoding
• Authors: James Brown, Tarini S Hardikar, Kenny Heitritter, Kanav Setia,
• Abstract summary: Simulating molecular systems on quantum computers requires efficient mappings from Fermionic operators to qubit operators.<n>Traditional mappings such as Jordan-Wigner or Bravyi-Kitaev often produce high-weight Pauli terms.<n>We propose a suite of techniques to construct compact and noise-resilient Fermion GSE-to-qubit mappings.
• Score: 0.5833117322405447
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulating molecular systems on quantum computers requires efficient mappings from Fermionic operators to qubit operators. Traditional mappings such as Jordan-Wigner or Bravyi-Kitaev often produce high-weight Pauli terms, increasing circuit depth and measurement complexity. Although several local qubit mappings have been proposed to address this challenge, most are specialized for structured models like the Hubbard Hamiltonian and perform poorly for realistic chemical systems with dense two-body interactions. In this work, we utilize a suite of techniques to construct compact and noise-resilient Fermion-to-qubit mappings suitable for general molecular Hamiltonians. Building on the Generalized Superfast Encoding (GSE) and other similar works, we demonstrate that it outperforms prior encodings in both accuracy and hardware efficiency for molecular simulations. Our improvements include path optimization within the Hamiltonian's interaction graph to minimize operator weight, introduction of multi-edge graph structures for enhanced error detection without added circuit depth, and a stabilizer measurement framework that directly maps logical terms and stabilizers to the Z-basis using Clifford simulation. Applying these methods to simulations of $(H_2)_2$ and $(H_2)_3$ systems yields significantly improved absolute and correlation energy estimates under realistic hardware noise, with further accuracy gains achieved by increasing code distance. We also propose a [[2N, N, 2]] variant of GSE compatible with square-lattice and (quasi-)linear hardware topologies, demonstrating a twofold reduction in RMSE for orbital rotations on IBM Kingston hardware. These results establish GSE as a very attractive mapping for molecular quantum simulations.

Related papers

• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• 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)
• Quantum Resource Comparison for Two Leading Surface Code Lattice Surgery Approaches [0.759660604072964]
  Hamiltonian simulation is one of the most promising candidates for the demonstration of quantum advantage.<n>We show that the optimal scheme depends on whether Hamiltonian simulation is implemented using the quantum signal processing.
  arXiv  Detail & Related papers  (2025-06-09T19:46:32Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Trapped-ion quantum simulation of the Fermi-Hubbard model as a lattice gauge theory using hardware-aware native gates [0.43914426871918816]
  Trotterization-based quantum simulations have shown promise, but implementations on current hardware are limited by noise.<n>A mapping of the Fermi-Hubbard model to a Z2 LGT was recently proposed that restricts the dynamics to a subspace protected by additional symmetries, and its ability for post-selection error mitigation was verified through noisy classical simulations.<n>In particular, a novel combination of iteratively preconditioned gradient descent (IPG) and subsystem von Neumann Entropy compression reduces the 2-qubit gate count of FHM quantum simulation by 35%.
  arXiv  Detail & Related papers  (2024-11-12T13:21:12Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings [0.0]
  In ab-initio electronic structure simulations, fermion-to-qubit mappings represent the initial encoding step of the fermionic problem into qubits. This work introduces a physically-inspired method for constructing mappings that significantly simplify entanglement requirements.
  arXiv  Detail & Related papers  (2023-11-13T15:43:37Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• 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)
• 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)
• 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.