Majorana-based fermionic quantum computation
T. E. O'Brien, P. Ro\.zek, and A. R. Akhmerov

TL;DR
This paper introduces a fermionic quantum computing architecture leveraging Majorana zero modes, enabling noise protection, efficient algorithms, and universal topologically protected gates with fewer Majoranas than traditional methods.
Contribution
The authors present a novel fermionic quantum computing scheme using only two Majoranas per fermionic mode, reducing overhead and avoiding Jordan-Wigner transformation.
Findings
Supports variational quantum eigensolver and phase estimation algorithms.
Achieves lower overhead for quantum chemistry simulations.
Demonstrates magic state distillation for universal gates.
Abstract
Because Majorana zero modes store quantum information non-locally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal fermionic quantum computation. Our architecture requires only two Majoranas to encode a fermionic quantum degree of freedom, compared to alternative implementations which require a minimum of four Majoranas for a spin quantum degree of freedom. The fermionic degrees of freedom support both unitary coupled cluster variational quantum eigensolver and quantum phase estimation algorithms, proposed for quantum chemistry simulations. Because we avoid the Jordan-Wigner transformation, our scheme has a lower overhead for implementing both of these algorithms, and the simulation of Trotterized Hubbard Hamiltonian in time per unitary step. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
