On blockwise symmetric signatures for matchgates

Authors:
Jin-Yi Cai;Pinyan Lu
Affiliations:
Computer Sciences Department, University of Wisconsin, Madison, WI 53706, USA;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, PR China
Venue:
Theoretical Computer Science
Year:
2010

Citing 8
Cited 1

Quantum Circuits That Can Be Simulated Classically in Polynomial Time

SIAM Journal on Computing
Expressiveness of matchgates

Theoretical Computer Science
Holographic Algorithms (Extended Abstract)

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Accidental Algorthims

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Holographic algorithms: from art to science

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the Theory of Matchgate Computations

CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
On symmetric signatures in holographic algorithms

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Some results on matchgates and holographic algorithms

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Holographic reduction: a domain changed application and its partial converse theorems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give a classification of blockwise symmetric signatures in the theory of matchgate computations. The main proof technique uses matchgate identities, also known as useful Grassmann-Plucker identities.