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:2511.09322

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

James Brown, Tarini S Hardikar, Kenny Heitritter, Kanav Setia

quant-phSubmitted Nov 12, 2025• Announced Nov 13, 2025• 4 citations
arXivHTMLPDF

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.

Comments
20 pages, 11 figures

Related papers

Analysis of superfast encoding performance for electronic structure simulations

Riley W. Chien, Sha Xue, Tarini Hardikar +2 more

In our recent work, we examined various fermion-to-qubit mappings in the context of quantum simulation including the original Bravyi-Kitaev superfast encoding (OSE) as well as a generalized version (GSE). We return to OSE and compare it against the Jordan-Wigner (JW) transform for quantum chemistry considering the number of qubits required, the Pauli weight of terms in the transformed Hamiltonians, and the ${L}_{1}$ norm of the Hamiltonian. We considered a test set of molecular systems known as the Atomization Energy 6 (AE6) as well as hydrogen lattices. Our results showed that the resource efficiency of OSE is strongly affected by the spatial locality of the underlying single-particle basis. We find that OSE is outperformed by JW when the orbitals in the underlying single-particle basis are highly overlapping, which limits its applicability to near-term quantum chemistry simulations utilizing standard basis sets. In contrast, when orbitals are overlapping with only few others, as is the case of hydrogen lattices with very tight orbitals, OSE fares comparatively better. Our results illustrate the importance of choosing the right combination of basis sets and fermion-to-qubit mapping to get the most out of a quantum device when simulating physical systems.

arXiv:1907.02976•Physical Review A•Sep 30, 2019•11 citations

Qubit-efficient encoding scheme for quantum simulations of electronic structure

Yu Shee, Pei-Kai Tsai, Cheng-Lin Hong +2 more

Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of $N$ spin-orbitals into an $N$-qubit system, but many of the fermionic configurations do not respect the required conditions and symmetries of the system so the qubit Hilbert space in this case may have unphysical states and thus cannot be fully utilized. We propose a generalized qubit-efficient encoding (QEE) scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. For the case of considering only the particle-conserving and singlet configurations, we reduce the qubit count to an upper bound of $\mathcal{O}(m{log}_{2}N)$, where $m$ is the number of particles. This QEE scheme is demonstrated on an ${\mathrm{H}}_{2}$ molecule in the 6-31G basis set and a $\mathrm{LiH}$ molecule in the STO-3G basis set using fewer qubits than the common encoding methods. We calculate the ground-state energy surfaces using a variational quantum eigensolver algorithm with a hardware-efficient ansatz circuit. We choose to use a hardware-efficient ansatz since most of the Hilbert space in our scheme is spanned by desired configurations so a heuristic search for an eigenstate is sensible. The simulations are performed on IBM Quantum machines and the Qiskit simulator with a noise model implemented from a IBM Quantum machine. Using the methods of measurement error mitigation and error-free linear extrapolation, we demonstrate that most of the distributions of the extrapolated energies using our QEE scheme agree with the exact results obtained by Hamiltonian diagonalization in the given basis sets within chemical accuracy. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era. The number of terms in the Hamiltonian has an upper bound of $\mathcal{O}(\frac{{N}^{2m+1}}{(m\ensuremath{-}1)!\phantom{\rule{0.16em}{0ex}}m!})$ for the QEE scheme while it scales as $\mathcal{O}({N}^{4})$ for the Jordan-Wigner encoding scheme. Nevertheless, we present several cases where QEE is useful.

arXiv:2110.04112•Physical Review Research•May 27, 2022•53 citations

First fault-tolerant quantum memory demonstration for a generalized superfast encoding

James Brown, Kenny Heitritter

The Generalized Superfast Encoding (GSE) is a fermion-to-qubit mapping that has error-correcting/detecting properties. To this point, all demonstrations have been relegated to error-detection only, as no fault-tolerance under circuit-level noise has been observed. Here, we introduce an even-distance $d$ constant stabilizer-weight GSE where each of $N$ modes is assigned a $d$-qubit block arranged on a ring. The resulting stabilizer generators have constant weight 4 or 6 for any even distance $d$. Furthermore, the full stabilizer set of this construction can always be partitioned into four qubit-wise commuting groups, which enables compact syndrome-extraction scheduling. We simulate quantum memory experiments under circuit-level depolarizing noise for two instances of this code, $[[48,8,6]]$ and $[[64,8,8]]$ and the threshold is observed to be $\approx 4\times10^{-3}$. This is, to our knowledge, the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.

quant-pharXiv:2609.08957•Sep 9, 2026•0 citations

Scalable simulation of fermionic encoding performance on noisy quantum computers

Emiliia Dyrenkova, Raymond Laflamme, Michael Vasmer

A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a system of fermions on a quantum computer, one has to first map the fermionic Hamiltonian to a qubit Hamiltonian. The most popular such mapping is the Jordan-Wigner encoding, which suffers from inefficiencies caused by the high weight of some encoded operators. As a result, alternative local encodings have been proposed that solve this problem at the expense of a constant factor increase in the number of qubits required. Some such encodings possess local stabilizers, i.e., Pauli operators that act as the logical identity on the encoded fermionic modes. A natural error mitigation approach in these cases is to measure the stabilizers and discard any run where a measurement returns a -1 outcome. Using a high-performance stabilizer simulator, we classically simulate the performance of a local encoding known as the Derby-Klassen encoding and compare its performance with the Jordan-Wigner encoding and the ternary tree encoding. Our simulations use more complex error models and significantly larger system sizes (up to $18\times18$) than in previous work. We find that the high sampling requirements of postselection methods with the Derby-Klassen encoding pose a limitation to its applicability in near-term devices and call for more encoding-specific circuit optimizations.

arXiv:2506.06425•Physical Review A•Dec 12, 2025•6 citations

Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations

James Brown, Jason Iaconis, Yuri Alexeev +6 more

Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing, but accurate execution on present-day hardware is limited by error accumulation in deep Trotter circuits. We present a device-matched noise-reduction framework for encoded Hamiltonian simulation that combines symplectic-transvection-based Trotter synthesis in the Generalized Superfast Encoding (GSE) with Clifford Noise Reduction (CliNR) and Shor-style stabilizer verification enabled by mid-circuit measurement. We implement this approach for a six-qubit encoded Clifford Trotter step on a Barium development system similar to the forthcoming IonQ Tempo line and benchmark it against direct execution using both hardware experiments and a calibrated device-level noise model. The encoded CliNR execution achieves up to 54% lower logical error rate. Crucially, this advantage disappears when stabilizer readout is deferred to the end of the circuit, showing that timely mid-circuit fault detection, rather than verification overhead alone, drives the improvement. As a proof of concept, we further show that machine-learning-guided stabilizer selection can identify verification operators that outperform random choices. These results demonstrate that encoding-native verification combined with dynamic-circuit primitives can materially improve application-motivated quantum simulation without the full overhead of quantum error correction.

quant-pharXiv:2605.06792•May 11, 2026•4 citations

Error mitigation via error detection using Generalized Superfast Encodings

Tobias Hagge, Nathan Wiebe

We provide a new approach to error mitigation for quantum chemistry simulation that uses a Bravyi-Kitaev Superfast encoding to implement a quantum error detecting code within the fermionic encoding. Our construction has low-weight parity checks as well. We show that for the spinless Hubbard model with nearest-neighbor repulsion terms, one-qubit errors are detectable, and more complicated errors are detectable with high probability. While our error-detection requires additional quantum circuitry, we argue that there is a regime in which the beneficial effect of error-mitigation outweighs the deleterious effects of additional errors due to additional circuitry. We show that our scheme can be implemented under realistic qubit connectivity requirements.

arXiv:2309.11673•Sep 20, 2023•4 citations
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 (H2)2(H_2)_2(H2​)2​ and (H2)3(H_2)_3(H2​)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.
In our recent work, we examined various fermion-to-qubit mappings in the context of quantum simulation including the original Bravyi-Kitaev superfast encoding (OSE) as well as a generalized version (GSE). We return to OSE and compare it against the Jordan-Wigner (JW) transform for quantum chemistry considering the number of qubits required, the Pauli weight of terms in the transformed Hamiltonians, and the L1{L}_{1}L1​ norm of the Hamiltonian. We considered a test set of molecular systems known as the Atomization Energy 6 (AE6) as well as hydrogen lattices. Our results showed that the resource efficiency of OSE is strongly affected by the spatial locality of the underlying single-particle basis. We find that OSE is outperformed by JW when the orbitals in the underlying single-particle basis are highly overlapping, which limits its applicability to near-term quantum chemistry simulations utilizing standard basis sets. In contrast, when orbitals are overlapping with only few others, as is the case of hydrogen lattices with very tight orbitals, OSE fares comparatively better. Our results illustrate the importance of choosing the right combination of basis sets and fermion-to-qubit mapping to get the most out of a quantum device when simulating physical systems.
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of NNN spin-orbitals into an NNN-qubit system, but many of the fermionic configurations do not respect the required conditions and symmetries of the system so the qubit Hilbert space in this case may have unphysical states and thus cannot be fully utilized. We propose a generalized qubit-efficient encoding (QEE) scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. For the case of considering only the particle-conserving and singlet configurations, we reduce the qubit count to an upper bound of O(mlog2N)\mathcal{O}(m{log}_{2}N)O(mlog2​N), where mmm is the number of particles. This QEE scheme is demonstrated on an H2{\mathrm{H}}_{2}H2​ molecule in the 6-31G basis set and a LiH\mathrm{LiH}LiH molecule in the STO-3G basis set using fewer qubits than the common encoding methods. We calculate the ground-state energy surfaces using a variational quantum eigensolver algorithm with a hardware-efficient ansatz circuit. We choose to use a hardware-efficient ansatz since most of the Hilbert space in our scheme is spanned by desired configurations so a heuristic search for an eigenstate is sensible. The simulations are performed on IBM Quantum machines and the Qiskit simulator with a noise model implemented from a IBM Quantum machine. Using the methods of measurement error mitigation and error-free linear extrapolation, we demonstrate that most of the distributions of the extrapolated energies using our QEE scheme agree with the exact results obtained by Hamiltonian diagonalization in the given basis sets within chemical accuracy. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era. The number of terms in the Hamiltonian has an upper bound of $\mathcal{O}(\frac{{N}^{2m+1}}{(m\ensuremath{-}1)!\phantom{\rule{0.16em}{0ex}}m!})$ for the QEE scheme while it scales as O(N4)\mathcal{O}({N}^{4})O(N4) for the Jordan-Wigner encoding scheme. Nevertheless, we present several cases where QEE is useful.
The Generalized Superfast Encoding (GSE) is a fermion-to-qubit mapping that has error-correcting/detecting properties. To this point, all demonstrations have been relegated to error-detection only, as no fault-tolerance under circuit-level noise has been observed. Here, we introduce an even-distance ddd constant stabilizer-weight GSE where each of NNN modes is assigned a ddd-qubit block arranged on a ring. The resulting stabilizer generators have constant weight 4 or 6 for any even distance ddd. Furthermore, the full stabilizer set of this construction can always be partitioned into four qubit-wise commuting groups, which enables compact syndrome-extraction scheduling. We simulate quantum memory experiments under circuit-level depolarizing noise for two instances of this code, [[48,8,6]][[48,8,6]][[48,8,6]] and [[64,8,8]][[64,8,8]][[64,8,8]] and the threshold is observed to be ≈4×10−3\approx 4\times10^{-3}≈4×10−3. This is, to our knowledge, the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a system of fermions on a quantum computer, one has to first map the fermionic Hamiltonian to a qubit Hamiltonian. The most popular such mapping is the Jordan-Wigner encoding, which suffers from inefficiencies caused by the high weight of some encoded operators. As a result, alternative local encodings have been proposed that solve this problem at the expense of a constant factor increase in the number of qubits required. Some such encodings possess local stabilizers, i.e., Pauli operators that act as the logical identity on the encoded fermionic modes. A natural error mitigation approach in these cases is to measure the stabilizers and discard any run where a measurement returns a -1 outcome. Using a high-performance stabilizer simulator, we classically simulate the performance of a local encoding known as the Derby-Klassen encoding and compare its performance with the Jordan-Wigner encoding and the ternary tree encoding. Our simulations use more complex error models and significantly larger system sizes (up to 18×1818\times1818×18) than in previous work. We find that the high sampling requirements of postselection methods with the Derby-Klassen encoding pose a limitation to its applicability in near-term devices and call for more encoding-specific circuit optimizations.
Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing, but accurate execution on present-day hardware is limited by error accumulation in deep Trotter circuits. We present a device-matched noise-reduction framework for encoded Hamiltonian simulation that combines symplectic-transvection-based Trotter synthesis in the Generalized Superfast Encoding (GSE) with Clifford Noise Reduction (CliNR) and Shor-style stabilizer verification enabled by mid-circuit measurement. We implement this approach for a six-qubit encoded Clifford Trotter step on a Barium development system similar to the forthcoming IonQ Tempo line and benchmark it against direct execution using both hardware experiments and a calibrated device-level noise model. The encoded CliNR execution achieves up to 54% lower logical error rate. Crucially, this advantage disappears when stabilizer readout is deferred to the end of the circuit, showing that timely mid-circuit fault detection, rather than verification overhead alone, drives the improvement. As a proof of concept, we further show that machine-learning-guided stabilizer selection can identify verification operators that outperform random choices. These results demonstrate that encoding-native verification combined with dynamic-circuit primitives can materially improve application-motivated quantum simulation without the full overhead of quantum error correction.
We provide a new approach to error mitigation for quantum chemistry simulation that uses a Bravyi-Kitaev Superfast encoding to implement a quantum error detecting code within the fermionic encoding. Our construction has low-weight parity checks as well. We show that for the spinless Hubbard model with nearest-neighbor repulsion terms, one-qubit errors are detectable, and more complicated errors are detectable with high probability. While our error-detection requires additional quantum circuitry, we argue that there is a regime in which the beneficial effect of error-mitigation outweighs the deleterious effects of additional errors due to additional circuitry. We show that our scheme can be implemented under realistic qubit connectivity requirements.