The performance of the amplitude-based model for complex phase retrieval

The paper aims to study the performance of the amplitude-based model \newline $\widehat{\mathbf x} \in {\rm argmin}{{\mathbf x}\in \mathbb{C}^d}\sum{j=1}^{m\left(|\langle} {\mathbf a}j,{\mathbf x}\rangle|-bj\right)^2$, where $bj:=|\langle {\mathbf a}j,{\mathbf x}0\rangle|+\etaj$ and ${\mathbf x}0\in \mathbb{C}^d$ is a target signal. The model is raised in phase retrieval as well as in absolute value rectification neural networks. Many efficient algorithms have been developed to solve it in the past decades. {However, there are very few results available regarding the estimation performance in the complex case under noisy conditions.} In this paper, {we present a theoretical guarantee on the amplitude-based model for the noisy complex phase retrieval problem}. Specifically, we show that $\min{\theta\in[0,2\pi)}|\widehat{\mathbf x}-\exp(\mathrm{i}\theta)\cdot{\mathbf x}0|2 \lesssim \frac{|{\mathbf \eta}|2}{\sqrt{m}}$ holds with high probability provided the measurement vectors ${\mathbf a}j\in \mathbb{C}^d,$ $j=1,\ldots,m,$ are {i.i.d.} complex sub-Gaussian random vectors and $m\gtrsim d$. Here ${\mathbf \eta}=(\eta1,\ldots,\etam)\in \mathbb{R}^m$ is the noise vector without any assumption on the distribution. Furthermore, we prove that the reconstruction error is sharp. For the case where the target signal ${\mathbf x}0\in \mathbb{C}^{d}$ is sparse, we establish a similar result for the nonlinear constrained $\ell1$ minimization model. { To accomplish this, we leverage a strong version of restricted isometry property for an operator on the space of simultaneous low-rank and sparse matrices.}