Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
arXiv:2506.06425 · doi:10.1103/dg5d-m728
Abstract
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 ) 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.
12 pages, 10 figures. Figure 7 changed for readability, VQED content moved to appendix
References in corpus (44)
- Surface codes: Towards practical large-scale quantum computation
- Quantum computational chemistry
- Improved Simulation of Stabilizer Circuits
- Quantum Chemistry in the Age of Quantum Computing
- Fermionic quantum computation
- Scalable Quantum Simulation of Molecular Energies
- Quantum algorithms for quantum chemistry and quantum materials science
- Hartree-Fock on a superconducting qubit quantum computer
- Topological Quantum Distillation
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Noise tailoring for scalable quantum computation via randomized compiling
- A Theory of Trotter Error
- Quantum chemistry calculations on a trapped-ion quantum simulator
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Stim: a fast stabilizer circuit simulator
- Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
- Quantum error correction with only two extra qubits
- Decoherence in Solid State Qubits
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Emerging quantum computing algorithms for quantum chemistry
- Quantification and Characterization of Leakage Errors
- Faster quantum simulation by randomization
- Quantum algorithms to simulate many-body physics of correlated fermions
- Decoding quantum errors with subspace expansions
- A Compact Fermion to Qubit Mapping
- Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
- Operator Locality in Quantum Simulation of Fermionic Models
- Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
- Towards near-term quantum simulation of materials
- Majorana loop stabilizer codes for error correction of fermionic quantum simulations
- Quantum Error Mitigation using Symmetry Expansion
- Combining hard and soft decoders for hypergraph product codes
- Quantum algorithms: A survey of applications and end-to-end complexities
- Benchmarking the Planar Honeycomb Code
- Fault-tolerant protection of near-term trapped-ion topological qubits under realistic noise sources
- Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
- Efficiently improving the performance of noisy quantum computers
- Optimal local unitary encoding circuits for the surface code
- Low-depth simulations of fermionic systems on square-grid quantum hardware
- Trotter error with commutator scaling for the Fermi-Hubbard model
- Experimental Demonstration of Break-Even for the Compact Fermionic Encoding
- Virtual quantum error detection
- Mitigating Temporal Fragility in the XY Surface Code