On block-wise symmetric signatures for matchgates

Authors:
Jin-Yi Cai;Pinyan Lu
Affiliations:
Computer Sciences Department, University of Wisconsin, Madison, WI;Department of Computer Science and Technology, Tsinghua University, Beijing, P. R. China
Venue:
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Year:
2007

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
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
Matrices and Matroids for Systems Analysis

Matrices and Matroids for Systems Analysis
Some results on matchgates and holographic algorithms

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

Basis Collapse in Holographic Algorithms

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Plücker identities.