Quantum term rewrite systems are introduced, and their polynomial-time terminating fragment characterizes the quantum complexity class FBQP.
Logic for Programming, Artificial Intelligence, and Reasoning , publisher =
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
fields
cs.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Term Rewrite Systems: Applications to Complexity Analysis
Quantum term rewrite systems are introduced, and their polynomial-time terminating fragment characterizes the quantum complexity class FBQP.