Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal bounds for parity-oblivious random access codes
100
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definition of what it means for Alice to cheat. Our lower bound is a smooth tradeoff between the probability B with which Bob can guess Alices bit choice and the probability A with which Alice can guess both of Bobs bits given that she learns one of the bits with certainty. We prove that 2B + A is greater than or equal to 2 in any quantum protocol for oblivious transfer, from which it follows that one of the two parties must be able to cheat with probability at least 2/3. We prove that this bound is optimal by exhibiting a family of protocols whose cheating probabilities can be made arbitrarily close to any point on the tradeoff curve.
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called (n,1,p) quantum random access code (QRAC) where p > 1/2 is its success probability. It is known that (2,1,0.85) and (3,1,0.79) QRACs (with no classical counterparts) exist and that (4,1,p) QRAC with p > 1/2 is not possible. We extend this model with shared randomness (SR) that is accessible to both parties. Then (n,1,p) QRAC with SR and p > 1/2 exists for any n > 0. We give an upper bound on its success probability (the known (2,1,0.85) and (3,1,0.79) QRACs match this upper bound). We discuss some particular constructions for several small values of n. We also study the classical counterpart of this model where n bits are encoded into 1 bit instead of 1 qubit and SR is used. We give an optimal construction for such codes and find their success probability exactly--it is less than in the quantum case. Interactive 3D quantum random access codes are available on-line at http://home.lanet.lv/~sd20008/racs .
We show how nonclassical correlations in local bipartite states can act as a resource for quantum information processing. Considering the task of quantum random access codes (RAC) through separable Bell-diagonal states, we demonstrate the advantage of superunsteerability over classical protocols assisted with two-bits of shared randomness. We propose a measure of superunsteerability, which quantifies nonclassicality beyond quantum steering, and obtain its analytical expression for Bell-diagonal states in the context of the two- and three-setting steering scenarios that are directly related to the quantum $2 to 1$ and $3 to 1$ RAC protocols, respectively. The maximal values of our quantifier yield the optimal quantum efficiency for both of the above protocols, thus showing that superunsteerability provides a precise characterization of the nonclassical resource for implementing RACs with separable Bell-diagonal class of states.
By considering an unreliable oracle in a query-based model of quantum learning, we present a tradeoff relation between the oracles reliability and the reusability of quantum state of the input data. The tradeoff relation manifests as the fundamental upper bound on the reusability. This limitation on the reusability would increase the quantum access to the input data, i.e., the usage of quantum random access memory (qRAM), repeating the preparation of a superposition of `big input data on the query failure. However, it is found that, a learner can obtain a correct answer even from an unreliable oracle without any additional usage of qRAM---i.e., the complexity of qRAM query does not increase even with an unreliable oracle. This is enabled by repeatedly cycling the quantum state of the input data to the upper bound on the reusability.
We present rigorous performance bounds for the optimal dynamical decoupling pulse sequence protecting a quantum bit (qubit) against pure dephasing. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians. We show that if the total sequence time is fixed the optimal sequence can be used to make the distance between the protected and unperturbed qubit states arbitrarily small in the number of applied pulses. If, on the other hand, the minimum pulse interval is fixed and the total sequence time is allowed to scale with the number of pulses, then longer sequences need not always be advantageous. The rigorous bound may serve as testbed for approximate treatments of optimal decoupling in bounded models of decoherence.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
