Related papers: Optimizing fermionic encodings for both Hamiltonia…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…
In recent work [arXiv:2003.06939v2] a novel fermion to qubit mapping -- called the compact encoding -- was introduced which outperforms all previous local mappings in both the qubit to mode ratio, and the locality of mapped operators. There…
We present a method for encoding second-quantized fermionic systems in qubits when the number of fermions is conserved, as in the electronic structure problem. When the number $F$ of fermions is much smaller than the number $M$ of modes,…
Simulation of fermionic many-body systems on a quantum computer requires a suitable encoding of fermionic degrees of freedom into qubits. Here we revisit the Superfast Encoding introduced by Kitaev and one of the authors. This encoding maps…
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…
Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this…
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic…
The utility of solving the Fermi-Hubbard model has been estimated in the billions of dollars. Digital quantum computers can in principle address this task, but have so far been limited to quasi one-dimensional models. This is because of…
We derive a rigorous, quantum mechanical map of fermionic creation and annihilation operators to continuous Cartesian variables that exactly reproduces the matrix structure of the many-fermion problem. We show how our scheme can be used to…
Fermion-to-qubit mappings are used to represent fermionic modes on quantum computers, an essential first step in many quantum algorithms for electronic structure calculations. In this work, we present a formalism to design flexible…
This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right…
We introduce a numerical method for generating the approximating polynomials used in fermionic calculations with smeared link actions. We investigate the stability of the algorithm and determine the optimal weight function and the optimal…
Efficient encoding of electronic operators into qubits is essential for quantum chemistry simulations. The majority of methods map single electron states to qubits, effectively handling electron interactions. Alternatively, pairs of…
We show how to absorb fermionic quantum simulation's expensive fermion-to-qubit mapping overhead into the overhead already incurred by surface-code-based fault-tolerant quantum computing. The key idea is to process information in…
The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity…
There is a class of entropy-coding methods which do not substitute symbols by code words (such as Huffman coding), but operate on intervals or ranges. This class includes three prominent members: conventional arithmetic coding, range…
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging…
In this paper we study the Hamming-like fermionic code encoding three-qubits into sixteen Majorana modes recently introduced by Hastings. We show that although this fermionic code cannot be obtained from a single qubit stabilizer code via…
Preserving spin symmetry in variational quantum algorithms is essential for producing physically meaningful electronic wavefunctions. Implementing spin-adapted transformations on quantum hardware, however, is challenging because the…
We present a method to compute the Fermi function of the Hamiltonian for a system of independent fermions, based on an exact decomposition of the grand-canonical potential. This scheme does not rely on the localization of the orbitals and…