Quantum computers that can be simulated classically in polynomial time

DOI10.1145/380752.380785zbMath1323.68283OpenAlexW2069149225MaRDI QIDQ5175959

Leslie G. Valiant

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380785

Mathematics Subject Classification ID

Related Items (14)

Phase space methods for Majorana fermions ⋮ A note on observables for counting trails and paths in graphs ⋮ Super-quantum states in \(\mathrm{SU}(2)\) invariant \(3\times N\) level systems ⋮ Unnamed Item ⋮ \(P\) versus \(NP\) and geometry ⋮ Tensor decomposition and homotopy continuation ⋮ Holographic algorithms without matchgates ⋮ A finite-tame-wild trichotomy theorem for tensor diagrams ⋮ A collapse theorem for holographic algorithms with matchgates on domain size at most 4 ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits ⋮ Effective simulation of state distribution in qubit chains ⋮ The Hitchhiker guide to: secant varieties and tensor decomposition ⋮ Expressiveness of matchgates. ⋮ Clifford Algebras, Spin Groups and Qubit Trees

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Quantum computers that can be simulated classically in polynomial time