Posted Content•
Constant-sized robust self-tests for states and measurements of unbounded dimension
TL;DR: In this paper, the authors show that correlation self-tests can robustly self-test the underlying states and measurements of a maximally entangled state of every odd dimension as well as 2-outcome projective measurements of arbitrarily high rank.
Abstract: We consider correlations, $p_{n,x}$, arising from measuring a maximally entangled state using $n$ measurements with two outcomes each, constructed from $n$ projections that add up to $xI$. We show that the correlations $p_{n,x}$ robustly self-test the underlying states and measurements. To achieve this, we lift the group-theoretic Gowers-Hatami based approach for proving robust self-tests to a more natural algebraic framework. A key step is to obtain an analogue of the Gowers-Hatami theorem allowing to perturb an "approximate" representation of the relevant algebra to an exact one.
For $n=4$, the correlations $p_{n,x}$ self-test the maximally entangled state of every odd dimension as well as 2-outcome projective measurements of arbitrarily high rank. The only other family of constant-sized self-tests for strategies of unbounded dimension is due to Fu (QIP 2020) who presents such self-tests for an infinite family of maximally entangled states with even local dimension. Therefore, we are the first to exhibit a constant-sized self-test for measurements of unbounded dimension as well as all maximally entangled states with odd local dimension.
Citations
More filters
TL;DR: Yang et al. as discussed by the authors used a steering inequality called tilted steering inequality for certifying any pure two-qubit entangled state and used this inequality to certify any bipartite pure entangled state by certifying two-dimensional subspaces of the qudit state by observing the structure of the set of assemblages obtained on the trusted side after measurements are made on the un-trusted side.
Abstract: The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Recently it was shown by Coladangelo et. al. (Nat Commun 8, 15485 (2017)) that all pure bipartite entangled states can be self tested in the device independent scenario by employing subspace methods introduced by Yang et. al. (Phys. Rev. A 87, 050102(R)). Here, we have adapted their method to show that any bipartite pure entangled state can be certified in the semi-device independent scenario through Quantum Steering. Analogous to the tilted CHSH inequality, we use a steering inequality called Tilted Steering Inequality for certifying any pure two-qubit entangled state. Further, we use this inequality to certify any bipartite pure entangled state by certifying two-dimensional sub-spaces of the qudit state by observing the structure of the set of assemblages obtained on the trusted side after measurements are made on the un-trusted side. As a feature of quantum state certification via steering, we use the notion of Assemblage based robust state certification to provide robustness bounds for the certification result in the case of pure maximally entangled states of any local dimension.
5 citations
Posted Content•
TL;DR: In this article, it was shown that any correlation that is almost synchronous, in a natural $\ell_1$ sense, arises from a state and measurement operators that are well-approximated by a convex combination of projective measurements on a maximally entangled state.
Abstract: The study of quantum correlation sets initiated by Tsirelson in the 1980s and originally motivated by questions in the foundations of quantum mechanics has more recently been tied to questions in quantum cryptography, complexity theory, operator space theory, group theory, and more. Synchronous correlation sets introduced in [Paulsen et. al, JFA 2016] are a subclass of correlations that has proven particularly useful to study and arises naturally in applications. We show that any correlation that is almost synchronous, in a natural $\ell_1$ sense, arises from a state and measurement operators that are well-approximated by a convex combination of projective measurements on a maximally entangled state. This extends a result of [Paulsen et. al, JFA 2016] which applies to exactly synchronous correlations. Crucially, the quality of approximation is independent of the dimension of the Hilbert spaces or of the size of the correlation. Our result allows one to reduce the analysis of many classes of nonlocal games, including rigidity properties, to the case of strategies using maximally entangled states which are generally easier to manipulate.
2 citations
Posted Content•
TL;DR: In this paper, the Glued Magic Square game self-tests a convex combination of two or more inequivalent strategies, which is a generalisation of self-testing to multiple strategies.
Abstract: Self-testing results allow us to infer the underlying quantum mechanical description of states and measurements from classical outputs produced by non-communicating parties. The standard definition of self-testing does not apply in situations when there are two or more inequivalent optimal strategies. To address this, we introduce the notion of self-testing convex combinations of reference strategies, which is a generalisation of self-testing to multiple strategies. We show that the Glued Magic Square game [Quantum 4 (2020), p. 346] self-tests a convex combination of two inequivalent strategies. As a corollary, we obtain that the Glued Magic square game self-tests two EPR pairs thus answering an open question from [Quantum 4 (2020), p. 346]. Our self-test is robust and extends to natural generalisations of the Glued Magic Square game.
2 citations
Posted Content•
TL;DR: In this article, the authors use the magic square game to obtain a self-test for Bell states where the one side needs only to measure single-qubit Pauli observables.
Abstract: Self-testing is a method to verify that one has a particular quantum state from purely classical statistics. For practical applications, such as device-independent delegated verifiable quantum computation, it is crucial that one self-tests multiple Bell states in parallel while keeping the quantum capabilities required of one side to a minimum. In this work we use the $3 \times n$ magic rectangle games (generalisations of the magic square game) to obtain a self-test for $n$ Bell states where the one side needs only to measure single-qubit Pauli observables. The protocol requires small input size (constant for Alice and $O(\log n)$ bits for Bob) and is robust with robustness $O(n^{5/2} \sqrt{\varepsilon})$, where $\varepsilon$ is the closeness of the observed correlations to the ideal. To achieve the desired self-test we introduce a one-side-local quantum strategy for the magic square game that wins with certainty, generalise this strategy to the family of $3 \times n$ magic rectangle games, and supplement these nonlocal games with extra check rounds (of single and pairs of observables).
01 Jan 2021
TL;DR: In this article, a mathematical description of bipartite quantum correlations and how they are built up in the Tensor model is given, and the gradient of this problem can be explicitly determined with the use of Wirtinger calculus.
Abstract: In this thesis, we start with giving a mathematical description of bipartite quantum correlations and how they are built up in the Tensor model. This is needed because we want to recover the state and the operators when only the bipartite quantum correlation is known. In the literature, there are see-saw algorithms to recover the state, but they are limited to only lower dimensions. In this thesis, we explore an alternative approach, where we directly minimize the function f(ψ,{Esa},{Ftb}) = ∑a,b,s,t(P(a,b|s,t)- ψ*(Esa ⊗ Ftb)ψ)2. Here, P(a,b|s,t) is the bipartite correlation, ψ is the state vector, and Esa and Ftb are the POVMs. Furthermore, ⊗ is the Kronecker product and * indicates the conjugate transpose of a vector. These variables are subject to constraints and some of them can easily be transformed into penalty functions. The matrices Esa and Ftb have to be Hermitian positive semidefinite, for which we parameterize them by their Cholesky decompositions. The gradient of this (now unconstrained) problem can be explicitly determined with the use of Wirtinger calculus. This offers an elegant way to determine the gradient of real-valued functions with complex variables. Also, a total description of Wirtinger calculus is also given, including a proof that the gradient indeed points towards the direction of the steepest incline. We use first-order methods like gradient descent with backtracking line search and momentum-based gradient descent to find a minimum solution of the equation. If the cost function converges towards zero, we assume that the variables converge to a correct state and measurement operators. These methods can find large correlations of approximately 3000 separate variables in 1.5 hours and are able to find many different other correlations and states. The algorithm had some problems finding the operators and state of a family of correlations that had four inputs and two outputs. For some correlations, the algorithms found states and operators of lower dimension than the correlations were build with.
References
More filters
Book•
01 Jan 2000
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Abstract: Part I Fundamental Concepts: 1 Introduction and overview 2 Introduction to quantum mechanics 3 Introduction to computer science Part II Quantum Computation: 4 Quantum circuits 5 The quantum Fourier transform and its application 6 Quantum search algorithms 7 Quantum computers: physical realization Part III Quantum Information: 8 Quantum noise and quantum operations 9 Distance measures for quantum information 10 Quantum error-correction 11 Entropy and information 12 Quantum information theory Appendices References Index
25,929 citations
Book•
11 Sep 1990
TL;DR: Theory of C*-Algebras and Hilbert Space Operators Ideals and Positive Functionals Von Neumann Algebra Representations of C *-Algebra Direct Limits and Tensor Products K-Theory as discussed by the authors.
Abstract: Elementary Spectral Theory C*-Algebras and Hilbert Space Operators Ideals and Positive Functionals Von Neumann Algebras Representations of C*-Algebras Direct Limits and Tensor Products K-Theory of C*-Algebras
1,626 citations
Book•
26 Apr 2018TL;DR: In this article, the authors present a self-contained book on the theory of quantum information focusing on precise mathematical formulations and proofs of fundamental facts that form the foundation of the subject.
Abstract: This largely self-contained book on the theory of quantum information focuses on precise mathematical formulations and proofs of fundamental facts that form the foundation of the subject. It is intended for graduate students and researchers in mathematics, computer science, and theoretical physics seeking to develop a thorough understanding of key results, proof techniques, and methodologies that are relevant to a wide range of research topics within the theory of quantum information and computation. The book is accessible to readers with an understanding of basic mathematics, including linear algebra, mathematical analysis, and probability theory. An introductory chapter summarizes these necessary mathematical prerequisites, and starting from this foundation, the book includes clear and complete proofs of all results it presents. Each subsequent chapter includes challenging exercises intended to help readers to develop their own skills for discovering proofs concerning the theory of quantum information.
999 citations
01 Jan 1981
TL;DR: Nann et al. as mentioned in this paper presented a survey of the main lines of the investigation in the classification of factors, culminating in the Connes-Takesakl structure theory of type III factors.
Abstract: The fundamental results of A. Connes which determine a complete set of isomorphism classes for most injectlve factors are discussed in detail. After some introductory remarks which lay the foundation for the subsequent discussion, an historical survey of some of the principal lines of the investigation in the classification of factors is presented, culminating in the Connes-Takesakl structure theory of type III factors. After a discussion of inJectlvity for finite factors, the main result of the paper, the uniqueness of the injectlve II 1 factor, is deduced, and the structure of II. and type III injectlve factors is then obtained as corollaries of the main result. 1980 AMS (MOS) SUBJECT CLASSIFICATION: PRIMARY 46L35, 46LI0; SECONDARY- 46L50, 46L05 KEY WORI)S AND PHRASES: jiVe yon Nann o.%gebra, fi facr, dcre
793 citations
08 Nov 1998
TL;DR: In this article, a self-checking source is proposed, which requires the manufacturer of the photon source to provide certain tests such that, if passed, the source is guaranteed to be adequate for the security of the quantum key distribution protocol, even though the testing devices may not be built to the original specification.
Abstract: Quantum key distribution, first proposed by C.H. Bennett and G. Brassard (1984), provides a possible key distribution scheme whose security depends only on the quantum laws of physics. So far the protocol has been proved secure even under channel noise and detector faults of the receiver but is vulnerable if the photon source used is imperfect. In this paper we propose and give a concrete design for a new concept, self-checking source, which requires the manufacturer of the photon source to provide certain tests; these tests are designed such that, if passed, the source is guaranteed to be adequate for the security of the quantum key distribution protocol, even though the testing devices may not be built to the original specification. The main mathematical result is a structural theorem which states that, for any state in a Hilbert space, if certain EPR-type equations are satisfied, the state must be essentially the orthogonal sum of EPR pairs.
418 citations