A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Matrices and Matroids for Systems Analysis
Matrices and Matroids for Systems Analysis
Progress in computational complexity theory
Journal of Computer Science and Technology
Holographic algorithms: from art to science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Holographic algorithms with unsymmetric signatures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Holographic algorithms: guest column
ACM SIGACT News
Basis Collapse in Holographic Algorithms
Computational Complexity
Holographic algorithms: The power of dimensionality resolved
Theoretical Computer Science
On blockwise symmetric signatures for matchgates
Theoretical Computer Science
On symmetric signatures in holographic algorithms
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Journal of Symbolic Computation
Holographic algorithms: From art to science
Journal of Computer and System Sciences
A trichotomy theorem for the approximate counting of complex-weighted bounded-degree boolean CSPs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Some results on matchgates and holographic algorithms
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Theoretical Computer Science
On block-wise symmetric signatures for matchgates
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Holographic algorithms: the power of dimensionality resolved
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The complexity of planar boolean #CSP with complex weights
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 5.23 |
Matchgates have been used to simulate classically in polynomial time assemblies of quantum gates. In this paper it is shown that every matchgate for 2-input 2-output functions has to obey a certain set of five polynomial identities. It is also shown that no matchgate can realize a nontrivial control gate for any number of inputs. On the other hand, it is proved that classical Boolean formulae can be expressed as matchcircuits of polynomial size.