A new tableau algorithm simulates a broader class of quantum circuits than stabilizer circuits using CNC phase-space operators, with O(n^2)-per-measurement complexity.
Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We introduce a new classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios, capable of simulating universal measurement-based quantum computation with single-qubit Pauli measurements. In our model, the simultaneous presence of non-stabilizerness and entanglement is necessary for quantum speedup. The region of quantum states that can be efficiently simulated includes the Bell polytope and extends beyond what is currently achievable by sampling algorithms based on phase space methods.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Phase space tableau simulation for quantum computation
A new tableau algorithm simulates a broader class of quantum circuits than stabilizer circuits using CNC phase-space operators, with O(n^2)-per-measurement complexity.