Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userUnconditionally Secure Quantum Key Distribution In Higher Dimensions
73
0
0.0
(
0
)
Authors
H. F. Chau
Ask ChatGPT about the research
No Arabic abstract
In search of a quantum key distribution scheme that could stand up for more drastic eavesdropping attack, I discover a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power. Using the Shor-Preskill-type argument, I prove that this scheme is unconditional secure against all attacks allowed by the laws of quantum physics. Incidentally, for $N = 2^n > 2$, each information carrier can be replaced by $n$ entangled qubits. And in this case, I discover an eavesdropping attack on which no unentangled-qubit-based prepare-and-measure quantum key distribution scheme known to date can generate a provably secure key. In contrast, this entangled-qubit-based scheme produces a provably secure key under the same eavesdropping attack whenever $N geq 16$. This demonstrates the advantage of using entangled particles as information carriers to combat certain eavesdropping strategies.
rate research
Read More
Long-distance quantum communication requires quantum repeaters to overcome photon loss in optical fibers. Here we demonstrate a repeater node with two memory atoms in an optical cavity. Both atoms are individually and repeatedly entangled with photons that are distributed until each communication partner has independently received one of them. An atomic Bell-state measurement followed by classical communication serves to establish a key. We demonstrate scaling advantage of the key rate, increase the effective attenuation length by a factor of two, and beat the error-rate threshold of 11% for unconditionally secure communication, the corner stones for repeater-based quantum networks.
Continuous-variable quantum key distribution (CV-QKD) with discrete modulation has received widespread attentions because of its experimental simplicity, lower-cost implementation and ease to multiplex with classical optical communication. Recently, some inspiring numerical methods have been applied to analyse the security of discrete-modulated CV-QKD against collective attacks, which promises to obtain considerable key rate over one hundred kilometers of fiber distance. However, numerical methods require up to ten minutes to calculate a secure key rate one time using a high-performance personal computer, which means that extracting the real-time secure key rate is impossible for discrete-modulated CV-QKD system. Here, we present a neural network model to quickly predict the secure key rate of homodyne detection discrete-modulated CV-QKD with good accuracy based on experimental parameters and experimental results. With the excess noise of about $0.01$, the speed of our method is improved by about seven orders of magnitude compared to that of the conventional numerical method. Our method can be extended to quickly solve complex security key rate calculation of a variety of other unstructured quantum key distribution protocols.
The fabrication of quantum key distribution (QKD) systems typically involves several parties, thus providing Eve with multiple opportunities to meddle with the devices. As a consequence, conventional hardware and/or software hacking attacks pose natural threats to the security of practical QKD. Fortunately, if the number of corrupted devices is limited, the security can be restored by using redundant apparatuses. Here, we report on the demonstration of a secure QKD setup with optical devices and classical post-processing units possibly controlled by an eavesdropper. We implement a 1.25 GHz chip-based measurement-device-independent QKD system secure against malicious devices on emph{both} the measurement and the users sides. The secret key rate reaches 137 bps over a 24 dB channel loss. Our setup, benefiting from high clock rate, miniaturized transmitters and a cost-effective structure, provides a promising solution for widespread applications requiring uncompromising communication security.
Device-independent quantum key distribution (DIQKD) provides the strongest form of secure key exchange, using only the input-output statistics of the devices to achieve information-theoretic security. Although the basic security principles of DIQKD are now well-understood, it remains a technical challenge to derive reliable and robust security bounds for advanced DIQKD protocols that go beyond the existing results based on violations of the CHSH inequality. In this Letter, we present a framework based on semi-definite programming that gives reliable lower bounds on the asymptotic secret key rate of any QKD protocol using untrusted devices. In particular, our method can in principle be utilized to find achievable secret key rates for any DIQKD protocol, based on the full input-output probability distribution or any choice of Bell inequality. Our method also extends to other DI cryptographic tasks.
Quantum key distribution (QKD) permits information-theoretically secure transmission of digital encryption keys, assuming that the behaviour of the devices employed for the key exchange can be reliably modelled and predicted. Remarkably, no assumptions have to be made on the capabilities of an eavesdropper other than that she is bounded by the laws of Nature, thus making the security of QKD unconditional. However, unconditional security is hard to achieve in practice. For example, any experimental realisation can only collect finite data samples, leading to vulnerabilities against coherent attacks, the most general class of attacks, and for some protocols the theoretical proof of robustness against these attacks is still missing. For these reasons, in the past many QKD experiments have fallen short of implementing an unconditionally secure protocol and have instead considered limited attacking capabilities by the eavesdropper. Here, we explore the security of QKD against coherent attacks in the most challenging environment: the long-distance transmission of keys. We demonstrate that the BB84 protocol can provide positive key rates for distances up to 240 km without multiplexing of conventional signals, and up to 200 km with multiplexing. Useful key rates can be achieved even for the longest distances, using practical thermo-electrically cooled single-photon detectors.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
