 |
|
Subscribers:
to view the full text of a paper, click on the title of the paper. If you
have any problem to access the full text, please check with your librarian
or contact
qic@rintonpress.com
To subscribe to QIC, please click
Here.
|
Quantum
Information and Computation
ISSN: 1533-7146
published since 2001
|
|
Vol.14 No.11&12 September 2014 |
|
The computational power of matchgates and the XY interaction on
arbitrary graphs
(pp0901-0916)
Daniel J. Brod and
Andrew M. Childs
doi:
https://doi.org/10.26421/QIC14.11-12-1
Abstracts:
Matchgates are a restricted set of two-qubit gates known
to be classically simulable when acting on nearest-neighbor qubits on a
path, but universal for quantum computation when the qubits are arranged
on certain other graphs. Here we characterize the power of matchgates
acting on arbitrary graphs. Specifically, we show that they are
universal on any connected graph other than a path or a cycle, and that
they are classically simulable on a cycle. We also prove the same
dichotomy for the XY interaction, a proper subset of matchgates related
to some implementations of quantum computing.
Key words:
Matchgates, XY interaction, Encoded universality |
กก |
