Solving Quadratic Equations via PhaseLift when There Are About As Many Equations As Unknowns

Abstract: This note shows that we can recover a complex vector x in C^n exactly from on the order of n quadratic equations of the form |<a_i, x>|^2 = b_i, i = 1, ..., m, by using a semidefinite program known as PhaseLift. This improves upon earlier bounds in [3], which required the number of equations to be at least on the order of n log n. We also demonstrate optimal recovery results from noisy quadratic measurements; these results are much sharper than previously known results.

• The paper guarantees exact recovery of complex vectors using the PhaseLift method, requiring only a number of equations proportional to the number of unknowns.
• The PhaseLift method transforms the quadratic problem into a semidefinite program using rank-one convex relaxation.
• The proposed method offers universal recovery for all complex signals and maintains stability and precision even when dealing with noisy measurements.

Overview of "Solving Quadratic Equations via PhaseLift"

This paper presents an advanced framework for recovering complex vectors from quadratic equations using a method known as PhaseLift. This approach leverages semidefinite programming (SDP) for the exact recovery of input signals under certain conditions and offers enhanced sharpness and robustness in solving quadratic problems even in noisy situations.

Key Contributions

The work of Candès and Li significantly expands on existing efforts in phase retrieval, a subset of the quadratic equations problem where only the magnitudes of linear measurements can be gauged. The primary contributions are the following:

1. Exact Recovery Guarantee: The authors establish that with a number of equations proportional to the number of unknowns — specifically on the order of $n \log n$ — the PhaseLift technique accurately retrieves any complex vector in $\mathbb{C}^n$. This guarantees a unique solution provided the measurement vectors are sufficiently randomized.
2. Probability Bounds: The paper confirms the exponentially small probability of failure in recovery, thus enhancing the robustness guarantee of the PhaseLift approach compared to previous works.
3. Universal Recovery: The proposed method achieves universal recovery for all input signals, whether real or complex-valued. This outcome is underscored in Theorem 1.2, which claims a minimal number of measurements proportional to $n$ is sufficient for exact recovery across all input signals.
4. Stability Under Noise: The authors extend their method's application to noisy scenarios, demonstrating that the precision bounds for recovery remain close to those of the noiseless settings. This is articulated in Theorem 1.3, which shows that deviations in recovered signals from true signals are bounded proportionally to the noise magnitude.

Methodology

The paper employs a rank-one convex relaxation strategy known as PhaseLift, which effectively transforms the quadratic problem into a semidefinite programming problem by lifting the problem into a higher dimensional space. The primary optimization is with respect to the trace of a positive semidefinite matrix subjected to constraints derived from the randomized quadratic equations.

Mathematical Innovations

• Dual Certificates: The construct of dual certificates plays a crucial role in proving the uniqueness claims of PhaseLift solutions. By showing that the null space of the associated linear operators tangentially intersects the positive semidefinite cone at most systems with fixed proportion of measurements, the authors substantiate the robustness of their semidefinite formulation.
• Probability Improvements: Through stringent analyses of matrix spectral and Frobenius norms alongside visual representations of geometric spaces, the paper strongly improves the probability bounds regarding the recovery guarantees.

Implications

Theoretical advances showcased in this paper hold practical significance for fields requiring precise signal reconstructions from intensity measurements, such as optics, quantum mechanics, and telecommunications. The universal and stable recovery results also position PhaseLift as a powerful tool in the face of unpredictable noise.

Moreover, by establishing a tighter bound on the number of required measurements and amplifying recovery likelihoods, this research propels forward the feasibility of real-world applications where data acquisition is constrained. Consequently, future endeavors could potentially evolve PhaseLift's framework to incorporate more complex and non-linear measurement models, enhancing its applicability across varied scientific and engineering disciplines.

In conclusion, while this contribution does not claim to redefine existing paradigms, it meticulously advances the reliability and universality of phase retrieval methodologies, paving a path for subsequent empirical investigations and algorithmic improvements within this domain.