A 1-covering path method reduces the CNOT cost of quantum hashing circuits on arbitrary qubit connectivity graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path
A 1-covering path method reduces the CNOT cost of quantum hashing circuits on arbitrary qubit connectivity graphs.