Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning

Abstract

We introduce a fermion-to-qubit mapping defined on ternary trees, where any single Majorana operator on an $n$-mode fermionic system is mapped to a multi-qubit Pauli operator acting nontrivially on $\lceil {\log }_3(2n+1)\rceil$ qubits. The mapping has a simple structure and is optimal in the sense that it is impossible to construct Pauli operators in any fermion-to-qubit mapping acting nontrivially on less than ${\log }_3(2n)$ qubits on average. We apply it to the problem of learning $k$-fermion reduced density matrix (RDM), a problem relevant in various quantum simulation applications. We show that using the ternary-tree mapping one can determine the elements of all $k$-fermion RDMs, to precision $\epsilon$, by repeating a single quantum circuit for $\lesssim (2n+1{)}^k{\epsilon }^{-2}$ times. This result is based on a method we develop here that allows one to determine the elements of all $k$-qubit RDMs, to precision $\epsilon$, by repeating a single quantum circuit for $\lesssim 3^k{\epsilon }^{-2}$ times, independent of the system size. This improves over existing schemes for determining qubit RDMs.

10 pages, 3 figures

References in corpus (15)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computing with trapped ions
• Reduced Density Matrix Functional for Many-Electron Systems
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Quantum algorithms to simulate many-body physics of correlated fermions
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Quantum Overlapping Tomography
• Unbiased Reduced Density Matrices and Electronic Properties from Full Configuration Interaction Quantum Monte Carlo
• Measurement reduction in variational quantum algorithms
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Efficient evaluation of quantum observables using entangled measurements
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations

Cited by in corpus (47)

• Noisy intermediate-scale quantum (NISQ) algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Information-theoretic bounds on quantum advantage in machine learning
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Fermionic partial tomography via classical shadows
• Search for Efficient Formulations for Hamiltonian Simulation of non-Abelian Lattice Gauge Theories
• Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
• Efficient evaluation of quantum observables using entangled measurements
• Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
• Free fermions behind the disguise
• Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• Quantum utility -- definition and assessment of a practical quantum advantage
• Accelerated variational quantum eigensolver with joint Bell measurement
• Post-Hartree-Fock method in Quantum Chemistry for Quantum Computer
• Dual frame optimization for informationally complete quantum measurements
• Classical shadows based on locally-entangled measurements
• Triply efficient shadow tomography
• Enhanced observable estimation through classical optimization of informationally over-complete measurement data -- beyond classical shadows
• Discovering optimal fermion-qubit mappings through algorithmic enumeration
• A general framework for active space embedding methods: applications in quantum computing
• Error-correcting codes for fermionic quantum simulation
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings
• Study of the long-range transverse field Ising model with fermionic Gaussian states
• The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems
• Digital quantum simulation of lattice fermion theories with local encoding
• Estimating molecular thermal averages with the quantum equation of motion and informationally complete measurements
• Mantra: Rewriting Quantum Programs to Minimize Trap-Movements for Zoned Rydberg Atom Arrays
• Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
• Local Jordan-Wigner transformations on the torus
• Local quantum overlapping tomography
• Parallelization techniques for quantum simulation of fermionic systems
• On the locality of qubit encodings of local fermionic modes
• Quantum circuits for partial differential equations in Fourier space
• Clifford circuit based heuristic optimization of fermion-to-qubit mappings
• Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers
• HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer
• Trotter error and gate complexity of the SYK and sparse SYK models
• Local fermion-to-qudit mappings: a practical recipe for four-level systems
• Optimal Fermionic Joint Measurements for Estimating Non-Commuting Majorana Observables
• Quantum information theory on sparse wavefunctions and applications for Quantum Chemistry
• Fast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
• Constrained Shadow Tomography for Molecular Simulation on Quantum Devices
• Accelerating Fermionic System Simulation on Quantum Computers