A Partial Derandomization of PhaseLift using Spherical Designs

Abstract

The problem of retrieving phase information from amplitude measurements alone has appeared in many scientific disciplines over the last century. PhaseLift is a recently introduced algorithm for phase recovery that is computationally efficient, numerically stable, and comes with rigorous performance guarantees. PhaseLift is optimal in the sense that the number of amplitude measurements required for phase reconstruction scales linearly with the dimension of the signal. However, it specifically demands Gaussian random measurement vectors - a limitation that restricts practical utility and obscures the specific properties of measurement ensembles that enable phase retrieval. Here we present a partial derandomization of PhaseLift that only requires sampling from certain polynomial size vector configurations, called t-designs. Such configurations have been studied in algebraic combinatorics, coding theory, and quantum information. We prove reconstruction guarantees for a number of measurements that depends on the degree t of the design. If the degree is allowed to to grow logarithmically with the dimension, the bounds become tight up to polylog-factors. Beyond the specific case of PhaseLift, this work highlights the utility of spherical designs for the derandomization of data recovery schemes.

32 pages, 1 figure. V2: added numerics, improved presentation. To appear in Journal of Fourier Analysis and Applications

References in corpus (6)

• Instantaneous non-local computation of low T-depth quantum circuits
• Evenly distributed unitaries: on the structure of unitary designs
• Tight informationally complete quantum measurements
• Improved Recovery Guarantees for Phase Retrieval from Coded Diffraction Patterns
• Qubit stabilizer states are complex projective 3-designs
• Quasi-Linear Compressed Sensing

Cited by in corpus (47)

• Multiqubit Clifford groups are unitary 3-designs
• Robust shadow estimation
• The Numerics of Phase Retrieval
• Phase Retrieval with Application to Optical Imaging
• Improved Recovery Guarantees for Phase Retrieval from Coded Diffraction Patterns
• Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics
• Recovering quantum gates from few average gate fidelities
• The Clifford group fails gracefully to be a unitary 4-design
• Shadow process tomography of quantum channels
• Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Projected Least-Squares Quantum Process Tomography
• Quantum Conical Designs
• Entropic uncertainty relations from quantum designs
• Iso-entangled mutually unbiased bases, symmetric quantum measurements and mixed-state designs
• Phase Retrieval Without Small-Ball Probability Assumptions
• Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery
• Convolutional Phase Retrieval via Gradient Descent
• Sample-optimal classical shadows for pure states
• Improving compressed sensing with the diamond norm
• Low rank matrix recovery from Clifford orbits
• The Role of Topology in Quantum Tomography
• Phase Retrieval Using Unitary 2-Designs
• Phase Retrieval with One or Two Diffraction Patterns by Alternating Projection with Null Initialization
• On Stein's Identity and Near-Optimal Estimation in High-dimensional Index Models
• Well conditioned ptychograpic imaging via lost subspace completion
• Fourier Phase Retrieval with a Single Mask by Douglas-Rachford Algorithm
• Predicting Features of Quantum Systems from Very Few Measurements
• Rapid characterisation of linear-optical networks via PhaseLift
• Estimating Gibbs partition function with quantumClifford sampling
• Efficient measurement schemes for bosonic systems
• Statistical analysis of low rank tomography with compressive random measurements
• Dynamical Quantum Tomography
• Constrained Quantum Tomography of Semi-Algebraic Sets with Applications to Low-Rank Matrix Recovery
• Cubatures on Grassmannians: moments, dimension reduction, and related topics
• Infinite-dimensional compressed sensing and function interpolation
• Fast Compressive Phase Retrieval from Fourier Measurements
• On construction of finite averaging sets for $SL(2,\mathbb{C})$ via its Cartan decomposition
• Explicit Frames for Deterministic Phase Retrieval via PhaseLift
• Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices
• Phase Retrieval by Alternating Minimization with Random Initialization
• Phase retrieval of complex-valued objects via a randomized Kaczmarz method
• Generalized group designs: constructing novel unitary 2-, 3- and 4-designs
• Fundamental solutions of heat equation on unitary groups establish an improved relation between $\epsilon$-nets and approximate unitary $t$-designs
• Lecture notes on non-convex algorithms for low-rank matrix recovery
• An Algorithm for Exact Super-resolution and Phase Retrieval
• On the Search for Tight Frames of Low Coherence