Hypercube topology for quantum-walk-based one-way QKD yields significantly higher security and noise resistance than the circular state-of-the-art in simulations.
Quantum cryptography based on bell’s theorem
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
Variational quantum states representing weighted graphs have their entanglement and correlators determined by the local edge-weight structure around each vertex.
A unified processing chain for E91-style QKD on Werner states provides a proof for optimal measurement bases achieving Devetak-Winter capacity, a new strategy versus common approaches, and quantitative guidance on optimal entanglement distillation.
Simulations show noise lowers CHSH values in DIQKD while Cascade error correction reduces bit-error rates, with most fixes occurring in the first few iterative rounds.
citing papers explorer
-
Strengthening security and noise resistance in one-way quantum key distribution protocols through hypercube-based quantum walks
Hypercube topology for quantum-walk-based one-way QKD yields significantly higher security and noise resistance than the circular state-of-the-art in simulations.
-
Properties of multi-qubit variational quantum states representing weighted graphs and their computing with quantum programming
Variational quantum states representing weighted graphs have their entanglement and correlators determined by the local edge-weight structure around each vertex.
-
Processing Entangled Links Into Secure Cryptographic Keys
A unified processing chain for E91-style QKD on Werner states provides a proof for optimal measurement bases achieving Devetak-Winter capacity, a new strategy versus common approaches, and quantitative guidance on optimal entanglement distillation.
-
On the Interplay Between Noise, Bell Violation, and Cascade Error Correction in Device-Independent Quantum Key Distribution
Simulations show noise lowers CHSH values in DIQKD while Cascade error correction reduces bit-error rates, with most fixes occurring in the first few iterative rounds.