Related papers: Security Enhancement of Quantum Noise Stream Ciphe…
We investigate the security of continuous-variable (CV) quantum key distribution (QKD) using coherent states in the presence of quadrature excess noise. We consider an eavesdropping attack which uses a linear amplifier and beam splitter.…
We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be…
Neural time-series data contain a wide variety of prototypical signal waveforms (atoms) that are of significant importance in clinical and cognitive research. One of the goals for analyzing such data is hence to extract such…
We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous…
Reshaping, a point operation that alters the characteristics of signals, has been shown capable of improving the compression ratio in video coding practices. Out-of-loop reshaping that directly modifies the input video signal was first…
Quantum bit seal is a way to encode a classical bit quantum mechanically so that everyone can obtain non-zero information on the value of the bit. Moreover, such an attempt should have a high chance of being detected by an authorized…
Learning with softmax cross-entropy on one-hot labels often leads to overconfident predictions and poor robustness under noise or perturbations. Label smoothing mitigates this by redistributing some confidence uniformly, but treats all…
In conventional quantum key distribution protocols, the secure key is normally extracted from the measurement outcomes of the system. Here, a different approach is proposed, where the secure key is extracted from the measurement bases,…
With the development of Shor's algorithm, some nondeterministic polynomial (NP) time problems (e.g. prime factorization problems and discrete logarithm problems) may be solved in polynomial time. In recent years, although some homomorphic…
In a world where elections touch every aspect of society, the need for secure voting is paramount. Traditional safeguards, based on classical cryptography, rely on complex math problems like factoring large numbers. However, quantum…
By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical "post-quantum" eavesdroppers…
We propose a theoretical scheme for secure quantum key distribution network following the ideas in quantum dense coding. In this scheme, the server of the network provides the service for preparing and measuring the Bell states, and the…
We construct an explicit quantum coding scheme which achieves a communication rate not less than the coherent information when used to transmit quantum information over a noisy quantum channel. For Pauli and erasure channels we also present…
The experimental realization of quantum information systems will be difficult due to how sensitive quantum information is to noise. Overcoming this sensitivity is central to designing quantum networks capable of transmitting quantum…
It is known that preprocessing noise may boost quantum key distribution by expanding the range of values of tolerated noise. For BB84, adding trusted noise may allow the generation of secret keys even for qubit error rate (QBER) beyond the…
Mutually unbiased bases have been extensively studied in the literature and are simple and effective in quantum key distribution protocols, but they are not optimal. Here equiangular spherical codes are introduced as a more efficient and…
We discuss a quantum key distribution scheme in which small phase and amplitude modulations of CW light beams carry the key information. The presence of EPR type correlations provides the quantum protection. We identify universal…
Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features…
In this paper, probabilistic shaping is numerically and experimentally investigated for increasing the transmission reach of wavelength division multiplexed (WDM) optical communication system employing quadrature amplitude modulation (QAM).…
A $n^d \xrightarrow{p} 1$ Quantum Random Access Code (QRAC) is a communication task where Alice encodes $n$ classical bits into quantum states of dimension $d$ and transmits them to Bob, who performs appropriate measurements to recover the…