Characterizing finite-dimensional quantum behavior

Abstract

We study and extend the semidefinite programming (SDP) hierarchies introduced in [Phys. Rev. Lett. 115, 020501] for the characterization of the statistical correlations arising from finite dimensional quantum systems. First, we introduce the dimension-constrained noncommutative polynomial optimization (NPO) paradigm, where a number of polynomial inequalities are defined and optimization is conducted over all feasible operator representations of bounded dimensionality. Important problems in device independent and semi-device independent quantum information science can be formulated (or almost formulated) in this framework. We present effective SDP hierarchies to attack the general dimension-constrained NPO problem (and related ones) and prove their asymptotic convergence. To illustrate the power of these relaxations, we use them to derive new dimension witnesses for temporal and Bell-type correlation scenarios, and also to bound the probability of success of quantum random access codes.

17 pages

References in corpus (16)

• Entanglement detection
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Bounding the set of quantum correlations
• Testing the Hilbert space dimension
• Device-independent tests of classical and quantum dimensions
• A lower bound on the dimension of a quantum system given measured data
• Optimal randomness certification from one entangled bit
• Dimension witnesses and quantum state discrimination
• Quantum Random Access Codes using Single $d$-level Systems
• Bounding the set of finite dimensional quantum correlations
• Classifying 50 years of Bell inequalities
• Efficiency of higher dimensional Hilbert spaces for the violation of Bell inequalities
• Device-independent certification of high-dimensional quantum systems
• Persistency of entanglement and nonlocality in multipartite quantum systems
• Properties of dimension witnesses and their semi-definite programming relaxations
• Bell inequalities for three systems and arbitrarily many measurement outcomes

Cited by in corpus (37)

• Self-testing quantum states and measurements in the prepare-and-measure scenario
• Natural Framework for Device-Independent Quantification of Quantum Steerability, Measurement Incompatibility, and Self-Testing
• Semi-device-independent self-testing of unsharp measurements
• Enabling computation of correlation bounds for finite-dimensional quantum systems via symmetrisation
• Semidefinite programming relaxations for quantum correlations
• Witnessing irreducible dimension
• Connections Between Mutually Unbiased Bases and Quantum Random Access Codes
• Entanglement-assisted quantum communication with simple measurements
• Correlations in entanglement-assisted prepare-and-measure scenarios
• Semi-device-independent framework based on restricted distrust in prepare-and-measure experiments
• Entanglement in prepare-and-measure scenarios: many questions, a few answers
• Certification of a Nonprojective Qudit Measurement using Multiport Beamsplitters
• Semi-definite programming and quantum information
• Quantum Advantage in Information Retrieval
• Classical Cost of Transmitting a Qubit
• Almost qudits in the prepare-and-measure scenario
• Shared randomness and device-independent dimension witnessing
• Bounding and simulating contextual correlations in quantum theory
• Positive maps and trace polynomials from the symmetric group
• Self-testing in prepare-and-measure scenarios and a robust version of Wigner's theorem
• A convergent inflation hierarchy for quantum causal structures
• RepLAB: a computational/numerical approach to representation theory
• Certifying dimension of quantum systems by sequential projective measurements
• A general bound for the dimension of quantum behaviours in the prepare-and-measure scenario
• Structure of dimension-bounded temporal correlations
• Connector tensor networks: a renormalization-type approach to quantum certification
• SymDPoly: symmetry-adapted moment relaxations for noncommutative polynomial optimization
• Learning optimal quantum models is NP-hard
• Simple and general bounds on quantum random access codes
• Recommender systems inspired by the structure of quantum theory
• Towards minimal self-testing of qubit states and measurements in prepare-and-measure scenarios
• Strict advantage of complex quantum theory in a communication task
• Bell inequalities with overlapping measurements
• Bounding Large-Scale Bell Inequalities
• Partial ignorance communication tasks in quantum theory
• Trading symmetry for Hilbert-space dimension in Bell-inequality violation
• The Interplay between Quantum Contextuality and Wigner Negativity