Papers › Tapering off qubits to simulate fermionic Hamiltonians
Tapering off qubits to simulate fermionic Hamiltonians
Sergey Bravyi, Jay M. Gambetta, Antonio Mezzacapo, Kristan Temme
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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=Nlog(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 ν=N/M and a qubit-per-mode ratio η=Q/M<1 can be constructed from efficiently decodable classical LDPC codes with the relative distance 2ν and the encoding rate 1-η. 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections