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
2 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.
2
Pith papers citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
Mini-games on Bloch sphere, entanglement, and circuits produced higher post-game knowledge scores than pre-game scores in a learner study.
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.
-
QubitQuest: Learning Quantum Computing through Mini-Games
Mini-games on Bloch sphere, entanglement, and circuits produced higher post-game knowledge scores than pre-game scores in a learner study.