Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Electronic Notes in Discrete Mathematics

Huge Quantum Broadcast Channels and Cryptographic Applications for Separable States

Rainer Wilmink

Published Aug 1, 2005• 7 citations
Publisher
DOI
10.1016/j.endm.2005.07.054

Related papers

Cryptographic Applications for Separable States

Rainer Wilmink

•Jan 1, 2003•0 citations

Decomposition of bipartite states with applications to quantum no-broadcasting theorems

Shunlong Luo, Wei Sun

Correlations in bipartite quantum states are fundamental objects in quantum information theory. A canonical framework for studying correlations is the entangled versus separable dichotomy in which the decompositions of separable states as convex combinations of product states play an instrumental role. In this paper, motivated by both the representation of separable states and quantum no-broadcasting considerations, we establish a constructive decomposition representation for any bipartite state. As applications, we prove the conjectures proposed by Luo [Lett. Math. Phys. 92, 143 (2010)] concerning no-unilocal broadcasting for quantum correlations and further provide a unified picture for the celebrated quantum no-broadcasting theorem for noncommuting states by Barnum et al. [Phys. Rev. Lett. 76, 2818 (1996)], and the elegant no-local-broadcasting theorem for quantum correlations by Piani et al. [Phys. Rev. Lett. 100, 090502 (2008)]. The results reveal some intrinsic relation between quantumness of correlations and noncommutativity of states, and in particular, provide a characterization for zero quantum discord introduced by Ollivier and Zurek [Phys. Rev. Lett. 88, 017901 (2001)] from the broadcasting perspective. Furthermore, it is indicated that the distinction between the decomposition for general bipartite states and that for separable states might be useful in studying entanglement versus separability.

Physical Review A•Jul 30, 2010•65 citations

Secure Communication Through Quantum Channels: A Study of Quantum Cryptography

Seema Ukidve, Ramsagar Yadav, Mukhdeep Singh Manshahia +1 more

Lecture notes in networks and systems•Jan 1, 2023•6 citations

Quantum Communication and Quantum Cryptography

David S. Simon

Undergraduate texts in physics•Jan 1, 2025•1 citation

Synchronization of High-Speed Quantum Random Number Generators via Digital Television Channels

Олексій Нарєжній, Tetiana Grinenko, Maksym Trotsko +1 more

The problem of synchronizing the process of generating secret keys by quantum random number generators via different communication channels is relevant for promising cryptographic complexes for various purposes. Reference timestamps broadcast by Global Navigation Satellite Systems of various countries have found wide application in synchronization systems for the generation and transmission of cryptographic keys. Signals from these systems are susceptible to spoofing and jamming attacks, which have been implemented in practice by various researchers. Therefore, it is proposed to use digital television channels as an alternative channel for transmitting timestamps. The process of synchronization using signals from digital television channels is understudied.This paper presents an algorithm for extracting reference timestamps from the wavelet spectrum of an image broadcast on digital television channels. The algorithm is based on the selection of the vector of wavelet coefficients of the video signal fragment corresponding to the timestamp. The procedure for extracting the wavelet spectrum of the timestamp is carried out using a multilayer neural network. Timestamps are used to temporally synchronize the process of generating secret keys by a quantum random number generator.

International Scientific-Practical Conference Problems of Infocommunications Science and Technology•Oct 6, 2020•0 citations

Theoretical Modeling of Ising Spin Communication Channels With Relaxed-State Modulation

Merve Bardak, Burhan Gülbahar

Ising networks and spin glasses are foundational models for optimization, sampling and quantum annealing, with exact ground-state inference NP-hard for frustrated nonplanar and 3D instances. To our knowledge, this is the first framework using the relaxed freeze-out state of an Ising medium as a classical communication carrier. Bits are written by local perturbations of the couplingsJijand fieldshi, and decoded by private differential readout, unlike propagating-wave, magnonic and quantum state-transfer schemes. The scheme targets an operational bit-error-rate (BER) separation (eavesdropper-disadvantage) property against passive public-feature observers, not a cryptographic guarantee or secrecy-capacity claim. We simulate 2D channels up to 16 × 16 and 3D 5 × 5 × 5 channels at signal-to-noise ratios (SNRs) up to 30 dB. In this computational proof of concept, which assumes exact per-symbol ground-state inference in 2D, Bob reaches low empirical BERs while the specified observers do not. On the 24 channels the protocol enrolls by harvesting at 20 dB, ten passive decoders have median paired BER gaps of 0.142–0.216, each with a conservative 95% interval above zero, and Bob is unbeaten by all ten on 18 of the 24 channels; every exception is reported. Without reselection, the gap against the screening adversaries stays positive on all 24 channels at SNRs of 16–28 dB. The tested finite-time relaxation dynamics did not reproduce the exact-solver separation.Adecoder trained on labelled symbols of the attacked channel collapses the separation, restricting the claim to single-use channels. The architecture is a candidate low-rate physical-layer mechanism for nanoscale broadcast signalling; authentication and key establishment are potential future applications.

IEEE Access•Jan 1, 2026•0 citations
Correlations in bipartite quantum states are fundamental objects in quantum information theory. A canonical framework for studying correlations is the entangled versus separable dichotomy in which the decompositions of separable states as convex combinations of product states play an instrumental role. In this paper, motivated by both the representation of separable states and quantum no-broadcasting considerations, we establish a constructive decomposition representation for any bipartite state. As applications, we prove the conjectures proposed by Luo [Lett. Math. Phys. 92, 143 (2010)] concerning no-unilocal broadcasting for quantum correlations and further provide a unified picture for the celebrated quantum no-broadcasting theorem for noncommuting states by Barnum et al. [Phys. Rev. Lett. 76, 2818 (1996)], and the elegant no-local-broadcasting theorem for quantum correlations by Piani et al. [Phys. Rev. Lett. 100, 090502 (2008)]. The results reveal some intrinsic relation between quantumness of correlations and noncommutativity of states, and in particular, provide a characterization for zero quantum discord introduced by Ollivier and Zurek [Phys. Rev. Lett. 88, 017901 (2001)] from the broadcasting perspective. Furthermore, it is indicated that the distinction between the decomposition for general bipartite states and that for separable states might be useful in studying entanglement versus separability.
The problem of synchronizing the process of generating secret keys by quantum random number generators via different communication channels is relevant for promising cryptographic complexes for various purposes. Reference timestamps broadcast by Global Navigation Satellite Systems of various countries have found wide application in synchronization systems for the generation and transmission of cryptographic keys. Signals from these systems are susceptible to spoofing and jamming attacks, which have been implemented in practice by various researchers. Therefore, it is proposed to use digital television channels as an alternative channel for transmitting timestamps. The process of synchronization using signals from digital television channels is understudied.This paper presents an algorithm for extracting reference timestamps from the wavelet spectrum of an image broadcast on digital television channels. The algorithm is based on the selection of the vector of wavelet coefficients of the video signal fragment corresponding to the timestamp. The procedure for extracting the wavelet spectrum of the timestamp is carried out using a multilayer neural network. Timestamps are used to temporally synchronize the process of generating secret keys by a quantum random number generator.
Ising networks and spin glasses are foundational models for optimization, sampling and quantum annealing, with exact ground-state inference NP-hard for frustrated nonplanar and 3D instances. To our knowledge, this is the first framework using the relaxed freeze-out state of an Ising medium as a classical communication carrier. Bits are written by local perturbations of the couplingsJijand fieldshi, and decoded by private differential readout, unlike propagating-wave, magnonic and quantum state-transfer schemes. The scheme targets an operational bit-error-rate (BER) separation (eavesdropper-disadvantage) property against passive public-feature observers, not a cryptographic guarantee or secrecy-capacity claim. We simulate 2D channels up to 16 × 16 and 3D 5 × 5 × 5 channels at signal-to-noise ratios (SNRs) up to 30 dB. In this computational proof of concept, which assumes exact per-symbol ground-state inference in 2D, Bob reaches low empirical BERs while the specified observers do not. On the 24 channels the protocol enrolls by harvesting at 20 dB, ten passive decoders have median paired BER gaps of 0.142–0.216, each with a conservative 95% interval above zero, and Bob is unbeaten by all ten on 18 of the 24 channels; every exception is reported. Without reselection, the gap against the screening adversaries stays positive on all 24 channels at SNRs of 16–28 dB. The tested finite-time relaxation dynamics did not reproduce the exact-solver separation.Adecoder trained on labelled symbols of the attacked channel collapses the separation, restricting the claim to single-use channels. The architecture is a candidate low-rate physical-layer mechanism for nanoscale broadcast signalling; authentication and key establishment are potential future applications.