Majorana loop stabilizer codes for error correction of fermionic quantum simulations
arXiv:1812.08190 · doi:10.1103/PhysRevApplied.12.064041
Abstract
Fermion-to-qubit mappings that preserve geometric locality are especially useful for simulating lattice fermion models (e.g., the Hubbard model) on a quantum computer. They avoid the overhead associated with geometric non-local parity terms in mappings such as the Jordan-Wigner transformation and the Bravyi-Kitaev transformation. As a result, they often provide quantum circuits with lower depth and gate complexity. In such encodings, fermionic states are encoded in the common +1 eigenspace of a set of stabilizers, akin to stabilizer quantum error-correcting codes. Here, we discuss several known geometric locality-preserving mappings and their abilities to correct/detect single-qubit errors. We introduce a geometric locality-preserving map, whose stabilizers correspond to products of Majorana operators on closed paths of the fermionic hopping graph. We show that our code, which we refer to as the Majorana loop stabilizer code (MLSC) can correct all single-qubit errors on a 2-dimensional square lattice, while previous geometric locality-preserving codes can only detect single-qubit errors on the same lattice. Compared to existing codes, the MLSC maps the relevant fermionic operators to lower-weight qubit operators despite having higher code distance. Going beyond lattice models, we demonstrate that the MLSC is compatible with state-of-the-art algorithms for simulating quantum chemistry, and can offer those simulations the same error-correction properties without additional asymptotic overhead. These properties make the MLSC a promising candidate for error-mitigated quantum simulations of fermions on near-term devices.
arXiv comment17 pages, 15 figures
References in corpus (48)
- Quantum Computing in the NISQ era and beyond
- Surface codes: Towards practical large-scale quantum computation
- Quantum Simulation
- Good Quantum Error-Correcting Codes Exist
- The theory of variational hybrid quantum-classical algorithms
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Error mitigation for short-depth quantum circuits
- Quantum computing with trapped ions
- Fermionic quantum computation
- Quantum information processing with superconducting circuits: a review
- Efficient variational quantum simulator incorporating active error minimisation
- Maintaining coherence in Quantum Computers
- Noise tailoring for scalable quantum computation via randomized compiling
- Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Digitized adiabatic quantum computing with a superconducting circuit
- Robust determination of molecular spectra on a quantum processor
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Quantum Algorithms for Fermionic Simulations
- Solving strongly correlated electron models on a quantum computer
- Low Depth Quantum Simulation of Electronic Structure
- Error-mitigated digital quantum simulation
- Low-cost error mitigation by symmetry verification
- Fermions, strings, and gauge fields in lattice spin models
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Low rank representations for quantum simulation of electronic structure
- Superconducting Qubits: A Short Review
- Quantum algorithms to simulate many-body physics of correlated fermions
- Quantum computation with realistic magic state factories
- Fault-Tolerant Logical Gates in the IBM Quantum Experience
- Quantum order from string-net condensations and origin of light and massless fermions
- Superfast encodings for fermionic quantum simulation
- Quantum accuracy threshold for concatenated distance-3 codes
- Operator Locality in Quantum Simulation of Fermionic Models
- Majorana Fermion Codes
- Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
- Requirements for fault-tolerant factoring on an atom-optics quantum computer
- Fermions without fermi fields
- Exact bosonization in two spatial dimensions and a new class of lattice gauge theories
- Local spin operators for fermion simulations
- Generalized swap networks for near-term quantum computing
- Unification and limitations of error suppression techniques for adiabatic quantum computing
- Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
- Quantum codes for quantum simulation of Fermions on a square lattice of qubits
- Majorana loop stabilizer codes for error correction of fermionic quantum simulations
- Protecting quantum memories using coherent parity check codes
- Quantum fault tolerance in small experiments
- Non-commuting two-local Hamiltonians for quantum error suppression
Cited by in corpus (43)
- Quantum computational chemistry
- The Variational Quantum Eigensolver: a review of methods and best practices
- Quantum algorithms for quantum chemistry and quantum materials science
- Quantum Error Mitigation
- Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Decoding quantum errors with subspace expansions
- Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
- A Compact Fermion to Qubit Mapping
- Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
- Simulating Quantum Materials with Digital Quantum Computers
- Error mitigation via verified phase estimation
- 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
- Resource Estimation for Quantum Variational Simulations of the Hubbard Model
- Free fermions behind the disguise
- Characterization of solvable spin models via graph invariants
- Quantum Error Mitigated Classical Shadows
- Resource-Efficient Quantum Computing by Breaking Abstractions
- Equivalence between fermion-to-qubit mappings in two spatial dimensions
- Recurrent Quantum Neural Networks
- Optimal local unitary encoding circuits for the surface code
- A Compact Fermion to Qubit Mapping Part 2: Alternative Lattice Geometries
- Discovering optimal fermion-qubit mappings through algorithmic enumeration
- Error-correcting codes for fermionic quantum simulation
- Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
- Free-Fermion Subsystem Codes
- A Practical Framework for Quantum Error Mitigation
- Digital quantum simulation of lattice fermion theories with local encoding
- Local Jordan-Wigner transformations on the torus
- Quantum simulation by qubitization without Toffoli gates
- Mitigating Errors in Local Fermionic Encodings
- Parallelization techniques for quantum simulation of fermionic systems
- A recipe for local simulation of strongly-correlated fermionic matter on quantum computers: the 2D Fermi-Hubbard model
- Symmetric channel verification for purifying noisy quantum channels
- Quantum Algorithm for Green's Functions Measurements in the Fermi-Hubbard Model
- Local fermion-to-qudit mappings: a practical recipe for four-level systems
- Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation
- Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation
- Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers