An O(n^3) algorithm builds quantum hashing and QFT circuits on cactus qubit graphs by solving the shortest non-simple 1-covering path problem in polynomial time.
Exponential separation be- tween quantum and classical ordered binary decision diagrams, reordering method and hierarchies.Natural Computing, 22(4):723–736
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
An O(n^3) algorithm builds quantum hashing and QFT circuits on cactus qubit graphs by solving the shortest non-simple 1-covering path problem in polynomial time.