Semi-definite programming and quantum information
arXiv:2306.16560 · doi:10.1088/1751-8121/ad2b85
Abstract
This paper presents a comprehensive exploration of semi-definite programming (SDP) techniques within the context of quantum information. It examines the mathematical foundations of convex optimization, duality, and SDP formulations, providing a solid theoretical framework for addressing optimization challenges in quantum systems. By leveraging these tools, researchers and practitioners can characterize classical and quantum correlations, optimize quantum states, and design efficient quantum algorithms and protocols. The paper also discusses implementational aspects, such as solvers for SDP and modeling tools, enabling the effective employment of optimization techniques in quantum information processing. The insights and methodologies presented in this paper have proven instrumental in advancing the field of quantum information, facilitating the development of novel communication protocols, self-testing methods, and a deeper understanding of quantum entanglement. Overall, this study offers a resource for researchers interested in the intersection of optimization and quantum information, opening up new avenues for exploration and breakthroughs in this rapidly evolving field.
arXiv commentreview and introduction to SDP in quantum information; 91 pages; comments are verrry welcome
References in corpus (108)
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Steering, Entanglement, Nonlocality, and the EPR Paradox
- Random Numbers Certified by Bell's Theorem
- JuMP: A Modeling Language for Mathematical Optimization
- The Variational Quantum Eigensolver: a review of methods and best practices
- Multidimensional quantum entanglement with large-scale integrated optics
- Information Causality as a Physical Principle
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Contextuality for preparations, transformations, and unsharp measurements
- Informational derivation of Quantum Theory
- Contextuality supplies the magic for quantum computation
- Bounding the set of quantum correlations
- Characterizing Quantum Gates via Randomized Benchmarking
- Quantum Theory From Five Reasonable Axioms
- Quantum steering: a review with focus on semidefinite programming
- A complete family of separability criteria
- A limit on nonlocality in any world in which communication complexity is not trivial
- Secure device-independent quantum key distribution with causally independent measurement devices
- Self-testing of quantum systems: a review
- Distinguishing separable and entangled states
- Graph-Theoretic Approach to Quantum Correlations
- Quantum state discrimination and its applications
- Characterizing quantum theory in terms of information-theoretic constraints
- An improved bound on distillable entanglement
- Is the quantum state real? An extended review of -ontology theorems
- Testing the Hilbert space dimension
- A derivation of quantum theory from physical requirements
- Device-independent tests of classical and quantum dimensions
- Semi-device-independent security of one-way quantum key distribution
- Self-Consistent Quantum Process Tomography
- Robustness of asymmetry and coherence of quantum states
- A glance beyond the quantum model
- Local orthogonality as a multipartite principle for quantum correlations
- Max- relative entropy of coherence: an operational coherence measure
- Separability and entanglement of composite quantum systems
- Almost quantum correlations
- All Pure Bipartite Entangled States can be Self-Tested
- Detection of entanglement in asymmetric quantum networks and multipartite quantum steering
- Sum-of-squares decompositions for a family of CHSH-like inequalities and their application to self-testing
- Device-independent entanglement quantification and related applications
- No quantum advantage for nonlocal computation
- A Combinatorial Approach to Nonlocality and Contextuality
- Negativity and steering: a stronger Peres conjecture
- Security of practical private randomness generation
- Maximal violation of the I3322 inequality using infinite dimensional quantum systems
- A Matrix Convexity Approach to Some Celebrated Quantum Inequalities
- More Randomness from the Same Data
- Generalized Probability Theories: What determines the structure of quantum theory?
- Approximation of the joint spectral radius using sum of squares
- Jensen's Operator Inequality
- Convergent relaxations of polynomial optimization problems with non-commuting variables
- Robust and versatile black-box certification of quantum devices
- Robust Self Testing of Unknown Quantum Systems into Any Entangled Two-Qubit States
- Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function
- Comparing Experiments to the Fault-Tolerance Threshold
- Semi-device independent random number expansion without entanglement
- Hierarchy of Steering Criteria Based on Moments for All Bipartite Quantum Systems
- A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum States
- Self-testing quantum states and measurements in the prepare-and-measure scenario
- Detection loophole in asymmetric Bell experiments
- Using complete measurement statistics for optimal device-independent randomness evaluation
- Security and Composability of Randomness Expansion from Bell Inequalities
- Finding optimal strategies for minimum-error quantum-state discrimination
- Bounding the set of finite dimensional quantum correlations
- Semidefinite approximations of the matrix logarithm
- Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
- On the power of PPT-preserving and non-signalling codes
- Closed sets of non-local correlations
- Approximate Degradable Quantum Channels
- Zero-error channel capacity and simulation assisted by non-local correlations
- Quantum Cryptography with Imperfect Apparatus
- Enabling computation of correlation bounds for finite-dimensional quantum systems via symmetrisation
- Efficient optimization of the quantum relative entropy
- Bounding the sets of classical and quantum correlations in networks
- Fundamental limitations on distillation of quantum channel resources
- Optimizing linear optics quantum gates
- Connections Between Mutually Unbiased Bases and Quantum Random Access Codes
- Quantum contextuality provides communication complexity advantage
- Computing conditional entropies for quantum correlations
- Characterizing finite-dimensional quantum behavior
- A framework for quantum-secure device-independent randomness expansion
- Converting contextuality into nonlocality
- A Robust Semidefinite Programming Approach to the Separability Problem
- Efficient device-independent entanglement detection for multipartite systems
- Characterization of quantum correlations with local dimension constraints and its device-independent applications
- A complete hierarchy for the pure state marginal problem in quantum mechanics
- Bell inequalities for the simplest exclusivity graph
- Experimental certification of an informationally complete quantum measurement in a device-independent protocol
- A channel-based framework for steering, non-locality and beyond
- Characterising and bounding the set of quantum behaviours in contextuality scenarios
- Unveiling quantum entanglement in many-body systems from partial information
- Informationally restricted correlations: a general framework for classical and quantum systems
- Experimental robust self-testing of the state generated by a quantum network
- Extended nonlocal games and monogamy-of-entanglement games
- Properties of dimension witnesses and their semi-definite programming relaxations
- Uncertainty relations from graph theory
- Quantum prescriptions are more ontologically distinct than they are operationally distinguishable
- Relation between semi- and fully-device-independent protocols
- A formalism for steering with local quantum measurements
- A Note on the Convex Hull of Finitely Many Projections of Spectrahedra
- Information Content of Systems as a Physical Principle
- Naturally restricted subsets of nonsignaling correlations: typicality and convergence
- Generalizing optimal Bell inequalities
- On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination
- Two convergent NPA-like hierarchies for the quantum bilocal scenario
- Optimal single-shot discrimination of optical modes
- Applications of semi-definite optimization in quantum information protocols
Cited by in corpus (14)
- Semidefinite programming relaxations for quantum correlations
- The future of secure communications: device independence in quantum key distribution
- Experimental virtual distillation of entanglement and coherence
- Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario
- Quantum Strategies for Rendezvous and Domination Tasks on Graphs with Mobile Agents
- Prepare-and-Magic: Semi-Device Independent Magic Certification in the Prepare-and-Measure Scenario
- Generalized measurements on qubits in quantum randomness certification and expansion
- Variational Optimization for Quantum Problems using Deep Generative Networks
- Optimal discrimination of quantum sequences
- Virtual Quantum Markov Chains
- Bounding conditional entropy of bipartite states with Bell operators
- Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
- Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes
- Finite Gaussian assistance protocols and a conic metric for extremizing spacelike vacuum entanglement