Pages that link to "Item:Q5175959"
From MaRDI portal
The following pages link to Quantum computers that can be simulated classically in polynomial time (Q5175959):
Displaying 13 items.
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
- Computing the Tutte polynomial of lattice path matroids using determinantal circuits (Q496045) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- A note on observables for counting trails and paths in graphs (Q846173) (← links)
- Tensor decomposition and homotopy continuation (Q1679672) (← links)
- Expressiveness of matchgates. (Q1853537) (← links)
- Holographic algorithms without matchgates (Q1931767) (← links)
- Effective simulation of state distribution in qubit chains (Q1994706) (← links)
- A finite-tame-wild trichotomy theorem for tensor diagrams (Q2189491) (← links)
- The Hitchhiker guide to: secant varieties and tensor decomposition (Q2337279) (← links)
- Super-quantum states in \(\mathrm{SU}(2)\) invariant \(3\times N\) level systems (Q2398355) (← links)
- Phase space methods for Majorana fermions (Q3176515) (← links)
- Clifford Algebras, Spin Groups and Qubit Trees (Q5876545) (← links)
