Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.08393

Quantum Detection of Sequency-Band Structure

Alok Shukla, Prakash Vedula

quant-phSubmitted Feb 9, 2026• Announced Feb 10, 2026• 0 citations
arXivHTMLPDF

Abstract

We present a quantum algorithm for estimating the amplitude content of user-specified sequency bands in quantum-encoded signals. The method employs a sequency-ordered Quantum Walsh-Hadamard Transform (QWHT), a comparator-based oracle that coherently marks basis states within an arbitrary sequency range, and Quantum Amplitude Estimation (QAE) to estimate the total probability mass in the selected band. This enables the detection of structured signal components, including both high- and low-sequency features, as well as the identification of rapid sign-change behavior associated with noise or anomalies. The proposed method can be embedded as a module within a larger quantum algorithm; in this setting, both the input and output remain fully quantum, enabling seamless integration with upstream and downstream quantum operations. We show that the sequency-ordered QWHT can be implemented with circuit depth $O(\log_2 N)$ (equivalently $O(n)$ for $N=2^n$) when acting on an amplitude-encoded quantum state, whereas computing the full Walsh-Hadamard spectrum of an explicit length-$N$ classical signal requires $O(N\log_2 N)$ operations via the fast Walsh-Hadamard transform. This results in an exponential quantum advantage when the QWHT is used as a modular block within a larger quantum algorithm, relative to classical fast Walsh-Hadamard transform-based approaches operating on explicit data. From an application perspective, the proposed sequency band-energy estimation may be interpreted as a structure-based anomaly indicator, enabling the detection of unexpected high-sequency components relative to a nominal low-sequency signal class. The algorithm is applicable to quantum-enhanced signal processing tasks such as zero-crossing analysis, band-limited noise estimation, and feature extraction in the Walsh basis.

Comments
21 pages

Related papers

Quantum algorithm for edge detection in digital grayscale images

Mohit Rohida, Alok Shukla, Prakash Vedula

In this work, we propose a novel quantum algorithm for edge detection in digital grayscale images, based on the sequency-ordered Walsh-Hadamard transform. The proposed method significantly improves upon existing quantum techniques for edge detection by using a quantum algorithm for the sequency-ordered Walsh-Hadamard transform, achieving a circuit depth of $\mathcal{O}(n)$ (where $n$ is the number of qubits). This represents a notable enhancement over the Quantum Fourier Transform (QFT), which has a circuit depth of $\mathcal{O}(n^{2})$. Furthermore, our approach for edge detection has a computational cost (both gate complexity and quantum circuit depth) of $\mathcal{O}(\log_{2}(N_{1}N_{2}))$ for an image of size $N_{1}\times N_{2}$, offering a considerable improvement over the Quantum Hadamard Edge Detection (QHED) algorithm, which incurs a cost of $\mathcal{O}(\text{poly}(\log_{2}(N_{1}N_{2})))$. By integrating a quantum high-pass filter with the sequency-ordered Walsh-Hadamard transform, the algorithm effectively extracts edge information from images. Computational examples are provided to demonstrate the efficacy of the proposed algorithm which provides a better performance in comparison to QHED.

arXiv:2507.06642•Jul 9, 2025•4 citations

Real Matrix Representations of Quantum Operators: An Introduction to Quantum Index Algebra

A. Yu. Volkov, G. A. Koroteev, Yu. S. Volkov

We introduce Quantum Index Algebra (QIA) as a finite, index-based algebraic framework for representing and manipulating quantum operators on Hilbert spaces of dimension $2^m$. In QIA, operators are expressed as structured combinations of basis elements indexed by Boolean codes, allowing products, commutators, and conjugations to be computed through finite rules on discrete indices rather than through dense matrix arithmetic. This representation unifies combinatorial index structure, explicit matrix realization, and transformation properties under Walsh-Hadamard-type transforms within a single formalism. Using QIA and its associated block-matrix realization, we reformulate the Bernstein-Vazirani hidden-string problem in its phase-oracle form entirely within a real, finite-dimensional algebraic setting. We show that, under structured oracle access, the QIA procedure reproduces the Bernstein-Vazirani algorithm exactly and achieves the same asymptotic query complexity and circuit depth as the standard quantum algorithm. In particular, the hidden string is recovered by symbolic manipulation of a sparse algebraic representation of the oracle rather than by numerical simulation of quantum amplitudes. Our results demonstrate that the apparent quantum speed-up in this setting is a consequence of operator structure rather than Hilbert-space dimensionality alone. QIA thus provides a precise language for separating genuinely quantum resources from those arising from algebraic and combinatorial structures and offers a new perspective on the classical simulability of structured quantum circuits.

quant-pharXiv:2512.19977•Dec 24, 2025•0 citations

Modular Quantum Amplitude Estimation: A Scalable and Adaptive Framework

Alok Shukla, Prakash Vedula

Quantum Amplitude Estimation (QAE) is a key primitive in quantum computing, but its standard implementation using Quantum Phase Estimation is resource-intensive, requiring a large number of coherent qubits in a single circuit block to achieve high precision. This presents a significant challenge for near-term Noisy Intermediate-Scale Quantum (NISQ) devices. To address this, we introduce the Adaptive Windowed Quantum Amplitude Estimation (AWQAE) framework, a modular, scalable and adaptive approach that decouples estimation precision from the number of physical qubits required in a single circuit. AWQAE operates by iteratively estimating the phase bits in small, fixed-size chunks, using a number of smaller, independent quantum circuits, which are amenable to parallel processing. A key technical contribution of this work is introduction of a phase resolution circuit and an ancilla-guided mechanism that enables accurate chunk assignment and eigenphase reconstruction in the presence of multiple eigenstates. This design is inherently NISQ-friendly, by lowering circuit depth and qubit count per block to reduce decoherence and noise effects. A key component of our approach is a robust classical post-processing algorithm that resolves measurement ambiguities that arise during the iterative process. This post-processing routine uses a least-significant-bit (LSB)-to-most-significant-bit (MSB) correction to reconstruct the full, high-precision phase estimate, ensuring accuracy. By combining a modular quantum-classical loop with an ambiguity-aware reconstruction method, AWQAE offers a powerful and flexible solution for performing high-precision QAE on resource-constrained quantum hardware. Our approach demonstrates enhanced scalability, and adaptability, making it a promising candidate for practical applications of QAE in the NISQ era.

arXiv:2508.05805•Aug 7, 2025•3 citations

Walsh-Transform Realization of Dense-to-Sparse Quantum State Preparation

Emad Rezaei Fard Boosari

We propose a hybrid quantum state preparation method based on the Walsh--Hadamard transform within the dense-to-sparse quantum state preparation framework. The method approximately prepares structured classical data in a quantum circuit through an indirect approach. Instead of directly preparing the dense amplitude-encoded state, the method first transforms the classical data into the Walsh domain and prepares only the largest-magnitude coefficients using a sparse state-preparation algorithm. The original state can then be approximately recovered through a parallel layer of Hadamard gates. Since this reconstruction requires no CNOT gates and has circuit depth 1, the proposed method introduces no additional CNOT or circuit-depth overhead, and its quantum preparation cost is determined by the underlying sparse state-preparation algorithm. Numerical results on representative benchmark signals demonstrate that the proposed method enables accurate state preparation for signals admitting sparse or approximately sparse representations in the Walsh domain.

quant-pharXiv:2609.28760•Sep 25, 2026•0 citations

Classical postprocessing approach for quantum amplitude estimation

Yongdan Yang, Ruyu Yang

We propose an approach for quantum amplitude estimation (QAE) designed to enhance computational efficiency while minimizing the reliance on quantum resources. Our method leverages quantum computers to generate a sequence of signals, from which the quantum amplitude is inferred through classical post-processing techniques. Unlike traditional methods that use quantum phase estimation (QPE), which requires numerous controlled unitary operations and the quantum Fourier transform, our method avoids these complex and resource-demanding steps. By integrating quantum computing with classical post-processing techniques, our method significantly reduces the need for quantum gates and qubits, thus optimizing the utilization of quantum hardware. We present numerical simulations to validate the effectiveness of our method and provide a comprehensive analysis of its computational complexity and error. This hybrid strategy not only improves the practicality of QAE but also broadens its applicability in quantum computing.

arXiv:2502.05617•Physical Review A•Jun 27, 2025•1 citation

Quantum Spectral Anomaly Detection

Yewei Yuan, Michele Minervini, Mark M. Wilde +1 more

A core task in quantum anomaly detection is to compute an anomaly score that quantifies how strongly a test quantum state deviates from a given quantum dataset assumed to be normal. Classically, principal component analysis (PCA) for centered data computes the anomaly score by evaluating the test sample relative to the subspace spanned by the selected leading eigenvectors. However, for quantum data that lack a standard centering, explicitly recovering principal eigenvectors, constructing full Gram matrices, or loading quantum-random-access-memory-style data can be more costly than estimating the anomaly score itself. To avoid these costs, we propose Quantum Spectral Anomaly Detection (QSPADE), which computes PCA-like anomaly scores directly from the spectrum of the average state of the normal dataset. By replacing hard PCA rank selection with a smooth, temperature-controlled spectral threshold, QSPADE makes near-threshold spectral components contribute partially to the anomaly score. This makes the score vary continuously rather than jump when a borderline component is included or excluded, and makes it less sensitive to noise or arbitrary hard cutoffs near the threshold. In the zero-temperature limit, QSPADE recovers the hard-projector PCA score. The proposed measurement-based quantum detector can be calibrated with a sample complexity independent of the data dimension. Numerical simulations show that QSPADE behaves like kernel-PCA on encoded classical data and detects changes across a transverse-field Ising transition without predefined order parameters. Consequently, QSPADE gives an efficient framework for both quantum-kernel anomaly detection on encoded classical data and the monitoring of quantum-native systems where diagnostic observables are unknown.

quant-pharXiv:2607.05307•Jul 7, 2026•1 citation
We present a quantum algorithm for estimating the amplitude content of user-specified sequency bands in quantum-encoded signals. The method employs a sequency-ordered Quantum Walsh-Hadamard Transform (QWHT), a comparator-based oracle that coherently marks basis states within an arbitrary sequency range, and Quantum Amplitude Estimation (QAE) to estimate the total probability mass in the selected band. This enables the detection of structured signal components, including both high- and low-sequency features, as well as the identification of rapid sign-change behavior associated with noise or anomalies. The proposed method can be embedded as a module within a larger quantum algorithm; in this setting, both the input and output remain fully quantum, enabling seamless integration with upstream and downstream quantum operations. We show that the sequency-ordered QWHT can be implemented with circuit depth O(log⁡2N)O(\log_2 N)O(log2​N) (equivalently O(n)O(n)O(n) for N=2nN=2^nN=2n) when acting on an amplitude-encoded quantum state, whereas computing the full Walsh-Hadamard spectrum of an explicit length-NNN classical signal requires O(Nlog⁡2N)O(N\log_2 N)O(Nlog2​N) operations via the fast Walsh-Hadamard transform. This results in an exponential quantum advantage when the QWHT is used as a modular block within a larger quantum algorithm, relative to classical fast Walsh-Hadamard transform-based approaches operating on explicit data. From an application perspective, the proposed sequency band-energy estimation may be interpreted as a structure-based anomaly indicator, enabling the detection of unexpected high-sequency components relative to a nominal low-sequency signal class. The algorithm is applicable to quantum-enhanced signal processing tasks such as zero-crossing analysis, band-limited noise estimation, and feature extraction in the Walsh basis.
In this work, we propose a novel quantum algorithm for edge detection in digital grayscale images, based on the sequency-ordered Walsh-Hadamard transform. The proposed method significantly improves upon existing quantum techniques for edge detection by using a quantum algorithm for the sequency-ordered Walsh-Hadamard transform, achieving a circuit depth of O(n)\mathcal{O}(n)O(n) (where nnn is the number of qubits). This represents a notable enhancement over the Quantum Fourier Transform (QFT), which has a circuit depth of O(n2)\mathcal{O}(n^{2})O(n2). Furthermore, our approach for edge detection has a computational cost (both gate complexity and quantum circuit depth) of O(log⁡2(N1N2))\mathcal{O}(\log_{2}(N_{1}N_{2}))O(log2​(N1​N2​)) for an image of size N1×N2N_{1}\times N_{2}N1​×N2​, offering a considerable improvement over the Quantum Hadamard Edge Detection (QHED) algorithm, which incurs a cost of O(poly(log⁡2(N1N2)))\mathcal{O}(\text{poly}(\log_{2}(N_{1}N_{2})))O(poly(log2​(N1​N2​))). By integrating a quantum high-pass filter with the sequency-ordered Walsh-Hadamard transform, the algorithm effectively extracts edge information from images. Computational examples are provided to demonstrate the efficacy of the proposed algorithm which provides a better performance in comparison to QHED.
We introduce Quantum Index Algebra (QIA) as a finite, index-based algebraic framework for representing and manipulating quantum operators on Hilbert spaces of dimension 2m2^m2m. In QIA, operators are expressed as structured combinations of basis elements indexed by Boolean codes, allowing products, commutators, and conjugations to be computed through finite rules on discrete indices rather than through dense matrix arithmetic. This representation unifies combinatorial index structure, explicit matrix realization, and transformation properties under Walsh-Hadamard-type transforms within a single formalism. Using QIA and its associated block-matrix realization, we reformulate the Bernstein-Vazirani hidden-string problem in its phase-oracle form entirely within a real, finite-dimensional algebraic setting. We show that, under structured oracle access, the QIA procedure reproduces the Bernstein-Vazirani algorithm exactly and achieves the same asymptotic query complexity and circuit depth as the standard quantum algorithm. In particular, the hidden string is recovered by symbolic manipulation of a sparse algebraic representation of the oracle rather than by numerical simulation of quantum amplitudes. Our results demonstrate that the apparent quantum speed-up in this setting is a consequence of operator structure rather than Hilbert-space dimensionality alone. QIA thus provides a precise language for separating genuinely quantum resources from those arising from algebraic and combinatorial structures and offers a new perspective on the classical simulability of structured quantum circuits.
Quantum Amplitude Estimation (QAE) is a key primitive in quantum computing, but its standard implementation using Quantum Phase Estimation is resource-intensive, requiring a large number of coherent qubits in a single circuit block to achieve high precision. This presents a significant challenge for near-term Noisy Intermediate-Scale Quantum (NISQ) devices. To address this, we introduce the Adaptive Windowed Quantum Amplitude Estimation (AWQAE) framework, a modular, scalable and adaptive approach that decouples estimation precision from the number of physical qubits required in a single circuit. AWQAE operates by iteratively estimating the phase bits in small, fixed-size chunks, using a number of smaller, independent quantum circuits, which are amenable to parallel processing. A key technical contribution of this work is introduction of a phase resolution circuit and an ancilla-guided mechanism that enables accurate chunk assignment and eigenphase reconstruction in the presence of multiple eigenstates. This design is inherently NISQ-friendly, by lowering circuit depth and qubit count per block to reduce decoherence and noise effects. A key component of our approach is a robust classical post-processing algorithm that resolves measurement ambiguities that arise during the iterative process. This post-processing routine uses a least-significant-bit (LSB)-to-most-significant-bit (MSB) correction to reconstruct the full, high-precision phase estimate, ensuring accuracy. By combining a modular quantum-classical loop with an ambiguity-aware reconstruction method, AWQAE offers a powerful and flexible solution for performing high-precision QAE on resource-constrained quantum hardware. Our approach demonstrates enhanced scalability, and adaptability, making it a promising candidate for practical applications of QAE in the NISQ era.
We propose a hybrid quantum state preparation method based on the Walsh--Hadamard transform within the dense-to-sparse quantum state preparation framework. The method approximately prepares structured classical data in a quantum circuit through an indirect approach. Instead of directly preparing the dense amplitude-encoded state, the method first transforms the classical data into the Walsh domain and prepares only the largest-magnitude coefficients using a sparse state-preparation algorithm. The original state can then be approximately recovered through a parallel layer of Hadamard gates. Since this reconstruction requires no CNOT gates and has circuit depth 1, the proposed method introduces no additional CNOT or circuit-depth overhead, and its quantum preparation cost is determined by the underlying sparse state-preparation algorithm. Numerical results on representative benchmark signals demonstrate that the proposed method enables accurate state preparation for signals admitting sparse or approximately sparse representations in the Walsh domain.
We propose an approach for quantum amplitude estimation (QAE) designed to enhance computational efficiency while minimizing the reliance on quantum resources. Our method leverages quantum computers to generate a sequence of signals, from which the quantum amplitude is inferred through classical post-processing techniques. Unlike traditional methods that use quantum phase estimation (QPE), which requires numerous controlled unitary operations and the quantum Fourier transform, our method avoids these complex and resource-demanding steps. By integrating quantum computing with classical post-processing techniques, our method significantly reduces the need for quantum gates and qubits, thus optimizing the utilization of quantum hardware. We present numerical simulations to validate the effectiveness of our method and provide a comprehensive analysis of its computational complexity and error. This hybrid strategy not only improves the practicality of QAE but also broadens its applicability in quantum computing.
A core task in quantum anomaly detection is to compute an anomaly score that quantifies how strongly a test quantum state deviates from a given quantum dataset assumed to be normal. Classically, principal component analysis (PCA) for centered data computes the anomaly score by evaluating the test sample relative to the subspace spanned by the selected leading eigenvectors. However, for quantum data that lack a standard centering, explicitly recovering principal eigenvectors, constructing full Gram matrices, or loading quantum-random-access-memory-style data can be more costly than estimating the anomaly score itself. To avoid these costs, we propose Quantum Spectral Anomaly Detection (QSPADE), which computes PCA-like anomaly scores directly from the spectrum of the average state of the normal dataset. By replacing hard PCA rank selection with a smooth, temperature-controlled spectral threshold, QSPADE makes near-threshold spectral components contribute partially to the anomaly score. This makes the score vary continuously rather than jump when a borderline component is included or excluded, and makes it less sensitive to noise or arbitrary hard cutoffs near the threshold. In the zero-temperature limit, QSPADE recovers the hard-projector PCA score. The proposed measurement-based quantum detector can be calibrated with a sample complexity independent of the data dimension. Numerical simulations show that QSPADE behaves like kernel-PCA on encoded classical data and detects changes across a transverse-field Ising transition without predefined order parameters. Consequently, QSPADE gives an efficient framework for both quantum-kernel anomaly detection on encoded classical data and the monitoring of quantum-native systems where diagnostic observables are unknown.