A partial derandomization of phaselift using spherical designs

DOI10.1007/s00041-014-9361-2zbMath1332.90197arXiv1310.2267OpenAlexW2045516162MaRDI QIDQ2342167

Yanyan Li

Publication date: 11 May 2015

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2267

zbMATH Keywords

spherical designsconvex relaxationquantum informationphase retrievalphaseliftsemidefinite relaxations of nonconvex quadratic programsnon-commutative large deviation estimates

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Convex programming (90C25) Large deviations (60F10) Problems with incomplete information (optimization) (49N30)

Related Items (36)

The numerics of phase retrieval ⋮ Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization ⋮ Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ Improved recovery guarantees for phase retrieval from coded diffraction patterns ⋮ Low rank matrix recovery from rank one measurements ⋮ Admissible measurements and robust algorithms for ptychography ⋮ Algorithms and error bounds for noisy phase retrieval with low-redundancy frames ⋮ Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE ⋮ Phase retrieval using alternating minimization in a batch setting ⋮ Dynamical quantum tomography ⋮ Efficient unitary designs with a system-size independent number of non-Clifford gates ⋮ Constrained quantum tomography of semi-algebraic sets with applications to low-rank matrix recovery ⋮ Stable low-rank matrix recovery via null space properties ⋮ BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING ⋮ Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems ⋮ Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices ⋮ PhaseMax: Stable guarantees from noisy sub-Gaussian measurements ⋮ Well-conditioned ptychographic imaging via lost subspace completion ⋮ Complex phase retrieval from subgaussian measurements ⋮ On the search for tight frames of low coherence ⋮ Phase retrieval from Fourier measurements with masks ⋮ Fourier phase retrieval with a single mask by Douglas-Rachford algorithms ⋮ Generalized sampling and infinite-dimensional compressed sensing ⋮ Unnamed Item ⋮ A geometric analysis of phase retrieval ⋮ Explicit frames for deterministic phase retrieval via PhaseLift ⋮ Phase retrieval with PhaseLift algorithm ⋮ Phase retrieval from coded diffraction patterns ⋮ Riemannian optimization for phase retrieval from masked Fourier measurements ⋮ Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization ⋮ Statistically efficient tomography of low rank states with incomplete measurements ⋮ Proof methods for robust low-rank matrix recovery ⋮ Fast state tomography with optimal error bounds ⋮ Statistical analysis of compressive low rank tomography with random measurements ⋮ On construction of finite averaging sets for SL(2,C) via its Cartan decomposition

Uses Software

• CVX
• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• t-designs in projective spaces
• User-friendly tail bounds for sums of random matrices
• Averaging sets: A generalization of mean values and spherical designs
• Chebyshev-type quadrature on multidimensional domains
• Quantum tomography under prior information
• Spherical 7-designs in \(2^n\)-dimensional Euclidean space
• RIPless compressed sensing from anisotropic measurements
• Sparse Signal Recovery from Quadratic Measurements via Convex Programming
• UNITARY OPERATOR BASES
• Tight informationally complete quantum measurements
• Expander graphs and their applications
• On sparse reconstruction from Fourier and Gaussian measurements
• Pairwise Independence and Derandomization
• Large deviation bounds for k -designs
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Finite Fields and Applications
• Symmetric informationally complete quantum measurements
• Structured random measurements in signal processing
• Low-rank matrix completion using alternating minimization
• Immersions and Embeddings of Projective Spaces
• Quantum invariants of knots and 3-manifolds
• The invariants of the Clifford groups

This page was built for publication: A partial derandomization of phaselift using spherical designs