اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSpatial versus Sequential Correlations for Random Access Coding
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Random access codes are important for a wide range of applications in quantum information. However, their implementation with quantum theory can be made in two very different ways: (i) by distributing data with strong spatial correlations violating a Bell inequality, or (ii) using quantum communication channels to create stronger-than-classical sequential correlations between state preparation and measurement outcome. Here, we study this duality of the quantum realization. We present a family of Bell inequalities tailored to the task at hand and study their quantum violations. Remarkably, we show that the use of spatial and sequential quantum correlations imposes different limitations on the performance of quantum random access codes. We also show that there exist random access codes for which spatial quantum correlations offer no gain over classical strategies, whereas sequential quantum correlations can yield an advantage. We discuss the physics behind the observed discrepancy between spatial and sequential quantum correlations.
قيم البحث
اقرأ أيضاً
Quantum information protocols can be realized using the `prepare and measure setups which do not require sharing quantum correlated particles. In this work, we study the equivalence between the quantumness in a prepare and measure scenario involving
independent devices, which implements quantum random number generation, and the quantumness in the corresponding scenario which realizes the same task with spatially separated correlated particles. In particular, we demonstrate that quantumness of sequential correlations observed in the prepare and measure scenario gets manifested as superunsteerability, which is a particular kind of spatial quantum correlation in the presence of limited shared randomness. In this scenario consisting of spatially separated quantum correlated particles as resource for implementing the quantum random number generation protocol, we define an experimentally measurable quantity which provides a bound on the amount of genuine randomness generation. Next, we study the equivalence between the quantumness of the prepare and measure scenario in the presence of shared randomness, which has been used for implementing quantum random-access codes, and the quantumness in the corresponding scenario which replaces quantum communication by spatially separated quantum correlated particles. In this case, we demonstrate that certain sequential correlations in the prepare and measure scenario in the presence of shared randomness, which have quantumness but do not provide advantage for random-access codes, can be used to provide advantage when they are realized as spatial correlations in the presence of limited shared randomness. We point out that these spatial correlations are superlocal correlations, which are another kind of spatial quantum correlations in the presence of limited shared randomness, and identify inequalities detecting superlocality.
We address the problem of whether parties who cannot communicate but share nonsignaling quantum correlations between the outcomes of sharp measurements can distinguish, just from the value of a correlation observable, whether their outcomes were prod
uced by sequential compatible measurements on single systems or by measurements on spatially separated subsystems. We show that there are quantum correlations between the outcomes of sequential measurements which cannot be attained with spatially separated systems. We present examples of correlations between spatially separated systems whose quantum maximum tends to the sequential maximum as the number of parties increases and examples of correlations between spatially separated systems whose quantum maximum fails to violate the noncontextual bound while its corresponding sequential version does.
Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission, the receive
r can thus obtain many linear combinations and eventually recover all original packets. This is by contrast to slotted ALOHA where packet collisions lead to complete erasures. The throughput of the proposed strategy is derived and shown to be significantly superior to the best known strategies, including multipacket reception.
Unsharp measurements are increasingly important for foundational insights in quantum theory and quantum information applications. Here, we report an experimental implementation of unsharp qubit measurements in a sequential communication protocol, bas
ed on a quantum random access code. The protocol involves three parties; the first party prepares a qubit system, the second party performs operations which return both a classical and quantum outcome, and the latter is measured by the third party. We demonstrate a nearly-optimal sequential quantum random access code that outperforms both the best possible classical protocol and any quantum protocol which utilises only projective measurements. Furthermore, while only assuming that the involved devices operate on qubits and that detected events constitute a fair sample, we demonstrate the noise-robust characterisation of unsharp measurements based on the sequential quantum random access code. We apply this characterisation towards quantifying the degree of incompatibility of two sequential pairs of quantum measurements.
Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an $n$-bit string $x$, and wishes to encode $x$ into a quantum state $rho_x$, such that
Bob, when receiving the state $rho_x$, can choose any bit $i in [n]$ and recover the input bit $x_i$ with high probability. Here we study two variants: parity-oblivious random access codes, where we impose the cryptographic property that Bob cannot infer any information about the parity of any subset of bits of the input apart from the single bits $x_i$; and even-parity-oblivious random access codes, where Bob cannot infer any information about the parity of any even-size subset of bits of the input. In this paper, we provide the optimal bounds for parity-oblivious quantum random access codes and show that they are asymptotically better than the optimal classical ones. Our results provide a large non-contextuality inequality violation and resolve the main open problem in a work of Spekkens, Buzacott, Keehn, Toner, and Pryde (2009). Second, we provide the optimal bounds for even-parity-oblivious random access codes by proving their equivalence to a non-local game and by providing tight bounds for the success probability of the non-local game via semidefinite programming. In the case of even-parity-oblivious random access codes, the cryptographic property holds also in the device-independent model.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
