Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without \textit{A Priori} Knowledge

• URL: http://arxiv.org/abs/2604.11857v1
• Date: Mon, 13 Apr 2026 08:27:08 GMT
• Title: Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without \textit{A Priori} Knowledge
• Abstract summary: We introduce emphblind CQEC, which estimates the target from the noisy output alone before catalytic recovery.<n>Five estimation strategies are benchmarked across three noise models.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Catalytic quantum error correction (CQEC) recovers quantum states via catalytic covariant transformations but requires full knowledge of the target state. We introduce \emph{blind CQEC}, which estimates the target from the noisy output alone before catalytic recovery. Five estimation strategies are benchmarked across three noise models (dephasing, depolarizing, amplitude damping), four quantum algorithms ($d = 4$--$64$), Haar-random states up to $d = 256$, and mixed-state targets with variable purity. Key results: (i)~coherence maximization achieves $ F_{ rec } > 0.95$ for $d \leq 16$ without noise-model knowledge, matching the oracle to within $4\%$; (ii)~channel inversion is required at $d = 64$ ($ F_{ rec } = 0.905$); (iii)~estimation and recovery fidelities are linearly correlated ($r > 0.99$), identifying target estimation as the sole bottleneck; (iv)~an analytical crossover dimension $d^* \approx 25$--$40$ separates noise-model-free and noise-informed regimes, bridged by a hybrid interpolation strategy; (v)~copy scaling follows $1 - F(n) \sim n^{-α}$ with $α\in [0.4, 2.2]$, spanning the statistical averaging and denoising synergy limits. Standard linear inversion tomography fails as a CQEC target estimator, validating the need for decoherence-aware strategies. An end-to-end VQE demonstration for H$_2$ shows $3.4\times$ energy-error reduction with channel-inversion blind CQEC.

Related papers

• Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise [49.730496294398726]
  We develop a novel quantum mean estimator for heavy-tailed random variables.<n>We derive stronger lower bounds for tail index>4/3$, showing that a nontrivial dependence on a dimension is unavoidable.<n>For a convex objective function, we propose a quantum projected gradient descent method.
  arXiv  Detail & Related papers  (2026-07-28T09:29:37Z)
• Decoherence as Defence and the Magnitude of Noise Regularisation: A Rigorous N -Qubit Theory of Stochastic Quantum Neural Networks for Adversarially Robust Network Intrusion Detection [0.0]
  We give an $N$-qubit formulation through the master equation and its vectorised Liouvillian.<n>We prove a emphdecoherence-contraction theorem: a depolarising channel of strength.<n>We show this robustness arises from a noise-reshaped training boundary rather than from attack-time contraction.
  arXiv  Detail & Related papers  (2026-06-23T07:06:56Z)
• Spectral Anatomy of Quantum Gaussian Process Kernels [38.264196157340216]
  We prove a Cauchy-Schwarz tail bound on Nystrm approximation error, a finite-sample variance-contraction identity, and a characterization of the emphtarget-dependent optimal entropy.<n>The diagnostic is kernel-agnostic: hardware-efficient, matchgate, IQP emphand RBF/Matérn/RFF/deep- kernel families all collapse onto identical $S/log n$ curves.
  arXiv  Detail & Related papers  (2026-05-29T07:41:14Z)
• Wavelet Variance Equipartition as a Threshold for World-Model Quality and Quantum Kernel TN-Simulability [0.0]
  We identify the wavelet scaling exponent $$ as a critical diagnostic.<n>We establish $= 1/2$ as a sharp transition boundary for the classical simulability of amplitude-encoded quantum kernels.<n>We prove this variance scales strictly as $Var[X] = (d-2)$.
  arXiv  Detail & Related papers  (2026-05-12T05:41:12Z)
• Catalytic Quantum Error Correction: Theory, Efficient Catalyst Preparation, and Numerical Benchmarks [0.0]
  CQEC recovers a known target state from noisy copies without an error emphmagnitude threshold.<n>CQEC succeeds whenever the coherent modes satisfy $mathcalC(_0) subseteq mathcalC(_mathrmnoisy)$, regardless of noise strength.
  arXiv  Detail & Related papers  (2026-03-26T12:03:20Z)
• Universal Quantum Suppression in Frustrated Ising Magnets across the Quasi-1D to 2D Crossover via Quantum Annealing [0.0]
  competing ferromagnetic and antiferromagnetic couplings generate a sign problem provably intractable for quantum Monte Carlo at any system size.<n>We measure quantum-driven transitions at $g_cmathrmQPUin0.286,,0.210,,0.156,,0.093$ for $in1.0,,0.7,,0.5,,0.3$.
  arXiv  Detail & Related papers  (2026-03-25T13:50:52Z)
• Sublinear Time Quantum Sensitivity Sampling [57.356528942341534]
  We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems.<n>Our framework provides a streamlined approach for constructing coresets and offers significant runtime improvements in applications such as clustering, regression, and low-rank approximation.
  arXiv  Detail & Related papers  (2025-09-20T20:18:49Z)
• 1D Cluster State Generation On Superconducting Hardware [0.0]
  Measurement-based Quantum Computation utilize entanglement as resource for performing quantum computation.<n> generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC.<n>We provide analytical derivations and numerical validations for 4-qubit cluster state.
  arXiv  Detail & Related papers  (2025-08-29T17:24:35Z)
• 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)
• 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)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Differentially Quantized Gradient Methods [53.3186247068836]
  We show that Differentially Quantized Gradient Descent (DQ-GD) attains a linear contraction factor of $maxsigma_mathrmGD, rhon 2-R$. No algorithm within a certain class can converge faster than $maxsigma_mathrmGD, 2-R$.
  arXiv  Detail & Related papers  (2020-02-06T20:40:53Z)

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.