QANTIS: A Hardware-Validated Quantum Platform for POMDP Planning and Multi-Target Data Association

• URL: http://arxiv.org/abs/2603.00785v1
• Date: Sat, 28 Feb 2026 19:13:44 GMT
• Title: QANTIS: A Hardware-Validated Quantum Platform for POMDP Planning and Multi-Target Data Association
• Abstract summary: We present QS, a modular platform that integrates quantum belief update (Grover amplitude amplification and BIQAE), QUBO-based data association via FPC-QAOA, and composable error mitigation.<n>On hardware, a single Grover iterate applied to a Tiger belief oracle amplifies a rare observation probability from $0.179$ to $9.07$ ($5.1times$; ISA 18) while preserving the Bayesian posterior.<n>We further demonstrate, to our knowledge, the first closed-loop hybrid quantum-classical Tiger POMDP on superconducting hardware.
• Score: 4.11040996037715
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Autonomous navigation under uncertainty requires solving partially observable Markov decision processes (POMDPs) for planning and assigning sensor measurements to tracked targets--a task known as multi-target data association (MTDA). Both problems become computationally demanding at scale: belief conditioning costs $\mathcal{O}(P(e)^{-1})$ per node under rare evidence, while MTDA is NP-hard. Quantum amplitude amplification can quadratically reduce the belief-update query cost to $\mathcal{O}(P(e)^{-1/2})$, while QUBO reformulations expose MTDA to quantum and quantum-inspired optimisation heuristics. We present QANTIS, a modular platform that integrates quantum belief update (Grover amplitude amplification and BIQAE), QUBO-based data association via FPC-QAOA, and composable error mitigation, and we report a 45-experiment hardware study on three IBM Heron backends. On hardware, a single Grover iterate applied to a Tiger belief oracle amplifies a rare observation probability from $0.179$ to $0.907$ ($5.1\times$; ISA 18) while preserving the Bayesian posterior (Hellinger $0.0015$), increasing usable-shot yield from 1,463 to 7,429. We interpret this as a hardware validation of the quadratic query-complexity mechanism at $k=1$ with posterior preservation, rather than a wall-clock advantage claim. We further demonstrate, to our knowledge, the first closed-loop hybrid quantum-classical Tiger POMDP on superconducting hardware ($T=8$, max Hellinger below $0.015$), and empirically characterise NISQ feasibility boundaries: ZNE-based error mitigation is beneficial below ISA $\approx 100$ and harmful above ISA $\gtrsim 1{,}000$; FPC-QAOA is meaningful at $\leq 15$ QUBO variables (ISA $\lesssim 450$). These results characterise practical operating regimes on current superconducting hardware rather than wall-clock quantum advantage at today's problem scales.

Related papers

• M-QAM MIMO Maximum-Likelihood Detection with QAOA: ML-Rate Offline Angle Design and Correlated Infinite-Size Spin-Glass Models [9.13755431537592]
  The quantum approximate optimization algorithm (QAOA) targets NP-hard maximum-likelihood (ML) detection in multiple-input multiple-output (MIMO) systems.<n>Tests reach 4096-QAM, 128 antennas, $p=30$ and per-symbol SNR 0-45 dB.<n>The approach points toward near-optimum decoding on deeper noiseless fault-tolerant quantum (FTQ) circuits.
  arXiv  Detail & Related papers  (2026-08-18T12:45:47Z)
• From Circuits to Hardware: Benchmarking Standard and Qubit-Efficient Quantum Optimization on Real Hardware [3.652509571098291]
  We benchmark gate-based quantum optimization on four NP-hard problems.<n>We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO.<n>Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy.
  arXiv  Detail & Related papers  (2026-07-13T14:53:50Z)
• Quantum non-demolition measurements as a practical primitive for fault-tolerant computation against biased noise [1.0499611180329804]
  We show that high-fidelity quantum non-demolition (QND) multi-qubit Pauli $Z$ measurements provide an equally powerful yet more accessible primitive.<n>We propose concrete physical implementations of this primitive for two platforms: solid-state nuclear spins coupled to electron spin ancillas, and superconducting cat qubits.
  arXiv  Detail & Related papers  (2026-05-22T22:27:52Z)
• Error-structure-tailored early fault-tolerant quantum computing [2.824800547988445]
  In quantum algorithms, logical rotation gates $R_Z_L(varphi)$ serve as essential components.<n>In this work, we consider error-structure-tailored fault tolerance, where fault-tolerance conditions are analyzed.<n>We design 1-fault-tolerant continuous-angle rotation gates in stabilizer codes, implemented via dispersive-coupling Hamiltonians.
  arXiv  Detail & Related papers  (2025-11-25T06:51:46Z)
• How "Quantum" is your Quantum Computer? Macrorealism-based Benchmarking via Mid-Circuit Parity Measurements [0.0]
  Violation of Macrorealism (MR) is detected on a IBM QC up to $N = 38$ qubits, increasing $N$ by one order of magnitude over best known results of MR.<n>Two QCs are benchmarked using the proposed NDC metric, showing a three-fold improvement in their quantumness from one generation to the next.
  arXiv  Detail & Related papers  (2025-11-19T21:15:54Z)
• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• Quantum Error-Corrected Computation of Molecular Energies [0.7018475907464546]
  We present the first demonstration of an end-to-end pipeline with quantum error correction (QEC) for a quantum computation.<n>We calculate the ground-state energy of molecular hydrogen, using quantum phase estimation (QPE) on qubits encoded with the $[7,3]]$ color code on Quantinuum H2-2.<n>We find that orienting the QEC protocols towards higher memory noise protection is the most promising avenue to improve our experimental results.
  arXiv  Detail & Related papers  (2025-05-14T04:34:48Z)
• Quantum Error Suppression with Subgroup Stabilisation [3.4719087457636792]
  Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. We propose an effective state purification gadget with a moderate quantum overhead by projecting $M$ noisy quantum inputs to their subspace. Our method, applied in every short evolution over $M$ redundant copies of noisy states, can suppress both coherent and errors by a factor of $1/M$, respectively.
  arXiv  Detail & Related papers  (2024-04-15T17:51:47Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• 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)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Exponential Error Suppression for Near-Term Quantum Devices [0.0]
  In NISQ era, complexity and scale required to adopt even the smallest QEC is prohibitive. We show that for the crucial case of estimating expectation values of observables one can indeed achieve an effective exponential suppression.
  arXiv  Detail & Related papers  (2020-11-11T18:00:38Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Quantum Differentially Private Sparse Regression Learning [132.1981461292324]
  We devise an efficient quantum differentially private (QDP) Lasso estimator to solve sparse regression tasks. Last, we exhibit that the QDP Lasso attains a near-optimal utility bound $tildeO(N-2/3)$ with privacy guarantees.
  arXiv  Detail & Related papers  (2020-07-23T10:50:42Z)

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.