A Theory for Valiant's Matchcircuits (Extended Abstract)
| dc.creator | Li, Angsheng | |
| dc.creator | Xia, Mingji | |
| dc.date | 2008-02-20 | |
| dc.date.accessioned | 2026-07-07T09:22:03Z | |
| dc.date.available | 2026-07-07T09:22:03Z | |
| dc.description | 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). | |
| dc.identifier | https://arxiv.org/abs/0802.2860 | |
| dc.identifier | http://arxiv.org/abs/0802.2860 | |
| dc.identifier | Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155244 | |
| dc.subject | Computational Complexity | |
| dc.title | A Theory for Valiant's Matchcircuits (Extended Abstract) | |
| dc.type | text |