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.
Universal quantum computation with ideal clifford gates and noisy ancillas,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 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.