Matchgate and space-bounded quantum computations are equivalent

DOI10.1098/RSPA.2009.0433MaRDI QIDQ4931028zbMATH OpenOpenAlexWikidataFDO

Authors Richard Jozsa, Barbara Kraus, Akimasa Miyake, John Watrous

Publication date 2 October 2010

Published in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0908.1467

zbMATH Keywords

quantum computational complexityquantum matchgatesspace-bounded computation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Abstract: Matchgates are an especially multiflorous class of two-qubit nearest neighbour quantum gates, defined by a set of algebraic constraints. They occur for example in the theory of perfect matchings of graphs, non-interacting fermions, and one-dimensional spin chains. We show that the computational power of circuits of matchgates is equivalent to that of space-bounded quantum computation with unitary gates, with space restricted to being logarithmic in the width of the matchgate circuit. In particular, for the conventional setting of polynomial-sized (logarithmic-space generated) families of matchgate circuits, known to be classically simulatable, we characterise their power as coinciding with polynomial-time and logarithmic-space bounded universal unitary quantum computation.

Recommendations

• Quantum matchgate computations and linear threshold gates
• Matchgates and classical simulation of quantum circuits
• Matchgates revisited
• Expressiveness of matchgates.
• On the theory of matchgate computations

Cites work

• Matchgates and classical simulation of quantum circuits

Cited in

(12)

• Clifford gates in the Holant framework
• Expressiveness of matchgates.
• Effective simulation of state distribution in qubit chains
• Quantum matchgate computations and linear threshold gates
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
• Matchgates revisited
• A complete characterization of unitary quantum space
• Clifford Algebras, Spin Groups and Qubit Trees
• Matchgate shadows for fermionic quantum simulation
• Commuting quantum circuits and complexity of Ising partition functions
• Gaussianity and simulability of Cliffords and matchgates
• Quantum catalytic space

This page was built for publication: Matchgate and space-bounded quantum computations are equivalent

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