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.
Efficient algorithms for solving the shortest covering path problem.Transportation Science, 28(4):317–327
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.