- Home »
- The computational power of matchgates and the XY interaction on arbitrary graphs

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 gates can also act on more distant qubits. In this talk, I will address the power of matchgates when they can act on pairs of qubits according to the edges of arbitrary graphs. Specifically, we show that matchgates 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 that the same dichotomy holds for the XY interaction, a proper subset of matchgates that arises naturally in some implementations of quantum computing. This is based on a joint work with Ernesto Galvão and another with Andrew Childs.

Collection/Series:

Event Type:

Seminar

Scientific Area(s):

Speaker(s):

Event Date:

Wednesday, January 8, 2014 - 16:00 to 17:30

Location:

Time Room

©2012 Perimeter Institute for Theoretical Physics