Role of nonclassical temporal correlation in powering quantum random access codes

• URL: http://arxiv.org/abs/2204.05537v3
• Date: Thu, 10 Nov 2022 17:54:24 GMT
• Title: Role of nonclassical temporal correlation in powering quantum random access codes
• Authors: Subhankar Bera, Ananda G. Maity, Shiladitya Mal and A. S. Majumdar
• Abstract summary: We show that any non-zero quantum advantage of n bits encoded to 1-bit random access code is equivalent to the violation of the corresponding temporal inequality. We then show that any non-zero violation of the corresponding temporal inequality can certify genuine randomness.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We explore the fundamental origin of the quantum advantage behind random access code. We propose new temporal inequalities compatible with noninvasive-realist models and show that any non-zero quantum advantage of n bits encoded to 1-bit random access code in the presence of shared randomness is equivalent to the violation of the corresponding temporal inequality. As an immediate consequence of this connection, we also prove that the maximal success probability of n bits encoded to 1-bit random access code can be obtained when the maximal violation of the corresponding inequality is achieved. We then show that any non-zero quantum advantage of n bits encoded to 1-bit random access code, or in other words, any non-zero violation of the corresponding temporal inequality can certify genuine randomness.

Related papers

• Average-Case Complexity of Quantum Stabilizer Decoding [42.770940323689445]
  We prove that decoding a random stabilizer code with even a single logical qubit is at least as hard as decoding a random classical code at constant rate.<n>This result suggests that the easiest random quantum decoding problem is at least as hard as the hardest random classical decoding problem.
  arXiv  Detail & Related papers  (2025-09-25T03:04:40Z)
• No Bound Randomness in Quantum Nonlocality [3.4072037792858034]
  In DI randomness amplification protocols, any amount of quantum nonlocality is sufficient to certify randomness.<n>In contrast to the hitherto considered fixed-input guessing probability, the average guessing probability over all inputs is a faithful and monotonic measure of nonlocality.
  arXiv  Detail & Related papers  (2025-09-10T14:19:51Z)
• Delegated verification of quantum randomness with linear optics [0.0]
  Quantum mechanics offers the best properties of an entropy source in terms of unpredictability. We present a method that allows a third party to publicly perform statistical testing without compromising the confidentiality of the random bits.
  arXiv  Detail & Related papers  (2024-11-29T13:11:01Z)
• How much secure randomness is in a quantum state? [0.0]
  How much cryptographically-secure randomness can be extracted from a quantum state? We consider a general adversarial model that allows for an adversary who has quantum side-information about both the source and the measurement device.
  arXiv  Detail & Related papers  (2024-10-21T19:16:56Z)
• Maximum Quantum Non-Locality is not always Sufficient for Device-Independent Randomness Generation [3.7482527016282963]
  We present families of $n$-player non-local games for $n geq 2$ and families of non-local behaviors on the quantum boundary that do not allow to certify any randomness against a classical adversary. Our results show the existence of a form of bound randomness against classical adversaries, highlighting that device-independent randomness and quantum non-locality can be maximally inequivalent resources.
  arXiv  Detail & Related papers  (2024-08-07T10:07:39Z)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• Incorporating Zero-Probability Constraints to Device-Independent Randomness Expansion [11.765274200974774]
  We explore various forms of randomness that are certifiable in the so-called device-independent (DI) paradigm. In this work, we determine the certifiable randomness when zero-probability constraints are incorporated into the task of DI randomness expansion.
  arXiv  Detail & Related papers  (2024-01-16T15:57:17Z)
• Simple and general bounds on quantum random access codes [0.0]
  We provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet. We demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.
  arXiv  Detail & Related papers  (2023-12-21T18:57:55Z)
• Certification of unbounded randomness without nonlocality [0.0]
  We provide a scheme to certify unbounded randomness in a semi-device-independent way based on the maximal violation of Leggett-Garg inequalities. The scheme is independent of the choice of the quantum state, and consequently even "quantum" noise could be utilized to self-test quantum measurements.
  arXiv  Detail & Related papers  (2023-07-03T20:11:08Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.