اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Generalization of Kochen-Specker Sets Relates Quantum Coloring to Entanglement-Assisted Channel Capacity
260
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce two generalizations of Kochen-Specker (KS) sets: projective KS sets and generalized KS sets. We then use projective KS sets to characterize all graphs for which the chromatic number is strictly larger than the quantum chromatic number. Here, the quantum chromatic number is defined via a nonlocal game based on graph coloring. We further show that from any graph with separation between these two quantities, one can construct a classical channel for which entanglement assistance increases the one-shot zero-error capacity. As an example, we exhibit a new family of classical channels with an exponential increase.
قيم البحث
اقرأ أيضاً
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmorelan
d capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.
Random numbers are required for a variety of applications from secure communications to Monte-Carlo simulation. Yet randomness is an asymptotic property and no output string generated by a physical device can be strictly proven to be random. We repor
t an experimental realization of a quantum random number generator (QRNG) with randomness certified by quantum contextuality and the Kochen-Specker theorem. The certification is not performed in a device-independent way but through a rigorous theoretical proof of each outcome being value-indefinite even in the presence of experimental imperfections. The analysis of the generated data confirms the incomputable nature of our QRNG.
Quantum cryptographic protocols based on complementarity are nonsecure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without requiring entangl
ement or spatially separated composite systems. We analyze the maximum tolerated noise to guarantee the security of a KS-protected cryptographic scheme against these attacks, and describe a photonic realization of this scheme using hybrid ququarts defined by the polarization and orbital angular momentum of single photons.
We propose an experimental approach to {it macro}scopically test the Kochen-Specker theorem (KST) with superconducting qubits. This theorem, which has been experimentally tested with single photons or neutrons, concerns the conflict between the conte
xtuality of quantum mechnaics (QM) and the noncontextuality of hidden-variable theories (HVTs). We first show that two Josephson charge qubits can be controllably coupled by using a two-level data bus produced by a Josephson phase qubit. Next, by introducing an approach to perform the expected joint quantum measurements of two separated Josephson qubits, we show that the proposed quantum circuits could demonstrate quantum contextuality by testing the KST at a macroscopic level.
In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
