Stability in Phase Retrieval: Characterizing Condition Numbers and the Optimal Vector Set

In this paper, we primarily focus on analyzing the stability property of phase retrieval by examining the bi-Lipschitz property of the map ₀ (x) =|Ax| R_+ᵐ, where x Hᵈ and A H^m d is the measurement matrix for H\R, C\. We define the condition number ₀=U₀L₀, where L₀ and U₀ represent the optimal lower and upper Lipschitz constants, respectively. We establish the first universal lower bound on ₀ by demonstrating that for any A^m d, equation* ₀ ₀^H=cases {-2}\, \, \, \, 1. 659 & if H=R, \\ 4{4-}\, \, \, \, 2. 159 & if H=C. cases equation* We prove that the condition number of a standard Gaussian matrix in H^m d asymptotically matches the lower bound ₀^H for both real and complex cases. This result indicates that the constant lower bound ₀^H is asymptotically tight, holding true for both the real and complex scenarios. As an application of this result, we utilize it to investigate the performance of quadratic models for phase retrieval. Lastly, we establish that for any odd integer m 3, the harmonic frame A R^m 2 possesses the minimum condition number among all A R^m 2. We are confident that these findings carry substantial implications for enhancing our understanding of phase retrieval.