A Pauli-constraint-based programming model for quantum computers is proved equivalent to the standard circuit model, universal for BQP, with O(D^2 N log N) emulation overhead.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum circuit design via dynamic Pauli constraints
A Pauli-constraint-based programming model for quantum computers is proved equivalent to the standard circuit model, universal for BQP, with O(D^2 N log N) emulation overhead.