Quantum vs. noncontextual semi-device-independent randomness certification

• URL: http://arxiv.org/abs/2112.09678v1
• Date: Fri, 17 Dec 2021 18:46:19 GMT
• Title: Quantum vs. noncontextual semi-device-independent randomness certification
• Authors: Carles Roch I Carceller and Kieran Flatt and Hanwool Lee and Joonwoo Bae and Jonatan Bohr Brask
• Abstract summary: We study randomness certification based on state discrimination and take noncontextuality as the notion of classicality. For quantum eavesdropppers, quantum devices can certify more randomness than noncontextual ones whenever none of the input states are unambiguously identified.
• Score: 1.3124513975412255
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We compare the power of quantum and classical physics in terms of randomness certification from devices which are only partially characterised. We study randomness certification based on state discrimination and take noncontextuality as the notion of classicality. A contextual advantage was recently shown to exist for state discrimination. Here, we develop quantum and noncontextual semi-device independent protocols for random-number generation based on maximum-confidence discrimination, which generalises unambiguous and minimum-error state discrimination. We show that, for quantum eavesdropppers, quantum devices can certify more randomness than noncontextual ones whenever none of the input states are unambiguously identified. That is, a quantum-over-classicaladvantage exists.

Related papers

• 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)
• Device-independent quantum state discrimination [6.8634330648628215]
  We show that quantum state discrimination can be realized in a device-independent scenario using tools of self-testing results. In detail, we show that two arbitrary states can be discriminated in a device-independent manner when they are not conjugate with each other.
  arXiv  Detail & Related papers  (2024-01-23T12:39:37Z)
• Measurement-Device-Independent Detection of Beyond-Quantum State [53.64687146666141]
  We propose a measurement-device-independent (MDI) test for beyond-quantum state detection. We discuss the importance of tomographic completeness of the input sets to the detection.
  arXiv  Detail & Related papers  (2023-12-11T06:40:13Z)
• Hierarchical certification of nonclassical network correlations [50.32788626697182]
  We derive linear and nonlinear Bell-like inequalities for networks, whose violation certifies the absence of a minimum number of classical sources in them. We insert this assumption, which leads to results more amenable to certification in experiments.
  arXiv  Detail & Related papers  (2023-06-27T18:00:01Z)
• 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)
• Certifying randomness in quantum state collapse [4.5070885135627226]
  In this paper, we explore the quantitive connection between the randomness generation and the state collapse. We provide a randomness verification protocol under the assumptions: (I) independence between the source and the measurement devices and (II) the L"uders' rule for collapsing state.
  arXiv  Detail & Related papers  (2022-10-29T15:31:16Z)
• Experimental Test of Contextuality based on State Discrimination with a Single Qubit [16.530085733940528]
  We extend the scope of experimental test of contextuality to a minimal quantum system of only two states (qubit) We observe a substantial violation of a no-go inequality derived by assuming non-contextuality. We also quantify the contextual advantage of state discrimination and the tolerance against quantum noises.
  arXiv  Detail & Related papers  (2022-06-22T04:03:04Z)
• Contextual advantages and certification for maximum confidence discrimination [1.3124513975412255]
  We consider a maximum confidence measurement that unifies different strategies of quantum state discrimination. We first show that maximum confidence discrimination, as well as unambiguous discrimination, contains contextual advantages. Our results establish how the advantages of quantum theory over a classical model may appear in a realistic scenario of a discrimination task.
  arXiv  Detail & Related papers  (2021-12-17T16:58: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)
• 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)
• Quantum-secure message authentication via blind-unforgeability [74.7729810207187]
  We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability. This notion defines a function to be predictable if there exists an adversary who can use "partially blinded" access to predict values. We show the suitability of blind unforgeability for supporting canonical constructions and reductions.
  arXiv  Detail & Related papers  (2018-03-10T05:31:38Z)

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.