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:2601.16081

Robust Quantum Algorithmic Binary Decision-Making on Gaussian Signals

Aishwarya Majumdar, Yuan Liu

quant-phSubmitted Jan 22, 2026• Announced Jan 23, 2026• 1 citation• Revised May 15, 2026 (v2)
v1 · Jan 22, 2026v2 · May 15, 2026
arXivHTMLPDF

Abstract

A relevant signal in the quantum domain may manifest as a displacement or a squeezing operator in the bosonic phase space. For a real parameter $β$ embedded in such a Gaussian operator, the task of determining if $β\in [β_{-th}, β_{+th}]$ for real asymmetric thresholds $(β_{-th} \ne -β_{+th})$ is a binary decision problem. We propose a framework, the \emph{generalized quantum signal processing interferometry} (GQSPI), to solve this parameter detection problem by recasting the practical task of active binary hypothesis testing on quantum systems to a polynomial approximation problem. We achieve a small decision error probability $p_{\text{err}}$ on the order of $\mathcal{O}(\frac{1}{d}\log{(d)})$, with $d$ as the circuit depth. We analyze the protocol when (i) $β$ is a deterministic parameter, and (ii) when $β$ is drawn randomly from a known prior distribution. The GQSPI protocol is also shown to be robust under oscillator dephasing noise. We further extend our protocol from two thresholds to more general multi-threshold cases. Overall, the proposed framework enables decision-making over arbitrary thresholds for any general Gaussian signal in a single or a few shots.

Related papers

Single-shot Quantum Signal Processing Interferometry

Jasmine Sinanan-Singh, Gabriel Mintzer, Isaac L. Chuang +1 more

Quantum systems of infinite dimension, such as bosonic oscillators, provide vast resources for quantum sensing. Yet, a general theory on how to manipulate such bosonic modes for sensing beyond parameter estimation is unknown. We present a general algorithmic framework, quantum signal processing interferometry (QSPI), for quantum sensing at the fundamental limits of quantum mechanics by generalizing Ramsey-type interferometry. Our QSPI sensing protocol relies on performing nonlinear polynomial transformations on the oscillator's quadrature operators by generalizing quantum signal processing (QSP) from qubits to hybrid qubit-oscillator systems. We use our QSPI sensing framework to make efficient binary decisions on a displacement channel in the single-shot limit. Theoretical analysis suggests the sensing accuracy, given a single-shot qubit measurement, scales inversely with the sensing time or circuit depth of the algorithm. We further concatenate a series of such binary decisions to perform parameter estimation in a bit-by-bit fashion. Numerical simulations are performed to support these statements. Our QSPI protocol offers a unified framework for quantum sensing using continuous-variable bosonic systems beyond parameter estimation and establishes a promising avenue toward efficient and scalable quantum control and quantum sensing schemes beyond the NISQ era.

arXiv:2311.13703•Quantum•Jul 30, 2024•19 citations

Generalized Quantum Signal Processing

Danial Motlagh, Nathan Wiebe

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that |P|≤1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 107 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O((1/δ)+log(1/ϵ)) queries to perform where O(1/δ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O(dlogN+log2N) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

arXiv:2308.01501•PRX Quantum•Jun 28, 2024•149 citations

A squeezing invariant measurement to test displacement of quantum Gaussian states

Yoshiyuki Tsuda

We consider a hypothesis testing problem for displacement parameters of n independent copies of an m-mode squeezed quantum Gaussian state whose mixture parameter is known. Given n>1, we construct a quantum measurement as a test using an observable which is invariant by n-fold tensor product of any m-mode squeezing operator. For a pure state case, we calculate the type II error probability of this test. We compare this test with a Hotelling's T-squared test which is based on heterodyne measurements.

arXiv:1901.01345•Jan 5, 2019•0 citations

Optimized GKP State for Bosonic Channel Sensing

Thinh M. Le, Jianqing Liu, Jiapeng Zhao +1 more

Bosonic quantum computation harnesses the infinite-dimensional Hilbert space of harmonic oscillators, offering scalable architectures with inherent error correction advantages over qubit-based systems. Despite their potential, bosonic modes encounter significant challenges from prevalent noise sources, particularly photon loss and dephasing, which degrade quantum coherence. Among bosonic error-correcting codes, the Gottesman-Kitaev-Preskill (GKP) code stands out for its ability to correct small phase-space displacements, enabling applications in quantum communication, sensing, and computation. While ideal GKP states require infinite squeezing and are unphysical, the finite squeezing approximate GKP states have been experimentally realized, though their performance depend critically on the squeezing level and measurement strategies. This work addresses a central challenge: how to optimize the squeezing parameter of approximate GKP states and the local oscillator (LO) phase in homodyne detection to maximize precision in estimating bosonic loss-dephasing channel parameters. To address this question, we introduce an adaptive optimization framework guided by classical Fisher information (CFI) and quantum Fisher information (QFI). Numerical simulations demonstrate that this adaptive protocol consistently converges to optimal parameter configurations, determining optimized squeezing levels and LO phases. By offering a practical approach to highprecision quantum channel parameter estimation, this framework has broad implications, from quantum metrology to enabling robust quantum communication systems.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Ensemble-Based Quantum Signal Processing for Error Mitigation

Suying Liu, Yulong Dong, Dong An +1 more

Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.

quant-pharXiv:2601.20073•Jan 29, 2026•0 citations

Robust Angle Finding for Generalized Quantum Signal Processing

Shuntaro Yamamoto, Nobuyuki Yoshioka

Quantum Signal Processing (QSP), together with the quantum singular value transformation, is one of the central quantum algorithms due to its efficiency and generality in many fields including quantum simulation, quantum machine learning, and quantum cryptography. The largest bottleneck of QSP and its family is its difficulty in finding the phase angle sequence for signal processing. We find that this is in particular prominent when one employs the generalized formalism of the QSP, or the GQSP, to employ arbitrary single-qubit unitaries for signal processing operator. In this work, we extend the framework of GQSP and propose a robust angle finding algorithm. The proposed angle finding algorithm, based on Prony's method, successfully generates angle sequence of precision $10^{-13}$ up to polynomial degrees of hundreds within a second. By applying our method to Hamiltonian simulation, we find that the number of calls, or queries, to signal operators are essentially halved compared to the ordinary framework of QSP.

arXiv:2402.03016•Feb 5, 2024•25 citations
A relevant signal in the quantum domain may manifest as a displacement or a squeezing operator in the bosonic phase space. For a real parameter βββ embedded in such a Gaussian operator, the task of determining if β∈[β−th,β+th]β\in [β_{-th}, β_{+th}]β∈[β−th​,β+th​] for real asymmetric thresholds (β−th≠−β+th)(β_{-th} \ne -β_{+th})(β−th​=−β+th​) is a binary decision problem. We propose a framework, the \emph{generalized quantum signal processing interferometry} (GQSPI), to solve this parameter detection problem by recasting the practical task of active binary hypothesis testing on quantum systems to a polynomial approximation problem. We achieve a small decision error probability perrp_{\text{err}}perr​ on the order of O(1dlog⁡(d))\mathcal{O}(\frac{1}{d}\log{(d)})O(d1​log(d)), with ddd as the circuit depth. We analyze the protocol when (i) βββ is a deterministic parameter, and (ii) when βββ is drawn randomly from a known prior distribution. The GQSPI protocol is also shown to be robust under oscillator dephasing noise. We further extend our protocol from two thresholds to more general multi-threshold cases. Overall, the proposed framework enables decision-making over arbitrary thresholds for any general Gaussian signal in a single or a few shots.
Quantum systems of infinite dimension, such as bosonic oscillators, provide vast resources for quantum sensing. Yet, a general theory on how to manipulate such bosonic modes for sensing beyond parameter estimation is unknown. We present a general algorithmic framework, quantum signal processing interferometry (QSPI), for quantum sensing at the fundamental limits of quantum mechanics by generalizing Ramsey-type interferometry. Our QSPI sensing protocol relies on performing nonlinear polynomial transformations on the oscillator's quadrature operators by generalizing quantum signal processing (QSP) from qubits to hybrid qubit-oscillator systems. We use our QSPI sensing framework to make efficient binary decisions on a displacement channel in the single-shot limit. Theoretical analysis suggests the sensing accuracy, given a single-shot qubit measurement, scales inversely with the sensing time or circuit depth of the algorithm. We further concatenate a series of such binary decisions to perform parameter estimation in a bit-by-bit fashion. Numerical simulations are performed to support these statements. Our QSPI protocol offers a unified framework for quantum sensing using continuous-variable bosonic systems beyond parameter estimation and establishes a promising avenue toward efficient and scalable quantum control and quantum sensing schemes beyond the NISQ era.
Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that |P|≤1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 107 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O((1/δ)+log(1/ϵ)) queries to perform where O(1/δ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O(dlogN+log2N) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024
We consider a hypothesis testing problem for displacement parameters of n independent copies of an m-mode squeezed quantum Gaussian state whose mixture parameter is known. Given n>1, we construct a quantum measurement as a test using an observable which is invariant by n-fold tensor product of any m-mode squeezing operator. For a pure state case, we calculate the type II error probability of this test. We compare this test with a Hotelling's T-squared test which is based on heterodyne measurements.
Bosonic quantum computation harnesses the infinite-dimensional Hilbert space of harmonic oscillators, offering scalable architectures with inherent error correction advantages over qubit-based systems. Despite their potential, bosonic modes encounter significant challenges from prevalent noise sources, particularly photon loss and dephasing, which degrade quantum coherence. Among bosonic error-correcting codes, the Gottesman-Kitaev-Preskill (GKP) code stands out for its ability to correct small phase-space displacements, enabling applications in quantum communication, sensing, and computation. While ideal GKP states require infinite squeezing and are unphysical, the finite squeezing approximate GKP states have been experimentally realized, though their performance depend critically on the squeezing level and measurement strategies. This work addresses a central challenge: how to optimize the squeezing parameter of approximate GKP states and the local oscillator (LO) phase in homodyne detection to maximize precision in estimating bosonic loss-dephasing channel parameters. To address this question, we introduce an adaptive optimization framework guided by classical Fisher information (CFI) and quantum Fisher information (QFI). Numerical simulations demonstrate that this adaptive protocol consistently converges to optimal parameter configurations, determining optimized squeezing levels and LO phases. By offering a practical approach to highprecision quantum channel parameter estimation, this framework has broad implications, from quantum metrology to enabling robust quantum communication systems.
Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.
Quantum Signal Processing (QSP), together with the quantum singular value transformation, is one of the central quantum algorithms due to its efficiency and generality in many fields including quantum simulation, quantum machine learning, and quantum cryptography. The largest bottleneck of QSP and its family is its difficulty in finding the phase angle sequence for signal processing. We find that this is in particular prominent when one employs the generalized formalism of the QSP, or the GQSP, to employ arbitrary single-qubit unitaries for signal processing operator. In this work, we extend the framework of GQSP and propose a robust angle finding algorithm. The proposed angle finding algorithm, based on Prony's method, successfully generates angle sequence of precision 10−1310^{-13}10−13 up to polynomial degrees of hundreds within a second. By applying our method to Hamiltonian simulation, we find that the number of calls, or queries, to signal operators are essentially halved compared to the ordinary framework of QSP.