Discovering optimal fermion-qubit mappings through algorithmic enumeration

Understand

Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits.

• A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit interactions, leading to easy-to-simulate qubit Hamiltonians.
• All fermion-qubit mappings must use a numbering scheme for the fermionic modes in order for translation to qubit operations.
• We make a distinction between the unordered labelling of fermions and the ordered labelling of the qubits.