REVIEW 3 cited by
Semidefinite programming relaxations for quantum correlations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Semidefinite programs are convex optimisation problems involving a linear objective function and a domain of positive semidefinite matrices. Over the last two decades, they have become an indispensable tool in quantum information science. Many otherwise intractable fundamental and applied problems can be successfully approached by means of relaxation to a semidefinite program. Here, we review such methodology in the context of quantum correlations. We discuss how the core idea of semidefinite relaxations can be adapted for a variety of research topics in quantum correlations, including nonlocality, quantum communication, quantum networks, entanglement, and quantum cryptography.
Forward citations
Cited by 3 Pith papers
-
Semi-Device-Independent Quantum Key Distribution from Operational Assumptions
Operational bounds on state exclusion (not only identification) plus a three-setting retained-key protocol certify positive SDI-QKD rates down to nearly vanishing preparation visibility.
-
Detecting high-dimensional entanglement with simple measurements
A witness method detects high-dimensional Schmidt numbers using only strings of single-qubit Pauli measurements, demonstrated up to 16-dimensional photonic entanglement.
-
Sequential quantum processes with group symmetries
A canonical streaming circuit decomposition for (G×H)-invariant quantum combs is derived, and numerical optimization suggests a deterministic 7-query transposition protocol for qutrits that is reported as exact.
Discussion (0). Sign in to comment.