Quantum catalytic logspace is claimed to be computable in polynomial time exactly and to simulate TC1 threshold circuits.
Mixon (https://mathoverflow.net/users/29873/dustin-g mixon)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Quantum Catalytic Space
Quantum catalytic logspace is claimed to be computable in polynomial time exactly and to simulate TC1 threshold circuits.