Graph-Theoretic Framework for Self-Testing in Bell Scenarios

• URL: http://arxiv.org/abs/2104.13035v1
• Date: Tue, 27 Apr 2021 08:15:01 GMT
• Title: Graph-Theoretic Framework for Self-Testing in Bell Scenarios
• Authors: Kishor Bharti, Maharshi Ray, Zhen-Peng Xu, Masahito Hayashi, Leong-Chuan Kwek, and Ad\'an Cabello
• Abstract summary: Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely. We present a new approach for quantum self-testing in Bell non-locality scenarios.
• Score: 37.067444579637076
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely, with minimal assumptions about the underlying quantum system. It is based on the observation that some extremal points in the set of quantum correlations can only be achieved, up to isometries, with specific states and measurements. Here, we present a new approach for quantum self-testing in Bell non-locality scenarios, motivated by the following observation: the quantum maximum of a given Bell inequality is, in general, difficult to characterize. However, it is strictly contained in an easy-to-characterize set: the \emph{theta body} of a vertex-weighted induced subgraph $(G,w)$ of the graph in which vertices represent the events and edges join mutually exclusive events. This implies that, for the cases where the quantum maximum and the maximum within the theta body (known as the Lov\'asz theta number) of $(G,w)$ coincide, self-testing can be demonstrated by just proving self-testability with the theta body of $G$. This graph-theoretic framework allows us to (i) recover the self-testability of several quantum correlations that are known to permit self-testing (like those violating the Clauser-Horne-Shimony-Holt (CHSH) and three-party Mermin Bell inequalities for projective measurements of arbitrary rank, and chained Bell inequalities for rank-one projective measurements), (ii) prove the self-testability of quantum correlations that were not known using existing self-testing techniques (e.g., those violating the Abner Shimony Bell inequality for rank-one projective measurements). Additionally, the analysis of the chained Bell inequalities gives us a closed-form expression of the Lov\'asz theta number for a family of well-studied graphs known as the M\"obius ladders, which might be of independent interest in the community of discrete mathematics.

Related papers

• Sample-Optimal Quantum State Tomography for Structured Quantum States in One Dimension [25.333797381352973]
  We study whether the number of state copies can saturate the information theoretic bound (i.e., $O(n)$) using physical quantum measurements. We propose a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem and show that it can efficiently find an estimate with bounded recovery error.
  arXiv  Detail & Related papers  (2024-10-03T15:26:26Z)
• Robust self-testing of Bell inequalities tilted for maximal loophole-free nonlocality [1.099532646524593]
  quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors. We use a novel Jordan's lemma-based proof technique to obtain robust analytical self-testing statements for the entire family of tilted-Bell inequalities.
  arXiv  Detail & Related papers  (2024-05-14T16:31:06Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• 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)
• Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing [0.0]
  Bell nonlocality -- the existence of quantum correlations that cannot be explained by classical means -- is one of the most striking features of quantum mechanics. This work provides a general construction of Bell inequalities maximally violated by graph states of any prime local dimension. We analytically determine their maximal quantum violation, a number of high relevance for device-independent applications of Bell inequalities.
  arXiv  Detail & Related papers  (2022-12-14T09:46:27Z)
• Finitely Repeated Adversarial Quantum Hypothesis Testing [22.102728605081534]
  We formulate a passive quantum detector based on a quantum hypothesis testing framework under the setting of finite sample size. Under the assumption that the attacker adopts separable optimal strategies, we derive that the worst-case average error bound converges to zero exponentially. We adopt our formulations upon a case study of detection with quantum radars.
  arXiv  Detail & Related papers  (2022-12-02T17:08:17Z)
• Quantum correlations on the no-signaling boundary: self-testing and more [0.39146761527401425]
  We prove that self-testing is possible in all nontrivial Classes beyond the known examples of Hardy-type correlations. All correlations of $mathcalM$ in the simplest Bell scenario are attainable as convex combinations of those achievable using a Bell pair and projective measurements.
  arXiv  Detail & Related papers  (2022-07-28T01:55:21Z)
• An elegant proof of self-testing for multipartite Bell inequalities [0.0]
  This work presents a simple and broadly applicable self-testing argument for N-partite correlation Bell inequalities with two binary outcome observables per party. To showcase the versatility of our proof technique, we obtain self-testing statements for N party Mermin-Ardehali-Bei-Klyshko (MABK) and Werner-Wolf-Weinfurter-.Zukowski-Brukner (WWW.ZB) family of linear Bell inequalities.
  arXiv  Detail & Related papers  (2022-02-14T18:00:50Z)
• On the properties of the asymptotic incompatibility measure in multiparameter quantum estimation [62.997667081978825]
  Incompatibility (AI) is a measure which quantifies the difference between the Holevo and the SLD scalar bounds. We show that the maximum amount of AI is attainable only for quantum statistical models characterized by a purity larger than $mu_sf min = 1/(d-1)$.
  arXiv  Detail & Related papers  (2021-07-28T15:16:37Z)
• Coarse-grained self-testing [0.0]
  We show how a coarse-grained version of self-testing is possible in which physically relevant properties of a many-body system are certified. We prove that a many-body generalization of the chained Bell inequality is maximally violated if and only if the underlying quantum state is equal, up to local isometries, to a many-body singlet.
  arXiv  Detail & Related papers  (2021-03-22T09:19:51Z)

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.