---
title: Conjugate Phase Retrieval Overview
url: https://www.emergentmind.com/topics/conjugate-phase-retrieval
type: topic
---

# Conjugate Phase Retrieval Overview

Searching arXiv for recent and foundational papers on conjugate phase retrieval.
Conjugate phase retrieval is the problem of recovering a complex-valued signal from phaseless measurements when the admissible ambiguity class is enlarged from global phase alone to global phase together with conjugation. In its most common form, one seeks to identify \(x\) only up to
\[
x=e^{i\theta}y \quad \text{or} \quad x=e^{i\theta}\overline y,
\]
or, in structured Fourier settings, up to global phase and conjugate-reflection symmetries. This formulation arises whenever the measurement operator is intrinsically insensitive to conjugation, as happens for real sensing vectors in \(\mathbb C^M\), for one-dimensional Fourier intensity, and in several infinite-dimensional sampling models. Across finite-dimensional frame theory, Fourier phase retrieval, Paley–Wiener and shift-invariant spaces, sparse super-resolution, graph-based models, and MRI calibration, the central organizing principle is that reconstruction is an orbit-recovery problem: one can only hope to recover the orbit of the unknown signal under the symmetry group preserved by the measurements [1709.08836], [2203.02774].

## 1. Concept and formal ambiguity class

Conjugate phase retrieval was introduced as a relaxed version of complex phase retrieval in which conjugation is accepted as an unavoidable ambiguity. For a finite family \(\Phi=\{\varphi_n\}_{n\in I}\subset \mathbb C^M\), the defining property is
\[
|\langle x,\varphi_n\rangle|=|\langle y,\varphi_n\rangle|\ \forall n\in I \quad\Longrightarrow\quad x=e^{i\theta}y \ \text{or}\ x=e^{i\theta}\overline{y},
\]
for some \(\theta\in[0,2\pi)\) [1709.08836]. In complex Hilbert-space formulations, the same ambiguity appears as \(x=\lambda y\) with \(|\lambda|=1\), but conjugate phase retrieval enlarges the target quotient by also identifying conjugates when the measurements do not separate them [2606.12593].

This enlargement is not merely terminological. For real measurement vectors \(\varphi_n\in\mathbb R^M\), one has
\[
|\langle x,\varphi_n\rangle|=|\langle \overline{x},\varphi_n\rangle|,
\]
so real frames can never be phase retrievable on \(\mathbb C^M\) in the ordinary sense, but they may still be conjugate phase retrievable [1709.08836]. The same phenomenon is highlighted in the general phase retrieval literature: real measurement vectors in the complex setting fail to distinguish complex conjugates, which directly motivates a weakened injectivity notion modulo phase and conjugation rather than phase alone [1403.1458].

A related but distinct ambiguity arises in Fourier phase retrieval. There the natural symmetry is not entrywise conjugation by itself, but the action of
\[
O(2)=S^1\ltimes\{\pm1\},
\]
where \(S^1\) acts by multiplication by a global phase and \(-1\in\{\pm1\}\) acts by conjugation and reflection [2203.02774]. This is the canonical setting in which “conjugate phase retrieval” is best understood as symmetry-aware recovery under a larger intrinsic ambiguity group.

## 2. Finite-dimensional theory over \(\mathbb C^M\)

The foundational finite-dimensional treatment establishes conjugate phase retrieval as a genuine intermediate notion between complex phase retrieval and norm retrieval [1709.08836]. Its key structural equivalence is phase-lift based: for \(x,y\in\mathbb C^M\),
\[
x\sim y \iff xx^*=yy^*,
\]
whereas
\[
x\overset{\mathrm{conj}{\sim} } y \iff \operatorname{Re}(xx^*)=\operatorname{Re}(yy^*).
\]
Thus ordinary complex phase retrieval seeks to recover the full rank-one Hermitian matrix \(xx^*\), while conjugate phase retrieval with real measurements seeks only \(\operatorname{Re}(xx^*)\) [1709.08836]. This reduction explains why the obstruction set is governed by real symmetric rank-\(\le 4\) geometry rather than the rank-\(\le 2\) Hermitian geometry of standard complex phase retrieval.

For a real frame \(\Phi=\{\varphi_n\}_{n=1}^N\subset\mathbb R^M\), the relevant linear map is
\[
\mathcal A(Q)=\big(\varphi_1^TQ\varphi_1,\dots,\varphi_N^TQ\varphi_N\big)^T,
\]
acting on real symmetric matrices. The kernel criterion states that \(\Phi\) is conjugate phase retrievable if and only if
\[
\ker(\mathcal A)\cap \operatorname{Re}(\mathcal S_{\mathbb C}^{1,1})=\{0\},
\]
with a sufficient condition
\[
\ker(\mathcal A)\cap \mathcal S_{\mathbb R}^4=\{0\},
\]
because \(\operatorname{Re}(\mathcal S_{\mathbb C}^{1,1})\subseteq \mathcal S_{\mathbb R}^4\) [1709.08836]. This formulation is the direct analogue of the rank-nullspace criteria used in standard complex phase retrieval [1403.1458], but adapted to the weaker quotient.

The low-dimensional cases admit complete characterizations. In \(\mathbb C^2\),
\[
N^*(2)=N_*(2)=3,
\]
and a real \(2\times 3\) frame is conjugate phase retrievable if and only if the determinant of the associated quadratic measurement matrix is nonzero [1709.08836]. In this dimension, conjugate phase retrieval is equivalent to the complement property. In \(\mathbb C^3\),
\[
N^*(3)=N_*(3)=6,
\]
and a real \(3\times 6\) frame is conjugate phase retrievable if and only if the corresponding \(6\times 6\) determinant condition holds; unlike the two-dimensional case, the complement property is no longer sufficient [1709.08836].

For \(M\ge 4\), a generic real frame with at least
\[
4M-6
\]
measurements is conjugate phase retrievable in \(\mathbb C^M\) [1709.08836]. This generic threshold contrasts with the \(4M-4\) heuristic and conjectural landscape for standard complex phase retrieval surveyed in the broader literature [1403.1458]. A plausible implication is that allowing conjugation lowers the effective algebraic complexity of the injectivity problem.

The same \(4N-6\) count reappears in an infinite-dimensional-to-finite-dimensional specialization for spline Hermite sampling. For \(\mathbb C^N\), the explicit real frame
\[
\Psi=\{\psi_n:1\le n\le 2N-1\}\cup\{\tilde\psi_n:1\le n\le 2N-5\},
\]
with
\[
\psi_n=(1,\gamma_n,\gamma_n^2,\dots,\gamma_n^{N-1})^T,\qquad
\tilde\psi_n=(0,1,2\gamma_n',\dots,(N-1)(\gamma_n')^{N-2})^T,
\]
does conjugate phase retrieval [2304.06206]. This provides concrete deterministic examples of real conjugate phase retrievable frames beyond generic existence.

## 3. Fourier intensity and algebraic ambiguity structure

One-dimensional Fourier phase retrieval furnishes the clearest algebraic model of conjugation-related ambiguity. In the general phase retrieval model
\[
\text{find } x\in\Omega \quad \text{subject to} \quad y = |Ax|^2,
\]
the relevant symmetry group depends on the measurement operator [2203.02774]. For complex generic linear measurements it is \(S^1\), but for one-dimensional Fourier intensity the invariance group is
\[
O(2) = S^1 \ltimes \{\pm 1\},
\]
with \(-1\) acting by conjugation and reflection [2203.02774]. The data are
\[
\hat{x}(\omega)=\sum_{n=0}^{N-1} x[n]\omega^{n},\qquad
A_x(\omega)=|\hat{x}(\omega)|^2,
\]
and the Fourier intensity is equivalent to the aperiodic autocorrelation \(\tilde a_x[\ell]\) [2203.02774].

The ambiguity set is completely characterized by the root-flip theorem quoted there. If \(\gamma_1,\dots,\gamma_{N-1}\) are the roots of \(\hat x\), then \(x'\) has the same Fourier intensity as \(x\) if and only if there is a subset \(S \subset [1,N-1]\) and angle \(\theta\) such that
\[
\hat{x'}(\omega) = e^{i \theta} \prod_{i \in S} \gamma_i (\omega - \overline{\gamma}_i^{-1})\prod_{j \notin S} (\omega - \gamma_j).
\]
Each root may be kept or replaced by its reflected-conjugate reciprocal
\[
\gamma_i \longleftrightarrow \overline{\gamma_i}^{-1},
\]
and the extreme case \(S=[1,N-1]\) yields a scalar multiple of the conjugate-reflected signal [2203.02774]. If the roots are distinct and none is paired with its reciprocal-conjugate partner, then there are \(2^{N-2}\) distinct signals modulo the trivial symmetry group \(S^1\ltimes\{\pm1\}\) [2203.02774].

This algebraic picture clarifies two points. First, conjugation is an intrinsic ambiguity of Fourier intensity, not an artifact of a particular proof technique. Second, modding out by phase and conjugate reflection does not generally restore uniqueness in one dimension. The paper gives a concrete example of four distinct vectors \(x_1,\dots,x_4\) with the same Fourier intensity
\[
A(\omega) =  9/2 \cos(3\theta) + 45/4 \cos(2\theta) + 91/2 \cos \theta + 205/2,
\]
where \(\omega=e^{-i\theta}\), and notes that these vectors are not related by a trivial ambiguity [2203.02774]. This establishes that the fiber geometry can remain large even after quotienting by the natural conjugation symmetry.

Sparse Fourier models sharpen this uniqueness picture. For discrete-time sparse signals of length \(n\), almost all \(k\)-sparse signals with aperiodic support can be uniquely recovered by solving the sparse autocorrelation inverse problem, but only up to time-shift, conjugate-flip, and global phase [1311.2745]. The conjugate-flipped signal is
\[
\tilde x=\{x_{l_x-1}^\star, x_{l_x-2}^\star, \dots, x_0^\star\},
\]
and a central structural lemma states that if two non-equivalent signals \(x_1,x_2\) have the same autocorrelation, then there exist \(g\) and \(h\) such that
\[
x_1 \equiv g \star h,\qquad x_2 \equiv g \star \tilde{h},
\]
which makes conjugate-flip a built-in algebraic mechanism of nonuniqueness [1311.2745]. The same paper develops the Two-stage Sparse Phase Retrieval algorithm and proves that it can provably recover most \(O(n^{1/2-\eps})\)-sparse signals, up to a time-shift, conjugate-flip and global phase, with a noise-robust regime for most \(O(n^{1/4-\eps})\)-sparse signals [1311.2745].

In sparse multivariate super-resolution, the inevitable ambiguity class is again explicit:
\[
\widehat{\mu} = \widehat{e^{i\alpha}\mu} = \widehat{\mu(\cdot-x_0)} = \widehat{\overline{\mu(-\cdot)}},
\]
so recovery is only unique modulo global phase shift, translation, and conjugated reflection [2301.07696]. For structured signals
\[
\mu \;=\; \sum_{n=1}^{N} c_n\,\nu(\cdot-T_n),
\]
the paper shows that multivariate recovery can be reduced to line-wise one-dimensional problems and resolved, up to the inevitable ambiguities, from \(\mathcal O(DN^2)\) phaseless Fourier samples on \(2D-1\) lines [2301.07696]. This suggests that additional geometry and adaptive sampling can control, but not eliminate, conjugation-generated ambiguity.

## 4. Infinite-dimensional sampling theories

Conjugate phase retrieval has been developed extensively in function spaces where the signal class is closed under conjugation and the measurements are phaseless samples or Hermite-type samples.

In Paley–Wiener space \(PW_\pi\), the ambiguity is
\[
f \sim g \quad \Longleftrightarrow \quad f = \lambda g \ \text{or}\ f = \lambda g^\sharp,\qquad |\lambda|=1,
\]
where
\[
f^\sharp(z) := \overline{f(\overline z)}.
\]
A principal result is that conjugate phase retrieval can be accomplished in \(PW_{\pi}\) by sampling only on the real line by using structured convolutions, and can also be accomplished by sampling both \(f\) and \(f^{\prime}\) only on the real line [1910.12975]. If \(\{t_n\}\) is a sampling sequence for \(PW_{2\gamma}\), then the maps
\[
\mathcal A(f)=\bigl(|f(t_n)|,\ |f(t_n+b)-f(t_n)|\bigr)_n
\]
and
\[
\widetilde{\mathcal A}(f)=\bigl(|f(t_n)|,\ |f'(t_n)|\bigr)_n
\]
are one-to-one on \(PW_\gamma/\sim\) under the stated conditions [1910.12975]. The same work shows that, generically, conjugate phase retrieval can be accomplished by sampling at three times the Nyquist rate, whereas phase retrieval requires sampling at four times the Nyquist rate [1910.12975]. This is one of the clearest quantitative separations between the standard and conjugate formulations.

A closely related graph-based extension proves that for signals in the Paley-Wiener space, any complex-valued function can be recovered, up to a unimodular constant and conjugation, from structured phaseless samples taken at three times the Nyquist rate [2507.22468]. In that framework, the sampled values are treated as a graph signal, and connectivity of a signal-dependent triangle graph is sufficient for conjugate recovery from absolute values on vertices and relative magnitudes between neighboring vertices [2507.22468]. The same paper provides two numerical reconstruction algorithms for Paley–Wiener and general shift-invariant spaces [2507.22468].

For compactly supported real generators \(\phi\), the complex shift-invariant space
\[
\mathcal S(\phi)=\left\{\sum_{k\in\mathbb Z} c_k\,\phi(x-k)\ :\ c_k\in\mathbb C\right\}
\]
supports a local-to-global theory of conjugate phase retrievability [2304.06206]. When \(\phi\) has the spanning property
\[
W_{\phi,(0,1)}=\mathbb H_L,
\]
there exists a finite set
\[
\Gamma=\{\gamma_1,\dots,\gamma_{L(L+1)/2}\}\subset(0,1)
\]
such that any \(f\in\mathcal S(\phi)\) satisfying the global coefficient conditions can be reconstructed, up to unimodular constant and conjugation, from
\[
|f(\gamma+j)|,\qquad \gamma\in\Gamma,\ j\in\mathbb Z
\]
[2304.06206]. For spline spaces \(\mathcal B_N\), point-sampling alone is insufficient when \(N\ge 3\), but Hermite phaseless sampling restores uniqueness: there are sets \(\Gamma,\Gamma'\subset(0,1)\) with
\[
|\Gamma|=2N-1,\qquad |\Gamma'|=2N-5,
\]
such that \(f\in\mathcal B_N\) can be determined, up to unimodular constant and conjugation, from \(|f(\gamma)|\) on \(\Gamma+\mathbb Z\) and \(|f'(\gamma')|\) on \(\Gamma'+\mathbb Z\) [2304.06206].

The Gaussian-generated shift-invariant space
\[
V_{\beta,\lambda} :=\left\{f(x)=\sum_{k\in\mathbb Z} c_k e^{-\lambda(x-\beta k)^2}:\{c_k\}_{k\in\mathbb Z}\in \ell^\infty(\mathbb Z)\right\}
\]
admits an especially sharp theory [2412.03807]. Because the generator is real-valued, the space is conjugate invariant and the natural ambiguity is
\[
g = zf \quad \text{or} \quad g = z\overline f,\qquad |z|=1.
\]
If \(\Gamma\subset\mathbb R\) is separated with lower Beurling density
\[
D^-(\Gamma)>2\beta^{-1},
\]
then \(f\) is uniquely determined, up to a unimodular constant and conjugation, from the phaseless Hermite samples
\[
\big\{|f(\gamma)|,\ |f'(\gamma)|:\gamma\in\Gamma\big\}
\]
[2412.03807]. For finitely supported coefficient sequences, the same paper gives an explicit reconstruction procedure based on recovering the exponential coefficients in \(|f|^2\) and an auxiliary derivative-related quantity, then reconstructing the coefficients recursively [2412.03807].

Across these infinite-dimensional models, the common mechanism is that the measurements determine \(|f|^2\), \(|f'|^2\), or finite-dimensional local Gram data, and entire-function or algebraic arguments then show that equality of these phaseless quantities forces equality up to phase or conjugation. This suggests that conjugate phase retrieval is particularly natural in analytically structured function spaces where conjugation preserves the model class.

## 5. Group-theoretic and graph-theoretic formulations

A group-theoretic version of conjugate phase retrieval appears in permutation representations. For a complex subspace \(\mathcal H\subset \mathbb C^X\) with real-valued measurement vectors \(\Psi\subset \mathbb R^X\cap\mathcal H\), a system does conjugate phase retrieval if
\[
\mathcal A_\Psi(f)=\mathcal A_\Psi(g)
\]
implies the existence of \(\alpha\in\mathbb T\) such that either
\[
f=\alpha g\qquad\text{or}\qquad f=\alpha \overline g,
\]
with conjugation entrywise [2109.07123]. For the affine group
\[
G=\mathbb Z_p\rtimes \mathbb Z_p^\ast,\qquad p>2,
\]
acting on the zero-sum subspace
\[
\mathcal H_0=\left\{x\in\mathbb C^p:\sum_{m=0}^{p-1}x(m)=0\right\},
\]
the orbit of a difference vector under a doubly transitive action does conjugate phase retrieval on \(\mathcal H_0\) [2109.07123]. The geometric reason is that equality of magnitudes across the orbit forces equality of all pairwise distances among the complex coordinates, and Euclidean rigidity then leaves only phase or conjugation [2109.07123].

The same representation supports stronger properties. The canonical irreducible representation \(\pi_0\) on \(\mathcal H_0\) admits explicit generating vectors whose orbits achieve matrix recovery, the strongest retrieval notion considered there [2109.07123]. Since matrix recovery implies phase retrieval, and the paper also develops conjugate phase retrieval and sign retrieval in the same framework, it places conjugate recovery within a hierarchy of information-completeness properties tied to representation theory [2109.07123].

Graph-based conjugate phase retrieval provides a complementary local-geometric model [2507.22468]. For a complex-valued graph signal \(\mathbf f=(f_n)_{n\in V}\), the measurements are vertex magnitudes \(|f_n|\) and edge relative magnitudes \(|f_n-f_m|\). A signal-dependent graph \(\mathcal G_{\mathbf f}\) is built from triangles of the underlying graph, and two triangles are adjacent if they share a common non-collinear edge, meaning
\[
f_n\overline{f_m}\neq f_m\overline{f_n}.
\]
If every vertex belongs to some triangle and \(\mathcal G_{\mathbf f}\) is connected, then \(\mathbf f\) is determined, up to a unimodular constant and conjugation, from \(|f_n|\) and \(|f_n-f_m|\) [2507.22468]. The paper further constructs explicit reference-point and circulant graph models where these conditions are easy to verify, and applies the theory to shift-invariant spaces and STFT-based sampling [2507.22468].

These results emphasize that conjugate phase retrieval can be framed either globally, via quotient manifolds and lifted operators, or locally, via propagation of orientation choices across overlaps, non-collinear edges, or sample neighborhoods.

## 6. Algorithms, applications, and neighboring frameworks

Algorithmic work on conjugate phase retrieval falls into two broad classes: methods that solve the standard phaseless inverse problem but are interpreted modulo the larger ambiguity class, and methods designed to exploit conjugate symmetry explicitly.

In finite-dimensional standard phase retrieval, the PhaseCut formulation rewrites the problem
\[
b = |Ax|
\]
as a nonconvex quadratic program over unit-modulus phases
\[
\tag{QP(M)} \min u^*Mu \quad \text{s.t. } |u_i|=1,\ i=1,\dots,n,
\]
with the semidefinite relaxation
\[
\tag{PhaseCut} \min \operatorname{Tr}(UM) \quad \text{s.t. } \operatorname{diag}(U)=1,\ U\succeq 0
\]
[1206.0102]. This paper is not about conjugate phase retrieval per se, but its complex-valued phase-lifting perspective is directly relevant because it treats the recovery variable as a phase vector on the complex torus and supplies a convex framework that can accommodate symmetry-aware formulations [1206.0102]. A plausible implication is that conjugate phase retrieval relaxations may be designed by replacing the ordinary quotient geometry with its conjugate-modified analogue.

Alternating projections also remain useful. In \(PW_\pi\), the Gerchberg-Saxton method of alternating projections can accomplish the reconstruction from vectors that do conjugate phase retrieval in finite dimensional spaces, and experiments with an explicit \(3\times 6\) conjugate phase retrievable matrix yielded 850 of 1000 reconstructions succeeded within 900 iterations [1910.12975]. The paper notes the usual traps and tunnels behavior, indicating that conjugate injectivity does not by itself remove the nonconvexity of iterative algorithms [1910.12975].

MRI provides an application where conjugation symmetry is operational rather than purely abstract. In the signal model
\[
y_j(\vec k) = \int d\vec x \, |\rho(\vec x)| e^{i\psi(\vec x)} c_j(\vec x) e^{-i2\pi \vec k\cdot \vec x}
      = \int d\vec x \, |\rho(\vec x)| \hat c_j(\vec x) e^{-i2\pi \vec k\cdot \vec x},
\]
with
\[
\hat c_j(\vec x) = e^{i\psi(\vec x)} c_j(\vec x),
\]
phase-constrained reconstructions require absolute-phase maps \(\hat c_j\), not merely relative coil sensitivities [1509.03557]. VCC-ESPIRiT extends ESPIRiT to physical and virtual conjugate coils by defining
\[
y_{j\star}(\vec k) := y_j^\star(-\vec k),
\]
so that
\[
\hat c_{j\star}(\vec x) = \hat c_j^\star(\vec x).
\]
The crucial identity
\[
\frac{1}{2} \operatorname{Im}\log \sum_j \tilde c_j(\vec x)\tilde c_{j\star}(\vec x)
= \phi(\vec x)+l\pi,\qquad l\in\mathbb Z
\]
reveals the unknown pixelwise phase up to a \(\pi\) ambiguity [1509.03557]. This is not presented as “conjugate phase retrieval” in the abstract mathematical sense, but it is a symmetry-based phase-recovery mechanism in which conjugate channels provide redundant information needed to estimate phase-inclusive sensitivities.

The same application also exposes a limitation. When the image phase contains high-frequency variation, VCC-ESPIRiT produces a second set of maps with eigenvalue near 1, indicating that the data space is not well represented by a single real-valued phase-constrained model [1509.03557]. This suggests that conjugation-aware recovery may require multi-map or relaxed formulations when the phase model is only approximately valid.

## 7. Relation to broader retrieval notions and open directions

Conjugate phase retrieval belongs to a wider family of quotient-based inverse problems. Generalized phase retrieval for operator-valued measurements replaces frame vectors by bounded operators \(\Lambda_i\in\mathcal B(H,H_i)\) and seeks recovery from \(\|\Lambda_i x\|\) up to a unimodular scalar [2606.12593]. The exact definition is
\[
\|\Lambda_i x\|=\|\Lambda_i y\|\quad \text{for all }i\in\mathbb I
\]
implies
\[
x=\lambda y,\qquad |\lambda|=1.
\]
The paper does not explicitly develop conjugate phase retrieval as a separate notion, but it places the standard phase/sign ambiguity in a unified Hilbert-space setting and proves that g-phase retrieval is characterized by stability of both phase retrieval and norm retrieval under all invertible pre-compositions [2606.12593]. This broader perspective suggests that a generalized conjugate phase retrieval theory would likely require replacing the unimodular quotient by a larger symmetry quotient analogous to the \(S^1\ltimes\{\pm1\}\) structure seen in Fourier intensity.

Several recurring themes define the current state of the subject. First, the relevant ambiguity group is measurement-model dependent. In generic complex linear measurements it is \(S^1\); with real sensing vectors it becomes phase plus conjugation; in one-dimensional Fourier intensity it is global phase and conjugate reflection [1709.08836], [2203.02774]. Second, algebraic injectivity and practical identifiability can diverge sharply: even after quotienting by the correct symmetry group, one-dimensional Fourier fibers may remain exponentially large [2203.02774]. Third, additional side information can break or localize conjugation ambiguities. The algebraic survey notes that a generic signal can be recovered from Fourier magnitude plus one extra time-domain sample, up to either global phase or conjugate reflection depending on the sample location [2203.02774]. In function-space models, derivative data or relative magnitude data play a similar symmetry-breaking role [1910.12975], [2304.06206], [2412.03807], [2507.22468].

A persistent open issue is the lack of a simple injectivity characterization for complex measurement systems even in ordinary phase retrieval. For a generic complex matrix \(A\in\mathbb C^{M\times N}\) with \(M \geq 4N-4\), every vector \(x \in \mathbb C^N\) can be recovered, up to multiplication by a scalar \(e^{i \theta} \in S^1\), from the phaseless measurements \(|Ax|\), but a simple complete characterization of complex matrices guaranteeing injectivity modulo \(S^1\) is not known [2203.02774]. A plausible implication is that symmetry-enlarged variants, including conjugate phase retrieval outside highly structured settings, are likely to remain algebraically subtle.

Taken together, the literature shows that conjugate phase retrieval is not a single theorem but a family of inverse problems organized by symmetry. Its finite-dimensional core is now well developed; its Fourier and sparse incarnations reveal rich algebraic nonuniqueness; its infinite-dimensional sampling theories exhibit sharp density and sample-complexity gains over standard phase retrieval; and its applications, especially in MRI and structured sensing, demonstrate that conjugation symmetry is often a physically meaningful feature of the measurement process rather than a mathematical nuisance [1709.08836], [2203.02774], [1910.12975], [2304.06206], [2412.03807], [2507.22468].

Source: https://www.emergentmind.com/topics/conjugate-phase-retrieval