--- title: Extended Hadamard Technique Overview url: https://www.emergentmind.com/topics/extended-hadamard-technique type: topic --- # Extended Hadamard Technique Overview “Extended Hadamard Technique” is not a single universally fixed method; the expression is used for several technically distinct extensions of Hadamard-based ideas across imaging, quantum information, combinatorics, coding theory, asymptotic analysis, and fractional calculus. In each case, the extension starts from a standard Hadamard object—such as a Hadamard matrix, Hadamard unitary, Hadamard product, Hadamard code, or Hadamard expansion—and enlarges its scope by introducing a new structural criterion, a new recursion, a new geometric decomposition, or a new computational framework. A plausible unifying description is that these techniques preserve the cancellation, orthogonality, equal-amplitude, or correlation properties associated with Hadamard structures while adapting them to a broader class of problems [2109.14819]. ## 1. Terminological scope and core mathematical motifs Several mathematically different notions underlie the phrase. In linear algebra and combinatorics, a Hadamard matrix \(H\) is a \(\{\pm1\}\)-matrix satisfying \[ HH^T=nI_n, \] and extended techniques typically construct larger Hadamard matrices from smaller seeds, conference matrices, finite fields, generalized Boolean functions, or mutually unbiased bases [1601.00635]. In matrix analysis for mixture models, the Hadamard Extension of an \(n\times k\) matrix \(Q\) is the \(2^n\times k\) matrix whose rows are all Hadamard products of subsets of the rows of \(Q\), with \[ Q_S := r_{i_1}\odot \cdots \odot r_{i_\ell}, \qquad Q_\emptyset=1, \] and full column rank of this extension is a necessary ingredient of identification algorithms for mixtures of product distributions on binary random variables [2101.11688]. In quantum information, the extension is formulated through Hadamard unitaries with flat-modulus entries \[ U_{jk}=\frac{1}{\sqrt n}e^{i\theta_{jk}}, \] and a set of states is promoted to a “Hadamard set” when its Gram-Schmidt matrix can be diagonalized by such a unitary [2109.14819]. In quantum algorithms, the Hadamard product of amplitude-encoded states is extended from the conventional postselection circuit to a Fourier-space method with localized truncation, shifting the relevant complexity parameter from the grid size \(N\) to Fourier regularity [2606.03612]. In asymptotic analysis, “extended Hadamard” designates a finite-segment steepest-descent expansion for the Airy function that replaces earlier non-systematic contour subdivisions by a small number of branch-point-controlled segments and introduces upper incomplete Gamma functions through tail integrals [1909.13394]. This diversity of usage shows that the term is best understood as a family resemblance rather than a single theorem. The common pattern is extension by structural preservation: orthogonality is preserved in matrix constructions, fixed marginals in quantum masking, rank information in Hadamard extensions, and convergence or accuracy in analytic and numerical variants. ## 2. Detail-enhanced sampling in Hadamard single-pixel imaging In Hadamard single-pixel imaging (HSI), the extended technique appears as a detail-enhanced sampling strategy designed to improve low-sampling reconstructions by balancing low-frequency energy and high-frequency detail [2209.04449]. Standard Hadamard ordering methods often prioritize coefficients according to pattern characteristics, whereas the reported difficulty is that the Hadamard spectrum energy is mostly concentrated in the upper left corner of the spectrum; sampling only this strongest low-frequency region reconstructs coarse structure but can also produce blurred edges, indistinguishable fine details, ringing artifacts, and loss of high-frequency structure [2209.04449]. The proposed strategy has two stages. First, a preliminary order (PO) is obtained from a Hadamard power spectrum built from 800 grayscale images from DIV2K after Hadamard transformation, normalization, and summation; descending sorting of the coefficients reveals the direction in the Hadamard spectrum where energy is arranged from large to small [2209.04449]. Second, coefficients are sampled randomly along that order using the exponential probability function \[ E(n)=a^{[(n-1) / (p \times q)]}, \qquad n=1 \cdots p\times q, \] where \(08\), then there exist exactly \(\lfloor (k-1)/2\rfloor\) pairwise nonequivalent \(\mathbb Z_4\)-linear Hadamard \((N,2N,N/2)\)-codes and \(\lfloor (k+1)/2\rfloor\) pairwise nonequivalent \(\mathbb Z_4\)-linear extended perfect \((N,2^N/2N,4)\)-codes [0710.0199]. The recurrent constructions \[ H'=\{(a,a+b): a\in H,\ b\in R'\}, \qquad H''=\{(a,a+b,a+2b,a+3b): a\in H,\ b\in R''\} \] increment the parameters \(r_2\) and \(r_1\), respectively [0710.0199]. At the circuit level, recursive Hadamard-code encoders achieve exact lower bounds on XOR complexity. For the \([2^k-1,k]\) Hadamard code, the paper proves a lower bound of \(2^k-k-1\) XORs and gives a matching recursive encoder; for systematic punctured Hadamard codes the exact bound is \(2^k-2\), and for non-systematic punctured Hadamard codes it is \(2^k-1\) [1804.09903]. By duality and the transposition principle, the corresponding Hamming and extended Hamming encoding bounds are \(2^{k+1}-3k-2\) and \(2^{k+1}-2k-4\), respectively [1804.09903]. Protograph-based LDPC-Hadamard codes extend the classical LDPC-Hadamard framework by replacing SPC check nodes in a generalized protograph with Hadamard super-checks and then lifting the protograph [2010.08285]. If the row weight of a Hadamard check node is \(d_{c_i}\), the associated Hadamard order is \[ r=d_{c_i}-2. \] The modified PEXIT analysis supports degree-1 and punctured nodes, and the reported thresholds range from \(-1.53\ \text{dB}\) to \(-1.42\ \text{dB}\); at BER \(10^{-5}\), the reported gaps to the ultimate Shannon limit range from \(0.40\ \text{dB}\) for rate \(0.0494\) to \(0.16\ \text{dB}\) for rate \(0.003\) [2010.08285]. A recent matrix-sequence synthesis framework uses a \(4\times 4\) circulant Hadamard seed constructed from the generalized Boolean function \[ f(x_1,x_2)=\frac{q}{2}\big(x_1x_2+\theta_1x_1+\theta_2x_2\big)+\theta_3, \] and states that all 8 circulant Hadamard matrices of order 4 arise from parameter choices [2510.12315]. Recursive block doubling then produces Hadamard matrices of order \(2^{n+2}\), binary cross Z-complementary sets, binary Golay complementary sets, complete complementary codes, and binary optimal cross-Z complementary sequence sets [2510.12315]. ## 4. Quantum-information and quantum-computing extensions In quantum information masking, the extension is a structural criterion for deterministic unitary masking. A unitary masks a set of states \(\{|\alpha_k\rangle_A\}_{k=1}^n\) if it maps them to bipartite states with identical local marginals, \[ \operatorname{Tr}_B |\Psi_k\rangle\langle \Psi_k| = \rho_A,\qquad \operatorname{Tr}_A |\Psi_k\rangle\langle \Psi_k| = \rho_B. \] For a set of states with Gram-Schmidt matrix \[ G=\big(\langle \alpha_i|\alpha_j\rangle\big), \] the paper defines a Hadamard set by the existence of a Hadamard unitary \(U\) such that \[ G=U^\dagger \,\mathrm{diag}(\lambda_1,\lambda_2,\dots,\lambda_n)\, U. \] Theorem 2 states that a Hadamard set \(\{|\alpha_k\rangle_A\}_{k=1}^n\), with \(n\le d\), can be deterministically masked by a unitary operation [2109.14819]. The masked states are constructed as \[ |\Psi_k\rangle_{AB} = \sum_{j=1}^n \sqrt{\frac{\lambda_j}{n}}\, e^{i\theta_{jk}}\, |j\rangle_A\otimes |j\rangle_B, \] so the reduced density matrices \[ \sum_{j=1}^n \frac{\lambda_j}{n}|j\rangle\langle j| \] are independent of \(k\) [2109.14819]. Theorem 3 further states that a linear combination \(|\alpha(\mathbf x)\rangle=\sum_k x_k|\alpha_k\rangle\) can be masked together with the set iff \[ |(U\mathbf x)_j|=1,\qquad j=1,\dots,n. \] In quantum compilation, Hadamard minimization is treated as an exact synthesis objective for Clifford+\(T\) and Clifford+\(R_Z\) circuits [2302.07040]. A Pauli-rotation sequence is encoded in a binary matrix \[ \mathcal{S}=\begin{bmatrix}\mathcal{Z}&\mathcal{X}\end{bmatrix}, \] and the diagonalization problem H-Opt asks for a Clifford circuit with minimal Hadamard count. The central formula is \[ h(C)=\operatorname{rank}(M), \qquad M=\begin{bmatrix}\mathcal{X} & A\end{bmatrix}, \] where \(A\) is the commutativity matrix of the sequence [2302.07040]. A more refined problem, Internal-H-Opt, minimizes Hadamards between the first and last \(T\) gate, and the optimum is exactly \[ \operatorname{rank}(A). \] The paper motivates this by two resource effects: Hadamards can block \(T\)-count optimization, and each gadgetized Hadamard requires one ancilla qubit, one CZ gate, and one measurement [2302.07040]. A programming-language extension adds the Hadamard gate to the reversible classical language \(\Pi\). The resulting Hadamard-\(\Pi\) language has a sound and complete equational semantics and characterizes exact orthogonal matrices over \[ \mathbb{Z}\left[\frac{1}{\sqrt{2}}\right]. \] The construction proceeds via an auxiliary language Q-\(\Pi\) with both \((-1)\) and \(hadamard\), then hides \((-1)\) by simulating it as \[ hadamard\; swap\; hadamard. \] A major technical result is a finite presentation and synthesis algorithm for the groups \[ O_n\left(\mathbb{Z}\left[\frac{1}{\sqrt{2}}\right]\right), \] using generators consisting of sign flips, swaps, and Hadamard-like two-level transformations [2506.06835]. In quantum algorithms for amplitude encoding, the Hadamard product state of two states \[ \ket{\psi}_n=\sum_{j=0}^{N-1}\psi_j\ket{j}_n,\qquad \ket{\varphi}_n=\sum_{j=0}^{N-1}\varphi_j\ket{j}_n \] is conventionally prepared by a non-unitary postselection procedure whose success probability is \[ \mathbb{P}_{\text{suc}}=\sum_{j=0}^{N-1}|\psi_j\varphi_j|^2. \] For amplitude-encoded samples of smooth functions on a uniform grid, the paper states this typically scales as \(O(1/N)\) [2606.03612]. The extension moves to Fourier space, with coefficients \[ c_k=\frac{1}{\sqrt N}\sum_{j=0}^{N-1}\psi_j e^{-i2\pi kj/N},\qquad d_{k'}=\frac{1}{\sqrt N}\sum_{j=0}^{N-1}\varphi_j e^{-i2\pi k'j/N}, \] and retains only a localized window of size \(M\) in one factor. The resulting success probability becomes approximately \(O(1/M)\), with \[ M=O\big((1/\varepsilon)^s\big), \] so the query complexity is \(O(1/\varepsilon^s)\), independent of \(N\); if either input has finitely many nonzero Fourier coefficients, the algorithm is exact with \(O(1)\) oracle queries and \(O(n^2)\) additional gates [2606.03612]. ## 5. Analytic and geometric extensions: Hadamard expansions, Hadamard spaces, and Hadamard states In asymptotic analysis, extended Hadamard expansions for the Airy function arise from a finite geometric splitting of the steepest-descent contour rather than the large number of non-systematic path subdivisions used in earlier Hadamard expansions [1909.13394]. The phase is \[ f(w,\alpha)=w\alpha-\alpha^3/3, \] and the steepest-descent parameterization \[ w\alpha-\frac{\alpha^3}{3}=-\frac{2}{3}w^{3/2}-s^2 \] defines an inverse map \(\alpha=\alpha(s)\) on a three-sheeted Riemann surface with branch points at \(s=0\), \(s=\pm \frac{2i}{\sqrt3}w^{3/4}\), and \(s=\infty\) [1909.13394]. The contour is split into five segments: one central segment, two finite branch-point-centered segments, and two tails to infinity. Because two segments are semi-infinite, the expansion contains upper incomplete Gamma functions \[ \Gamma(\nu,x)=\int_x^\infty t^{\nu-1}e^{-t}\,dt, \] whereas earlier Hadamard series involved only lower incomplete Gamma functions [1909.13394]. The paper states that the resulting expansion is convergent for all values of the complex variable and gives a geometric interpretation of the Stokes phenomenon at \(\arg z=\pm 2\pi/3\). In metric geometry and nonlinear analysis, Hadamard spaces are complete CAT(0) spaces, and the Lie–Trotter–Kato formula has been extended to this setting [1301.6496]. For a proper convex lsc function \(f:H\to(-\infty,\infty]\), the resolvent is \[ J_\lambda(x)=\operatorname*{argmin}_{y\in H}\left[f(y)+\frac{1}{2\lambda}d(x,y)^2\right], \] and the gradient flow semigroup is \[ S_t(x)=\lim_{n\to\infty}\left(J_{t/n}\right)^{(n)}(x). \] If \(f=\sum_{j=1}^k f_j\), the product formula becomes \[ S_t(x)=\lim_{n\to\infty}\left(J_{t/n}^k\circ \cdots \circ J_{t/n}^1\right)^{(n)}(x), \] and, under a local compactness assumption on one domain, \[ S_t(x)=\lim_{n\to\infty}\left(S_{t/n}^k\circ P_k \circ \cdots \circ S_{t/n}^1\circ P_1\right)^{(n)}(x). \] The proof replaces ultrapower arguments by weak convergence in Hadamard spaces [1301.6496]. In algebraic quantum field theory, Hadamard states are extended from normally hyperbolic operators to a broader class of decomposable Green-hyperbolic operators [2503.12537]. If the Pauli–Jordan propagator \(E_P\) satisfies \[ WF(E_P)\subset (V_+\times V_-)\cup (V_-\times V_+), \] the operator is called \(V_\pm\)-decomposable. A two-point function \(W\) is then \(V_+\)-Hadamard if \[ WF(W)\subset V_+\times V_-. \] This generalizes the standard null-cone microlocal spectrum condition and covers cases such as the Proca field, where the characteristic set is not the spacetime light cone [2503.12537]. The paper proves propagation under the equation of motion, stability under pullbacks and suitable pushforwards, preservation under tensor products and partial traces, and preservation under nonselective measurements. It also shows that for Proca states, \[ \text{FP-Hadamard} \iff \text{\(N_+\)-Hadamard}, \] thereby identifying the generalized definition with earlier formulations [2503.12537]. ## 6. Convolution quadrature and statistical identifiability as extension frameworks In fractional calculus, the convolution quadrature method developed for Riemann–Liouville operators is extended to Hadamard and Caputo–Hadamard fractional calculus by the logarithmic change of variables \[ \bar t=\log\frac{t}{a},\qquad t=a e^{\bar t}, \] which transforms a uniform mesh in \(\bar t\) into the exponential mesh \[ t_n=a\left(\frac{T}{a}\right)^{n/N} \] in physical time [2311.06869]. The Hadamard fractional integral is \[ ({}_H I_a^\alpha f)(t)=\frac1{\Gamma(\alpha)}\int_a^t \left(\log\frac{t}{s}\right)^{\alpha-1} f(s)\,\frac{ds}{s}, \] and the Caputo–Hadamard derivative is \[ ({}_{CH} D_a^\alpha f)(t)=\frac1{\Gamma(m-\alpha)} \int_a^t \left(\log\frac{t}{s}\right)^{m-\alpha-1}\delta_s^m f(s)\,\frac{ds}{s}, \] with \(\delta_t=t\frac{d}{dt}\) [2311.06869]. On the transformed mesh, BDF-\(p\) convolution quadrature with \(1\le p\le 6\) is imported through \[ \omega_p(\zeta;\alpha)=\psi_p(\zeta)^\alpha, \qquad \psi_p(\zeta)=\sum_{j=1}^p \frac1j(1-\zeta)^j, \] yielding the discrete Hadamard operator \[ \mathbb D_{\bar\tau,n}^\alpha u = \bar\tau^{-\alpha}\sum_{k=0}^n \omega_{n-k}^{(\alpha)}u(t_k). \] Because singular source terms destroy the nominal high-order accuracy, the method adds starting-step corrections through coefficients \(b_n^{(p)}\) and \(d_{j,n}^{(p,\beta)}\); the paper states that the corrected scheme recovers the designed \(p\)-th order temporal accuracy, whereas the uncorrected scheme is only first-order accurate in the singular-source setting [2311.06869]. In mixture identification, the Hadamard Extension is not a numerical or geometric approximation but a rank-completion device. For an \(n\times k\) matrix \(Q\) with rows \(r_1,\dots,r_n\), the extension \(H(Q)\) collects all subsetwise coordinate products \[ u\odot v := (u_1v_1,\ldots,u_kv_k), \qquad Q_S^j=\prod_{i\in S}Q_i^j, \] and full column rank of \(H(Q)\) is necessary for injectivity of the source-identification map \((Q,\pi)\mapsto \mu(Q,\pi)\) in mixture-of-products models [2101.11688]. The paper proves a “Knockdown theorem”: if \(H(Q)\) has full column rank, then there exists a subset \(R\) of at most \(k-1\) rows such that \(H(Q|_R)\) also has full column rank. It also introduces the NAE condition, a combinatorial sufficient condition ensuring \(\operatorname{rank} H(Q)=k\) [2101.11688]. This use of “Hadamard extension” differs from matrix-construction uses but retains the same multiplicative coordinatewise algebra. ## 7. Common structure, contrasts, and recurring misconceptions Across these domains, the extended Hadamard technique is characterized less by a single formal definition than by recurring operational themes. One theme is controlled enlargement of a Hadamard object: Scarpis–Paley–circulant constructions enlarge matrix order; MUB-based doubling enlarges dimension; \(\mathbb Z_4\)-linear recursions enlarge code length; and protograph lifting enlarges local Hadamard constraints into long low-rate codes [1601.00635]. A second theme is structural diagonalization or flattening: Hadamard unitaries diagonalize Gram matrices in masking, Hadamard gates diagonalize Pauli products in Clifford synthesis, and Fourier localization converts a Hadamard-product preparation problem into a truncated convolution structure [2109.14819]. A third theme is singularity or correlation control: finite contour segmentation controls Stokes transitions, exponential-mesh CQ controls logarithmic fractional singularities, and decomposable propagators control generalized Hadamard wavefront sets [1909.13394]. A common misconception is to treat the term as if it always referred to Hadamard matrices. The provided literature does not support that restriction. Some uses are matrix-theoretic, but others concern Hadamard products, Hadamard gates, Hadamard spaces, Hadamard states, or Hadamard sampling [2209.04449]. Another misconception is that these extensions are merely heuristic embellishments. In the cited works, the extensions are formalized by explicit criteria or constructions: \(WF(E_P)\subset (V_+\times V_-)\cup(V_-\times V_+)\) in generalized Hadamard state theory, \(h(C)=\operatorname{rank}(M)\) in optimal Hadamard-count synthesis, \(E(n)=a^{[(n-1)/(p\times q)]}\) in detail-enhanced HSI sampling, and \(M=O((1/\varepsilon)^s)\) in Fourier-regularity-driven quantum Hadamard products [2503.12537]. A plausible implication is that the phrase persists because Hadamard structures occupy an intermediate level of abstraction: they are concrete enough to yield implementable constructions, yet general enough to transfer between orthogonality, correlation cancellation, equal-amplitude interference, and microlocal or variational decomposition. The literature surveyed here supports that interpretation, while also making clear that “Extended Hadamard Technique” should be read contextually rather than as a single standardized method name. Source: https://www.emergentmind.com/topics/extended-hadamard-technique