Bravyi-Kitaev Superfast simulation of fermions on a quantum computer

Understand

Present quantum computers often work with distinguishable qubits as their computational units.

• In order to simulate indistinguishable fermionic particles, it is first required to map the fermionic state to the state of the qubits.
• The Bravyi-Kitaev Superfast (BKSF) algorithm can be used to accomplish this mapping.
• The BKSF mapping has connections to quantum error correction and opens the door to new ways of understanding fermionic simulation in a topological context.