Geometries for universal quantum computation with matchgates
Quantum Physics
2012-11-08 v2
Abstract
Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with longer-range interactions. We describe various alternative geometries with nearest-neighbor interactions that result in universal quantum computation with matchgates only, including subtle departures from the chain. Our results pave the way for new quantum computer architectures that rely solely on the simple interactions associated with matchgates.
Cite
@article{arxiv.1207.2126,
title = {Geometries for universal quantum computation with matchgates},
author = {Daniel J. Brod and Ernesto F. Galvão},
journal= {arXiv preprint arXiv:1207.2126},
year = {2012}
}
Comments
6 pages, 4 figures. Updated version includes an appendix extending one of the results