Five Starter Pieces: Quantum Information Science via Semi-definite Programs
arXiv:2112.08276 · doi:10.1287/educ.2022.0243
Abstract
As the title indicates, this chapter presents a brief, self-contained introduction to five fundamental problems in Quantum Information Science (QIS) that are especially well-suited to be formulated as Semi-definite Programs (SDP). We have in mind two audiences. The primary audience comprises of Operations Research (and Computer Science) graduate students who have familiarity with SDPs, but have found it daunting to become even minimally conversant with pre-requisites of QIS. The second audience consists of Physicists (and Electrical Engineers) already knowledgeable with modeling of QIS via SDP but interested in computational tools that are applicable more generally. For both audiences, we strive for rapid access to the unfamiliar material. For the first, we provide just enough required background material (from Quantum Mechanics, treated via matrices, and mapping them in Dirac notation) and simultaneously for the second audience we recreate, computationally in Jupyter notebooks, known closed-form solutions. We hope you will enjoy this introduction and gain understanding of the marvelous connection between SDP and QIS by self-study, or as a short seminar course. Ultimately, we hope this disciplinary outreach will fuel advances in QIS through their fruitful study via SDPs.
arXiv comment38 pages, 4 figures, and some relevant code, see https://github.com/vsiddhu/SDP-Quantum-OR, included here. v3 essentially matches published version
References in corpus (41)
- Quantum entanglement
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- The capacity of the noisy quantum channel
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- General Entanglement Breaking Channels
- The Quantum Chernoff Bound
- Characterizing Quantum Gates via Randomized Benchmarking
- A complete family of separability criteria
- Quantum State Discrimination
- Information transmission through a noisy quantum channel
- Quantum Communication With Zero-Capacity Channels
- Quantum state discrimination and its applications
- Quantum Channel Capacity of Very Noisy Channels
- The Chernoff lower bound for symmetric quantum hypothesis testing
- Quantum channels and their entropic characteristics
- Degenerate Quantum Codes for Pauli Channels
- Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
- Quantum Capacities of Channels with small Environment
- Semidefinite approximations of the matrix logarithm
- Approximate Degradable Quantum Channels
- New lower bounds on the non-zero capacity of Pauli Channels
- Dephrasure channel and superadditivity of coherent information
- Efficient optimization of the quantum relative entropy
- Useful states and entanglement distillation
- Quantum and private capacities of low-noise channels
- Semidefinite programming converse bounds for quantum communication
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Quantum flags, and new bounds on the quantum capacity of the depolarizing channel
- Quantum Codes from Neural Networks
- Computing Quantum Channel Capacities
- Quantum Bilinear Optimization
- An improved semidefinite programming hierarchy for testing entanglement
- Positivity and nonadditivity of quantum capacities using generalized erasure channels
- Error Thresholds for Arbitrary Pauli Noise
- Entropic singularities give rise to quantum transmission
- Improving compressed sensing with the diamond norm
- Limitations of semidefinite programs for separable states and entangled games
- Fidelity between a bipartite state and another one undergoing local unitary dynamics
- Degradable Quantum Channels Using Pure to Product of Pure States Isometries