Quantum term rewrite systems are introduced, and their polynomial-time terminating fragment characterizes the quantum complexity class FBQP.
Logical Methods in Computer Science , publisher =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.