Recognition: unknown
Tapering off qubits to simulate fermionic Hamiltonians
read the original abstract
We discuss encodings of fermionic many-body systems by qubits in the presence of symmetries. Such encodings eliminate redundant degrees of freedom in a way that preserves a simple structure of the system Hamiltonian enabling quantum simulations with fewer qubits. First we consider $U(1)$ symmetry describing the particle number conservation. Using a previously known encoding based on the first quantization method a system of $M$ fermi modes with $N$ particles can be simulated on a quantum computer with $Q=N\log{(M)}$ qubits. We propose a new version of this encoding tailored to variational quantum algorithms. Also we show how to improve sparsity of the simulator Hamiltonian using orthogonal arrays. Next we consider encodings based on the second quantization method. It is shown that encodings with a given filling fraction $\nu=N/M$ and a qubit-per-mode ratio $\eta=Q/M<1$ can be constructed from efficiently decodable classical LDPC codes with the relative distance $2\nu$ and the encoding rate $1-\eta$. A family of codes based on high-girth bipartite graphs is discussed. Graph-based encodings eliminate roughly $M/N$ qubits. Finally we consider discrete symmetries, and show how to eliminate qubits using previously known encodings, illustrating the technique for simple molecular-type Hamiltonians.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Excited-State Quantum Chemistry on Qumode-Based Processors via Variational Quantum Deflation
QumVQD enables excited-state quantum chemistry calculations on bosonic qumode hardware by enforcing particle-number symmetry and using Hamiltonian fragmentation, achieving chemical accuracy on H2 and spectroscopic acc...
-
Quantum State Engineering Under Multiple Expectation-Value Constraints
QUEST is a new adaptive framework for quantum state engineering that constructs states one Pauli rotation at a time to satisfy multiple expectation-value targets simultaneously.
-
Accuracy-Cost Trade-offs for Reference VQE Calculations of H$_2$ on IBM Quantum Hardware
A standardized VQE benchmark on IBM hardware shows tapered circuit mappings give the most consistent accuracy gains for H2, while resilience level 1 adds cost and session execution increases billed time without accura...
-
CovAngelo: A hybrid quantum-classical computing platform for accurate and scalable drug discovery
CovAngelo implements a QM/QM/MM embedding model using quantum-information metrics to compute reaction energy profiles and barriers for covalent drug binding at lower cost than conventional methods, demonstrated on zan...
-
Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.