PhaseMax: Stable guarantees from noisy sub-Gaussian measurements

2019 ◽  
Vol 18 (05) ◽  
pp. 861-886
Author(s):  
Huiping Li ◽  
Song Li ◽  
Yu Xia

In this paper, we consider the noisy phase retrieval problem which occurs in many different areas of science and physics. The PhaseMax algorithm is an efficient convex method to tackle with phase retrieval problem. On the basis of this algorithm, we propose two kinds of extended formulations of the PhaseMax algorithm, namely, PhaseMax with bounded and non-negative noise and PhaseMax with outliers to deal with the phase retrieval problem under different noise corruptions. Then we prove that these extended algorithms can stably recover real signals from independent sub-Gaussian measurements under optimal sample complexity. Specially, such results remain valid in noiseless case. As we can see, these results guarantee that a broad range of random measurements such as Bernoulli measurements with erasures can be applied to reconstruct the original signals by these extended PhaseMax algorithms. Finally, we demonstrate the effectiveness of our extended PhaseMax algorithm through numerical simulations. We find that with the same initialization, extended PhaseMax algorithm outperforms Truncated Wirtinger Flow method, and recovers the signal with corrupted measurements robustly.

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Rujia Li ◽  
Liangcai Cao

AbstractPhase retrieval seeks to reconstruct the phase from the measured intensity, which is an ill-posed problem. A phase retrieval problem can be solved with physical constraints by modulating the investigated complex wavefront. Orbital angular momentum has been recently employed as a type of reliable modulation. The topological charge l is robust during propagation when there is atmospheric turbulence. In this work, topological modulation is used to solve the phase retrieval problem. Topological modulation offers an effective dynamic range of intensity constraints for reconstruction. The maximum intensity value of the spectrum is reduced by a factor of 173 under topological modulation when l is 50. The phase is iteratively reconstructed without a priori knowledge. The stagnation problem during the iteration can be avoided using multiple topological modulations.


2008 ◽  
Vol 8 (3&4) ◽  
pp. 345-358
Author(s):  
M. Hayashi ◽  
A. Kawachi ◽  
H. Kobayashi

One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for the sample complexity of the identification and decision versions of the hidden subgroup problem. As a consequence of the bounds, we show that the sample complexity for both of the decision and identification versions is $\Theta(\log|\HH|/\log p)$ for a candidate set $\HH$ of hidden subgroups in the case \REVISE{where the candidate nontrivial subgroups} have the same prime order $p$, which implies that the decision version is at least as hard as the identification version in this case. In particular, it does so for the important \REVISE{cases} such as the dihedral and the symmetric hidden subgroup problems. Moreover, the upper bound of the identification is attained \REVISE{by a variant of the pretty good measurement}. \REVISE{This implies that the concept of the pretty good measurement is quite useful for identification of hidden subgroups over an arbitrary group with optimal sample complexity}.


2017 ◽  
Vol 3 (1) ◽  
Author(s):  
Shelby Kimmel ◽  
Cedric Yen-Yu Lin ◽  
Guang Hao Low ◽  
Maris Ozols ◽  
Theodore J. Yoder

2010 ◽  
Vol 47 (8) ◽  
pp. 081001
Author(s):  
廖天河 Liao Tianhe ◽  
高穹 Gao Qiong ◽  
崔远峰 Cui Yuanfeng ◽  
宋凯洋 Song Kaiyang

1981 ◽  
Vol 28 (6) ◽  
pp. 735-738 ◽  
Author(s):  
J.G. Walker

2017 ◽  
Vol 56 (09) ◽  
pp. 1
Author(s):  
Zhun Wei ◽  
Wen Chen ◽  
Tiantian Yin ◽  
Xudong Chen

Author(s):  
Leng Ningyi ◽  
Yuan Ziyang ◽  
Yang Haoxing ◽  
Hongxia Wang ◽  
Du Longkun

Sign in / Sign up

Export Citation Format

Share Document