اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAgile and versatile quantum communication: signatures and secrets
57
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Agile cryptography allows for a resource-efficient swap of a cryptographic core in case the security of an underlying classical cryptographic algorithm becomes compromised. Conversely, versatile cryptography allows the user to switch the cryptographic task without requiring any knowledge of its inner workings. In this paper, we suggest how these related principles can be applied to the field of quantum cryptography by explicitly demonstrating two quantum cryptographic protocols, quantum digital signatures (QDS) and quantum secret sharing (QSS), on the same hardware sender and receiver platform. Crucially, the protocols differ only in their classical post-processing. The system is also suitable for quantum key distribution (QKD) and is highly compatible with deployed telecommunication infrastructures, since it uses standard quadrature phase shift keying (QPSK) encoding and heterodyne detection. For the first time, QDS protocols are modified to allow for postselection at the receiver, enhancing protocol performance. The cryptographic primitives QDS and QSS are inherently multipartite and we prove that they are secure not only when a player internal to the task is dishonest, but also when (external) eavesdropping on the quantum channel is allowed. In our first proof-of-principle demonstration of an agile and versatile quantum communication system, the quantum states were distributed at GHz rates. This allows for a one-bit message to be securely signed using our QDS protocols in less than $0.05$~ms over a $2$~km fiber link and in less than $0.2$~s over a $20$~km fiber link. To our knowledge, this also marks the first demonstration of a continuous-variable direct QSS protocol.
قيم البحث
اقرأ أيضاً
Ouyang et al. proposed an $(n,n)$ threshold quantum secret sharing scheme, where the number of participants is limited to $n=4k+1,kin Z^+$, and the security evaluation of the scheme was carried out accordingly. In this paper, we propose an $(n,n)$ th
reshold quantum secret sharing scheme for the number of participants $n$ in any case ( $nin Z^+$ ). The scheme is based on a quantum circuit, which consists of Clifford group gates and Toffoli gate. We study the properties of the quantum circuit in this paper and use the quantum circuit to analyze the security of the scheme for dishonest participants.
No-cloning theorem, a profound fundamental principle of quantum mechanics, also provides a crucial practical basis for secure quantum communication. The security of communication can be ultimately guaranteed if the output fidelity via communication c
hannel is above the no-cloning bound (NCB). In quantum communications using continuous-variable (CV) systems, Gaussian states, more specifically, coherent states have been widely studied as inputs, but less is known for non-Gaussian states. We aim at exploring quantum communication covering CV states comprehensively with distinct sets of unknown states properly defined. Our main results here are (i) to establish the NCB for a broad class of quantum non-Gaussian states including Fock states, their superpositions and Schrodinger-cat states and (ii) to examine the relation between NCB and quantum non-Gaussianity (QNG). We find that NCB typically decreases with QNG. Remarkably, this does not mean that quantum non-Gaussian states are less demanding for secure communication. By extending our study to mixed-state inputs, we demonstrate that QNG specifically in terms of Wigner negativity requires more resources to achieve output fidelity above NCB in CV teleportation. The more non-Gaussian, the harder to achieve secure communication, which can have crucial implications for CV quantum communications.
Buhrman, Cleve and Wigderson (STOC98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f) denotes th
e bounded-error quantum query complexity of f. This is in contrast with the classical setting, where it is easy to show that R^{cc}(f o G) < 2 R(f), where R^{cc} and R denote bounded-error communication and query complexity, respectively. Chakraborty et al. (CCC20) exhibited a total function for which the log n overhead in the BCW simulation is required. We improve upon their result in several ways. We show that the log n overhead is not required when f is symmetric, generalizing a result of Aaronson and Ambainis for the Set-Disjointness function (Theory of Computing05). This upper bound assumes a shared entangled state, though for most symmetric functions the assumed number of entangled qubits is less than the communication and hence could be part of the communication. To prove this, we design an efficient distributed version of noisy amplitude amplification that allows us to prove the result when f is the OR function. In view of our first result, one may ask whether the log n overhead in the BCW simulation can be avoided even when f is transitive. We give a strong negative answer by showing that the log n overhead is still necessary for some transitive functions even when we allow the quantum communication protocol an error probability that can be arbitrarily close to 1/2. We also give, among other things, a general recipe to construct functions for which the log n overhead is required in the BCW simulation in the bounded-error communication model, even if the parties are allowed to share an arbitrary prior entangled state for free.
We report the experimental realization of squeezed quantum states of light, tailored for new applications in quantum communication and metrology. Squeezed states in a broad Fourier frequency band down to 1 Hz has been observed for the first time. Non
classical properties of light in such a low frequency band is required for high efficiency quantum information storage in electromagnetically induced transparency (EIT) media. The states observed also cover the frequency band of ultra-high precision laser interferometers for gravitational wave detection and can be used to reach the regime of quantum non-demolition interferometry. And furthermore, they cover the frequencies of motions of heavily macroscopic objects and might therefore support the attempts to observe entanglement in our macroscopic world.
We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not restricted. Alt
hough our result follows the idea of Azuma et al. [Nat. Comm. 7, 13523 (2016)] of splitting the network into two parts, our approach relaxes their strong restriction, consisting of the use of a single entanglement measure in the quantification of the maximum amount of entanglement generated by the channels. In particular, in our bound the measure can be chosen on a channel-by-channel basis, in order to make it as tight as possible. This enables us to apply the relative entropy of entanglement, which often gives a state-of-the-art upper bound, on every Choi-simulable channel in the network, even when the other channels do not satisfy this property. We also develop tools to compute, or bound, the max-relative entropy of entanglement for channels that are invariant under phase rotations. In particular, we present an analytical formula for the max-relative entropy of entanglement of the qubit amplitude damping channel.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
