Expressiveness of matchgates.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1033441 (Why is no real title available?)
- A complexity theory based on Boolean algebra
- Combinatorial matrix theory
- Matrices and matroids for systems analysis
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computational networks
- Quantum computers that can be simulated classically in polynomial time
Cited in
(26)- Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
- Counting degree-constrained subgraphs and orientations
- On blockwise symmetric signatures for matchgates
- A theory for Valiant's matchcircuits (Extended abstract)
- Matchgate and space-bounded quantum computations are equivalent
- On the Complexity of Holant Problems
- Undirected determinant and its complexity
- On blockwise symmetric matchgate signatures and higher domain \#CSP
- Signature theory in holographic algorithms
- On the theory of matchgate computations
- \(P\) versus \(NP\) and geometry
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- Holographic algorithms: from art to science
- Computing the Tutte polynomial of lattice path matroids using determinantal circuits
- Some observations on holographic algorithms
- A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
- On symmetric signatures in holographic algorithms
- Holographic algorithms: the power of dimensionality resolved
- Evaluations of Tutte polynomials of regular graphs
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- Holographic algorithms without matchgates
- Complexity classification of the six-vertex model
- Quantum matchgate computations and linear threshold gates
- Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits
- Valiant's holant theorem and matchgate tensors
This page was built for publication: Expressiveness of matchgates.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853537)
