Robust Quantum Algorithmic Binary Decision-Making on Displacement Signals

• URL: http://arxiv.org/abs/2601.16081v1
• Date: Thu, 22 Jan 2026 16:22:32 GMT
• Title: Robust Quantum Algorithmic Binary Decision-Making on Displacement Signals
• Authors: Aishwarya Majumdar, Yuan Liu,
• Abstract summary: A relevant signal in the quantum domain may manifest as a displacement or a phase shift operator in the bosonic phase space.<n>We propose a framework based on generalized quantum signal processing interferometryGQSPI.<n>The proposed framework enables decision-making over arbitrary thresholds for any general displacement signal in a single or a few shots.
• Score: 5.042709905708249
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A relevant signal in the quantum domain may manifest as a displacement or a phase shift operator in the bosonic phase space. For a real parameter $β$ embedded in such a displacement 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 based on generalized quantum signal processing interferometry (GQSPI) on hybrid qubit-bosonic oscillator systems that addresses this parameter detection problem by recasting the practical task of active binary hypothesis testing on quantum systems to that of a polynomial approximation. We achieve a small decision error probability $p_{err}$ on the order of $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 performance of the sensing protocol under dephasing noise is also shown to be robust. We further extend our protocol from two thresholds to more general multi-threshold cases as well. Overall, the proposed framework enables decision-making over arbitrary thresholds for any general displacement signal in a single or a few shots.

Related papers

• Quantum Detection of Sequency-Band Structure [0.5729426778193398]
  We present a quantum algorithm for estimating the amplitude content of user-specified sequency bands in quantum-encoded signals.<n>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.<n>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.
  arXiv  Detail & Related papers  (2026-02-09T08:47:51Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs [60.40452803295326]
  We propose a new reward-free algorithm for learning linear Markov decision processes (MDPs) At the core of our algorithm is uncertainty-weighted value-targeted regression with exploration-driven pseudo-reward. We show that our algorithm only needs to explore $tilde O( d2varepsilon-2)$ episodes to find an $varepsilon$-optimal policy.
  arXiv  Detail & Related papers  (2023-03-17T17:53:28Z)
• Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly [0.9208007322096532]
  We consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model. In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation. We show a method to reduce the large search space representing all possible protocols.
  arXiv  Detail & Related papers  (2022-09-07T03:33:09Z)
• Simulating excited states of the Lipkin model on a quantum computer [0.0]
  We show that the accuracy strongly depends on the fermion to qubit encoding. We use IBM quantum machines to compute the energy spectrum for a system of $N=2, 3$ and $4$ particles.
  arXiv  Detail & Related papers  (2022-03-03T01:43:12Z)
• Multiparameter simultaneous optimal estimation with an SU(2) coding unitary evolution [5.789743084845758]
  In a ubiquitous $SU(2)$ dynamics, achieving the simultaneous optimal estimation of multiple parameters is difficult. We propose a method, characterized by the nested cross-products of the coefficient vector $mathbfX$ of $SU(2)$ generators. Our work reveals that quantum control is not always functional in improving the estimation precision.
  arXiv  Detail & Related papers  (2022-02-08T06:05:20Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Multiparameter estimation for qubit states with collective measurements: a case study [0.0]
  We show that simultaneous optimal estimation for both parameters can be attained with a simple collective measurement strategy. We show that when the state is nearly pure, for sufficiently but not arbitrarily large $N$, most information will be captured in the largest three $j$-subspaces. We also obtain numerical results that suggest that using a Bell multiport setup, one can distinguish between projection onto the $j=N/2$ and $j=N/2-1 subspaces.
  arXiv  Detail & Related papers  (2021-09-15T17:02:33Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Navigating to the Best Policy in Markov Decision Processes [68.8204255655161]
  We investigate the active pure exploration problem in Markov Decision Processes. Agent sequentially selects actions and, from the resulting system trajectory, aims at the best as fast as possible.
  arXiv  Detail & Related papers  (2021-06-05T09:16:28Z)
• Heisenberg-limited estimation robust to detector inefficiency in a multi-parameter Mach-Zehnder network with squeezed light [0.0]
  A simple and intuitive geometrical picture of the state evolution is provided by the Wigner functions of the state at each interferometer output channel. The protocol allows to detect the value of the sum $beta=frac12(varphi_2)+theta_mathrmin-theta_mathrmout$.
  arXiv  Detail & Related papers  (2021-04-06T10:46:29Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.