Global completability with applications to self-consistent quantum tomography
From MaRDI portal
Publication:329581
DOI10.1007/S00220-016-2760-2zbMATH Open1350.81005arXiv1209.6499OpenAlexW1578058311MaRDI QIDQ329581FDOQ329581
Authors: Cyril Jakob Stark 
Publication date: 21 October 2016
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Abstract: Let p_1, ..., p_N in R^D be unknown vectors and let Omega subseteq {1,...,N}^{ imes 2}. Assume that the inner products p_i^T p_j are fixed for all (i,j) in Omega. Do these inner product constraints (up to simultaneous rotation of all vectors) determine p_1, ..., p_N uniquely? Here we derive a necessary and sufficient condition for the uniqueness of p_1, ...,p_N (i.e., global completability) which is applicable to a large class of practically relevant sets Omega. Moreover, given Omega, we show that the condition for global completability is universal in the sense that for almost all vectors p_1, ...,p_N in R^D the completability of p_1, ...,p_N only depends on Omega and not on the specific values of p_i^T p_j$ for (i,j) in Omega. This work was motivated by practical considerations, namely, self-consistent quantum tomography.
Full work available at URL: https://arxiv.org/abs/1209.6499
Recommendations
- On the information completeness of quantum tomograms
- Finite quantum tomography and semidefinite programming
- On quantum tomography on locally compact groups
- Asymptotic equivalence of quantum state tomography and noisy matrix completion
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Completeness of decoherence functionals
- Consistency of Local Density Matrices Is QMA-Complete
- Completing the proof of ``Generic quantum nonlocality
- Variational quantum tomography with incomplete information by means of semidefinite programs
- Near-optimal quantum tomography: estimators and bounds
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Schur products and matrix completions
- Introduction to Smooth Manifolds
- Semidefinite programming relaxations for semialgebraic problems
- Generic global rigidity
- Characterizing generic global rigidity
- Sums of squares, moment matrices and optimization over polynomials
- Linear vs. semidefinite extended formulations
- Extensions of band matrices with band inverses
- The Rigidity of Graphs
- Lifts of Convex Sets and Cone Factorizations
- Positive definite completions of partial Hermitian matrices
- A novel detection of periodic phenomena of binary chaotic sequences
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Uniqueness of low-rank matrix completion by rigidity theory
- Positive semidefinite rank
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Approximate cone factorizations and lifts of polytopes
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Compressibility of Positive Semidefinite Factorizations and Quantum Models
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- Self testing quantum apparatus
- Self-testing of Quantum Circuits
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- Optimal, reliable estimation of quantum states
- Robust self-testing of the singlet
- Self-calibration for self-consistent tomography
- Equivariant semidefinite lifts of regular polygons
This page was built for publication: Global completability with applications to self-consistent quantum tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329581)
