Pages that link to "Item:Q3149866"
From MaRDI portal
The following pages link to Quantum Circuits That Can Be Simulated Classically in Polynomial Time (Q3149866):
Displaying 44 items.
- Erratum to: ``Signature theory in holographic algorithms'' (Q289936) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
- Generalized counting constraint satisfaction problems with determinantal circuits (Q472444) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- Signature theory in holographic algorithms (Q652529) (← links)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- On the theory of matchgate computations (Q841626) (← links)
- On blockwise symmetric signatures for matchgates (Q846363) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- On symmetric signatures in holographic algorithms (Q968267) (← links)
- Holographic algorithms: the power of dimensionality resolved (Q1014633) (← links)
- On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Complexity classification of the six-vertex model (Q1706146) (← links)
- Clifford gates in the Holant framework (Q1786604) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- Holographic algorithms without matchgates (Q1931767) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- Boundary theories of critical matchgate tensor networks (Q2092627) (← links)
- Evaluations of Tutte polynomials of regular graphs (Q2171029) (← links)
- Counting degree-constrained subgraphs and orientations (Q2174586) (← links)
- Free fermions behind the disguise (Q2244922) (← links)
- Valiant's holant theorem and matchgate tensors (Q2382280) (← links)
- Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits (Q2396823) (← links)
- On the satisfiability of quantum circuits of small treewidth (Q2411047) (← links)
- The rational approximations of the unitary groups (Q2443904) (← links)
- Exponential decay of correlations implies area law (Q2514213) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- Classical simulability, entanglement breaking, and quantum computation thresholds (Q3102424) (← links)
- On the Satisfiability of Quantum Circuits of Small Treewidth (Q3194714) (← links)
- A Complete Characterization of Unitary Quantum Space (Q4993267) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
- Holographic algorithms on domains of general size (Q6109063) (← links)
- Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths? (Q6156859) (← links)
- Undirected determinant and its complexity (Q6166664) (← links)
- The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
