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:2506.01851 · Quantum Information Processing

Bayesian and Markovian classical feedforward for discriminating qubit channels

Milajiguli Rexiti, Stefano Mancini

Published Jan 20, 2026• 0 citations
arXivHTMLPDF
DOI
10.1007/s11128-025-05042-8

Related papers

Falsifiable Predictions, 3-Qubit Discriminator, and Worked Case Reanalysis under P1+P2

Roberto Valtancoli

The author develops the experimental layer of the framework introduced in the foundational Preprint I. Seven families of falsifiable predictions (F1–F7) are stated and matched to ten falsification criteria (F-T1–F-T10). The predictions cover: τ-window scaling laws under monitored feedback and non-Markovian memory; a 3-qubit ontological feedforward discriminator constructed to separate synchronisation-based from entanglement-based metric emergence; a directional-asymmetry test Δ(τ) with null control; a 4-qubit triangle-inequality test on the metric-compatibility regime; an asymptotic large-deviation consistency channel as cross-cutting envelope; a coherence-affected entropy-production consistency target; and a sync-rate scaling under Dicke collective dissipation. A worked-case reanalysis of Micadei et al. (2019) under the non-Markovian channel of P1 demonstrates non-vacuity of the framework on existing experimental data within a factor ≈ 2.5 on a nine-decade timescale range. The operational definition of the memory timescale τₘₑₘ was fixed prior to numerical evaluation as a matter of pre-registration discipline, with an analytic zero-crossing alternative computed for transparency and explicitly rejected under the conservative bound. A structured Nakajima–Zwanzig–TCL2 sketch indicating the sign and structure of the next-to-leading-order correction for the Micadei interaction Hamiltonian is provided in Appendix E-II, identifying this residual as a target for next-to-leading-order refinement in the smallness parameter (Φ_NM − 1).

•May 1, 2026•0 citations

On the discrimination of qubit channels

Meisheng Zhao, Tao Qin, Yongde Zhang

Physics Letters A•Oct 26, 2007•1 citation

On the effectiveness of Bayesian discrete feedback for quantum information reclaiming

Milajiguli Rexiti, Samad Khabbazi Oskouei, Stefano Mancini

Abstract We consider discrete time feedback aimed at reclaiming quantum information after a channel action. We compare Bayesian and Markovian strategies. We show that the former does not offer any advantage for qubit channels, while its superior performance can appear in higher dimensional channels. This is witnessed by cases study for qutrit channels.

arXiv:2402.18941•Quantum Information Processing•Jun 28, 2024•0 citations

Information Theoretic Representations of Qubit Channels

Tanner Crowder, Keye Martin

Foundations of Physics•May 9, 2012•5 citations

BAYESIAN QUBIT STATE ESTIMATION

Attila Magyar, Dėnes Petz, Katalin Mária Hangos

IFAC Proceedings Volumes•Jan 1, 2006•0 citations

Explicit channels with unbounded gains in classical communication using entangled inputs

Hao-Chung Cheng, Benjamin Lovitz, Peixue Wu

A seminal result of Hastings showed that entangled inputs can increase the rate of classical communication through independent uses of a quantum channel. While Hastings' result proved the existence of this phenomenon, it has remained a major open problem to find an explicit channel with this property. In this work, we resolve this question by constructing an explicit family of finite-dimensional quantum channels for which entangling inputs between pairs of channel uses yields an unbounded separation from the achievable communication rate using unentangled inputs. We describe a circuit implementation of our channel that uses only deterministic qudit Clifford unitaries and a single binary measurement with classical feedforward. The key ingredient is a careful design of the measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family.

quant-pharXiv:2609.26743•Sep 23, 2026•3 citations
The author develops the experimental layer of the framework introduced in the foundational Preprint I. Seven families of falsifiable predictions (F1–F7) are stated and matched to ten falsification criteria (F-T1–F-T10). The predictions cover: τ-window scaling laws under monitored feedback and non-Markovian memory; a 3-qubit ontological feedforward discriminator constructed to separate synchronisation-based from entanglement-based metric emergence; a directional-asymmetry test Δ(τ) with null control; a 4-qubit triangle-inequality test on the metric-compatibility regime; an asymptotic large-deviation consistency channel as cross-cutting envelope; a coherence-affected entropy-production consistency target; and a sync-rate scaling under Dicke collective dissipation. A worked-case reanalysis of Micadei et al. (2019) under the non-Markovian channel of P1 demonstrates non-vacuity of the framework on existing experimental data within a factor ≈ 2.5 on a nine-decade timescale range. The operational definition of the memory timescale τₘₑₘ was fixed prior to numerical evaluation as a matter of pre-registration discipline, with an analytic zero-crossing alternative computed for transparency and explicitly rejected under the conservative bound. A structured Nakajima–Zwanzig–TCL2 sketch indicating the sign and structure of the next-to-leading-order correction for the Micadei interaction Hamiltonian is provided in Appendix E-II, identifying this residual as a target for next-to-leading-order refinement in the smallness parameter (Φ_NM − 1).
A seminal result of Hastings showed that entangled inputs can increase the rate of classical communication through independent uses of a quantum channel. While Hastings' result proved the existence of this phenomenon, it has remained a major open problem to find an explicit channel with this property. In this work, we resolve this question by constructing an explicit family of finite-dimensional quantum channels for which entangling inputs between pairs of channel uses yields an unbounded separation from the achievable communication rate using unentangled inputs. We describe a circuit implementation of our channel that uses only deterministic qudit Clifford unitaries and a single binary measurement with classical feedforward. The key ingredient is a careful design of the measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family.