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 the encoding was demonstrated for square and hexagonal lattices. Here we present an extension of that work by illustrating how to apply the compact encoding to other regular lattices. We give constructions for variants of the compact encoding on all regular tilings with maximum degree 4. These constructions yield edge operators with Pauli weight at most 3 and use fewer than 1.67 qubits per fermionic mode. Additionally we demonstrate how the compact encoding may be applied to a cubic lattice, yielding edge operators with Pauli weight no greater than 4 and using approximately 2.5 qubits per mode. In order to properly analyse the compact encoding on these lattices a more general group theoretic framework is required, which we elaborate upon in this work. We expect this framework to find use in the design of fermion to qubit mappings more generally.
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 the encoding was demonstrated for square and hexagonal lattices. Here we present an extension of that work by illustrating how to apply the compact encoding to other regular lattices. We give constructions for variants of the compact encoding on all regular tilings with maximum degree 4. These constructions yield edge operators with Pauli weight at most 3 and use fewer than 1.67 qubits per fermionic mode. Additionally we demonstrate how the compact encoding may be applied to a cubic lattice, yielding edge operators with Pauli weight no greater than 4 and using approximately 2.5 qubits per mode. In order to properly analyse the compact encoding on these lattices a more general group theoretic framework is required, which we elaborate upon in this work. We expect this framework to find use in the design of fermion to qubit mappings more generally.
Mappings between fermions and qubits are valuable constructions in physics. To date only a handful exist. In addition to revealing dualities between fermionic and spin systems, such mappings are indispensable in any quantum simulation of fermionic physics on quantum computers. The number of qubits required per fermionic mode, and the locality of mapped fermionic operators strongly impact the cost of such simulations. We present a fermion to qubit mapping that outperforms all previous local mappings in both the qubit to mode ratio and the locality of mapped operators. In addition to these practically useful features, the mapping bears an elegant relationship to the toric code, which we discuss. Finally, we consider the error mitigating properties of the mapping---which encodes fermionic states into the code space of a stabilizer code. Although there is an implicit tradeoff between low weight representations of local fermionic operators, and high distance code spaces, we argue that fermionic encodings with low-weight representations of local fermionic operators can still exhibit error mitigating properties which can serve a similar role to that played by high code distances. In particular, when undetectable errors correspond to ``natural'' fermionic noise. We illustrate this point explicitly both for this encoding and the Verstraete-Cirac encoding.
Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of qubits. This overhead can be a hindrance to implementation of qubit-based quantum simulators, especially in the analog context. Here we thus review and analyze alternative fermion-to-qubit mappings, including the two approaches by Bravyi and Kitaev and the auxiliary fermion transformation. The Bravyi-Kitaev transform is reformulated in terms of a classical data structure and generalized to achieve a further locality improvement for local fermionic models on a rectangular lattice. We conclude that the most compact encoding of the fermionic operators can be done using ancilla qubits with the auxiliary fermion scheme. Without introducing ancillas, a variant of the Bravyi-Kitaev transform provides the most compact fermion-to-qubit mapping for Hubbard-like models.
Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation algorithm, fermion-qubit mappings translate the fermionic interactions to the operators and states of quantum computers. This translation is highly non-trivial: a burgeoning supply of fermion-qubit mappings has arisen over the past twenty years to address the limited resources of early quantum technology. Previous literature has presented a dichotomy between ancillafree fermion-qubit mappings, which minimise qubit count, and local encodings, which minimise gate complexity. We present two computational approaches to the construction of general mappings while working with a limited number of qubits, striking a balance between the low-qubit and low-gate demands of present quantum technology. The first method frames the order of fermionic labels as an instance of the quadratic assignment problem to minimize the total and maximum Pauli weights in a problem Hamiltonian. We compare the orderoptimized performance of several common ancilla-free mappings on systems of size up to 225 fermionic modes. The second method is a computational approach to incrementally add ancilla qubits to Jordan-Wigner transformations and further reduce the Pauli weights. By adding up to 10 ancilla qubits, we were able to reduce the total Pauli weight by as much as 67 % in JordanWigner transformations of fermionic systems with up to 64 modes, outperforming the previous state-of-the-art ancilla-free mappings. Reproducibility: source code and data are available at https://github.com/cameton/QCE_QubitAssignment
We argue that all locality-preserving mappings between fermionic observables and Pauli matrices on a two-dimensional lattice can be generated from the exact bosonization in Chen et al. [Ann.Phys.(N.Y) 393, 234 (2018)], whose gauge constraints project onto the subspace of the toric code with emergent fermions.Starting from the exact bosonization and applying Clifford finite-depth generalized local unitary transformation, we can achieve all possible fermion-to-qubit mappings (up to the re-pairing of Majorana fermions).In particular, we discover a new supercompact encoding using 1.25 qubits per fermion on the square lattice.We prove the existence of finite-depth quantum circuits to obtain fermion-to-qubit mappings with qubit-fermion ratios r = 1 + 1/2k for positive integers k, utilizing the trivialness of quantum cellular automata in two spatial dimensions.Also, we provide direct constructions of fermion-to-qubit mappings with ratios arbitrarily close to 1.When the ratio reaches 1, the fermion-to-qubit mapping reduces to the one-dimensional Jordan-Wigner transformation along a certain path in the two-dimensional lattice.Finally, we explicitly demonstrate that the Bravyi-Kitaev superfast simulation, the Verstraete-Cirac auxiliary method, Kitaev's exactly solved model, the Majorana loop stabilizer codes, and the compact fermion-to-qubit mapping can all be obtained from the exact bosonization.
Known mappings that encode fermionic modes into a bosonic qubit system are non-local transformations. In this paper we establish that this must necessarily be the case, if the locality graph is complex enough (for example for regular 2 d lattices). In particular we show that, in case of exact encodings, a fully local mapping is possible if and only if the locality graph is a tree. If instead we allow ourselves to also consider operators that only act fermionically on a subspace of the qubit Hilbert space, then we show that this subspace must be composed of long range entangled states, if the locality graph contains at least two overlapping cycles. This implies, for instance, that on 2 d lattices there exist states that are of low depth from the fermionic point of view, while in any encoding require a circuit of depth at least proportional to the system size to be prepared.
Mapping fermionic systems to qubits on a quantum computer is often the first step for algorithms in quantum chemistry and condensed matter physics. However, it is difficult to reconcile the many different approaches that have been proposed, such as those based on binary matrices, ternary trees, and stabilizer codes. This challenge is further exacerbated by the many ways to describe them -- transformation of Majorana operators, action on Fock states, encoder circuits, and stabilizers of local encodings -- making it challenging to know when the mappings are equivalent. In this work, we present a graphical framework for fermion-to-qubit mappings that streamlines and unifies various representations through the ZX-calculus. To start, we present the correspondence between linear encodings of the Fock basis and phase-free ZX-diagrams. The commutation rules of scalable ZX-calculus allows us to convert the fermionic operators to Pauli operators under any linear encoding. Next, we give a translation from ternary tree mappings to scalable ZX-diagrams, which not only directly represents the encoder map as a CNOT circuit, but also retains the same structure as the tree. Consequently, we graphically prove that ternary tree transformations are equivalent to linear encodings, a recent result by Chiew et al. The scalable ZX representation moreover enables us to construct an algorithm to directly compute the binary matrix for any ternary tree mapping. Lastly, we present the graphical representation of local fermion-to-qubit encodings. Its encoder ZX-diagram has the same connectivity as the interaction graph of the fermionic Hamiltonian and also allows us to easily identify stabilizers of the encoding.