Fermionic quantum computation

From MaRDI portal
Publication:699059

DOI10.1006/APHY.2002.6254zbMATH Open0995.81012arXivquant-ph/0003137OpenAlexW2027003240MaRDI QIDQ699059FDOQ699059

Sergey Bravyi, Alexei Yu. Kitaev

Publication date: 1 October 2002

Published in: Annals of Physics (Search for Journal in Brave)

Abstract: 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(logm) 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.


Full work available at URL: https://arxiv.org/abs/quant-ph/0003137




Recommendations




Cites Work


Cited In (64)





This page was built for publication: Fermionic quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699059)