Expressiveness of matchgates.
From MaRDI portal
Publication:1853537
DOI10.1016/S0304-3975(01)00325-5zbMath1051.68064MaRDI QIDQ1853537
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (max. 100)
Some observations on holographic algorithms ⋮ On blockwise symmetric matchgate signatures and higher domain \#CSP ⋮ On the theory of matchgate computations ⋮ On blockwise symmetric signatures for matchgates ⋮ Valiant's holant theorem and matchgate tensors ⋮ Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain ⋮ Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits ⋮ Evaluations of Tutte polynomials of regular graphs ⋮ Counting degree-constrained subgraphs and orientations ⋮ \(P\) versus \(NP\) and geometry ⋮ Holographic algorithms without matchgates ⋮ Holographic algorithms: from art to science ⋮ Undirected determinant and its complexity ⋮ Holographic algorithms beyond matchgates ⋮ Complexity classification of the six-vertex model ⋮ Signature theory in holographic algorithms ⋮ On the Complexity of Holant Problems ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits ⋮ Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems ⋮ Approximate counting for complex-weighted Boolean constraint satisfaction problems ⋮ Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP ⋮ On symmetric signatures in holographic algorithms ⋮ The complexity of planar Boolean \#CSP with complex weights ⋮ Holographic algorithms: the power of dimensionality resolved ⋮ FKT is not universal -- a planar holant dichotomy for symmetric constraints
Cites Work
- Quantum computational networks
- A complexity theory based on Boolean algebra
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computers that can be simulated classically in polynomial time
- Matrices and matroids for systems analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Expressiveness of matchgates.
