LIPIcs.STACS.2008.1368.pdf
- Filesize: 228 kB
- 12 pages
Document
A Theory for Valiant's Matchcircuits (Extended Abstract)
Authors
-
Part of:
Volume:
25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2008-02-06
Cite AsGet BibTex
Angsheng Li and Mingji Xia. A Theory for Valiant's Matchcircuits (Extended Abstract). In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 491-502, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/LIPIcs.STACS.2008.1368
https://doi.org/10.4230/LIPIcs.STACS.2008.1368
Abstract
The computational function of a matchgate is represented by its
character matrix. In this article, we show that all nonsingular
character matrices are closed under matrix inverse operation, so
that for every $k$, the nonsingular character matrices of $k$-bit
matchgates form a group, extending the recent work of Cai and
Choudhary (2006) of the same result for the case of $k=2$, and that
the single and the two-bit matchgates are universal for
matchcircuits, answering a question of Valiant (2002).
Keywords
- Pfaffian
- Matchgate
- Matchcircuit
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads