A quantized Fisher-Yates shuffle builds five quantum circuits for uniform permutation superpositions with O(n log n) qubits and up to O(n^2 log^2 n) gates, though the headline says O(n^2 log n).
Quantum no-key protocol for secure communication of classical message
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are designed to resist middleman attack for two parties preshared authentication key, and achieve perfect mutual data origin authentication which ensures the permanent reusing of authentication key. Finally, we simplify the protocol to a 4-round one, and show that any protocol with 3 or less rounds cannot achieve perfect security without consuming preshared key.
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations
A quantized Fisher-Yates shuffle builds five quantum circuits for uniform permutation superpositions with O(n log n) qubits and up to O(n^2 log^2 n) gates, though the headline says O(n^2 log n).