Fermionic quantum computation

Details Fermionic quantum computation Fermionic quantum computation

2000-03-29

arxiv.org/abs/quant-ph/0003137v2

Annals of Physics, Vol. 298, Iss. 1 (2002) pp.210-226

Physics

Quantum Physics

18 pages, Latex; one reference added

Scientific paper

10.1006/aphy.2002.6254

We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits, simulation of one fermionic gate takes $O(m)$ qubit gates and vice versa. We show that using different encodings, the simulation cost can be reduced to $O(\log m)$ and a constant, respectively. Nearest-neighbors fermionic gates on a graph of bounded degree can be simulated at a constant cost. A universal set of fermionic gates is found. We also study computation with Majorana fermions which are basically halves of LFMs. Some connection to qubit quantum codes is made.

Affiliated with

Also associated with

No associations

Rating

Fermionic quantum computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fermionic quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fermionic quantum computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-202108