|
| related topics |
| {operator, operators, space} |
| {qubit, qubits, gate} |
| {error, code, errors} |
| {let, theorem, proof} |
| {observables, space, algebra} |
| {algorithm, log, probability} |
| {temperature, thermal, energy} |
| {time, systems, information} |
| {bell, inequality, local} |
| {state, states, coherent} |
| {field, particle, equation} |
| {phase, path, phys} |
| {energy, state, states} |
| {group, space, representation} |
| {time, decoherence, evolution} |
|
Fermionic quantum computation
Sergey Bravyi, Alexei Kitaev
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(\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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0003137
- categories:
- quant-ph
- comments:
- 18 pages, Latex; one reference added
- doi:
- 10.1006/aphy.2002.6254
- arxiv_id:
- quant-ph/0003137
- journal_ref:
- Annals of Physics, Vol. 298, Iss. 1 (2002) pp.210-226
- created:
- 2000-03-29
- updated:
- 2000-03-31
Full article ▸
|
|
| related documents |
| 9905037v1 |
| 0608177v2 |
| 0506249v2 |
| 0407213v1 |
| 0211194v1 |
| 9512014v1 |
| 0209054v1 |
| 0304054v2 |
| 0012067v1 |
| 0410001v3 |
| 0305038v2 |
| 0206112v1 |
| 0308167v1 |
| 0408081v5 |
| 0305134v1 |
| 0304078v1 |
| 0511041v1 |
| 0610105v1 |
| 0504197v1 |
| 0506062v2 |
| 0411058v1 |
| 0109016v2 |
| 0311069v1 |
| 0505122v2 |
| 0512058v3 |
|