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

Noise Thresholds of KCBS×KCBS and KCBS×C7 Against the Almost-Quantum Relaxation: The Window Class Is Tight At Φ(1)f

Igor Postanovskyi

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.2139/ssrn.7683761

Related papers

Statistical relaxation in closed quantum systems and the Van Hove-limit

C. Bartsch, Pedro Vidal

arXiv:0710.2008•The European Physical Journal Special Topics•Dec 1, 2007•4 citations

Noise thresholds of products of odd-cycle contextuality scenarios: a CHSH window, an exact face threshold for KCBS × KCBS, and two regimes

Igor Postanovskyi

We study the all-state noise threshold η_b(C_m ⊗ C_n) of the product of two regular odd n-cycle (KCBS-type) scenarios in ℝ³, with every context encoded by two bits and local white noise of the same strength on each factor. The threshold is bounded below by the single-cycle thresholds (product states) and by the maximum M_face(m,n) of the threshold over the two-qubit faces v_j^⊥ ⊗ w_k^⊥. We prove that, for all odd m ≥ 9 and n ≥ 5, the face maximum strictly exceeds the single-cycle threshold of C_m (for m ≥ 13 via the published completeness theorem of Araújo et al. for the n-cycle inequalities). Hence entanglement makes C_m ⊗ C_n strictly more robust than both factors for all odd m, n ≥ 9, and the face maximum is at least of order c/m: liminf_m m·inf_n M_face(m,n) ≥ 3√6·π/8 = 2.8857371… > 2 = lim_m m·E(m); no upper bound of order 1/m is proved. The proof uses one Clauser–Horne witness whose violation reduces to a 2×2 form. On each face a six-bit marginal, the CHSH window, is a CHSH test with visibility (1 − η′)², η′ = η/(2 − η); after this reduction Landau's bound gives the closed lower bound Φ(g_m, g_n) = 2(1 − u)/(2 − u), u = (1 S)^(−1/4). For KCBS × KCBS the face threshold equals the window value exactly, M_face(5,5) = 0.26560777045727252964 (a root of an explicit octic), while for 13 pairs (m,n) the face maximum provably exceeds the window value through a second, Clauser–Horne branch whose value stays bounded away from zero as n → ∞. Pure face dominance fails for C₅ ⊗ C₁₁; we formulate a two-regime conjecture and give the numerical evidence for it, together with the known rigorous upper bounds for all states. For KCBS × KCBS we reduce the all-state upper bound to a positivity hypothesis at noise 1/4 on the non-window facets of the noncontextual polytope, verified exactly on all known facet orbits (flip images checked for the lists of 156 and 437 orbits); under it η_b(C₅ ⊗ C₅) = M_face(5,5), the window facets being settled exactly. The stronger hypothesis at the single-cycle threshold η_b(C₅) is false: at least 25 facet orbits outside the window class are violated beyond η_b(C₅), the largest violating noise, attained by two of them, being t_max ∈ [0.2485455, 0.2485456), the lower end being the noise level up to which a planar singlet violates them (numerically its threshold). All values refer to local bit noise and the regular realisation; several of them change under other noise models. Checkers, certificates and cone covers: https://doi.org/10.5281/zenodo.23204387. Lean library (release 1.4.0): https://doi.org/10.5281/zenodo.23204263

•Oct 7, 2026•1 citation

Noise-induced relaxation of a quantum oscillator interacting with a thermal bath

Г. Ф. Ефремов, Lev G. Mourokh, Anatoly Yu. Smirnov

Physics Letters A•Apr 1, 1993•18 citations

Noise Thresholds Of Products Of Odd-Cycle Contextuality Scenarios: A CHSH Window, An Exact Face Threshold For KCBS × KCBS, And Two Regimes

Igor Postanovskyi

•Jan 1, 2026•0 citations

Non-Gaussian noise as a quantum environment

Tero Tapio Heikkilä, Teemu Ojanen, Yuli V. Nazarov

•Jan 1, 2008•0 citations

KCBS Contextuality Under Non-Depolarizing Noise: Analytic Thresholds for Dephasing and Amplitude Damping

Mario Ivanov

We derive closed-form expressions for the KCBS witness K(p) under two noise channels not previously analyzed analytically for a spin-1 qutrit: dephasing and full-cascade amplitude damping. For the KCBS-optimal state |2><2|, dephasing leaves the witness invariant (K(p) = sqrt(5) for all p) because the optimal state carries no coherences. Amplitude damping yields K(p) = A*p*(2-p) + sqrt(5)*(1-p)^2, where A = 5/2 - sqrt(5)/2, with noise threshold p* = 1 - sqrt((sqrt(5)-1)/(3*sqrt(5)-5)) ≈ 0.149. This is 2.78x lower than the depolarizing threshold p* ≈ 0.415, showing that the geometry of the noise channel — not only its strength — determines how quickly contextuality is lost. All results are verified numerically to machine precision.

•Oct 16, 2026•0 citations
We study the all-state noise threshold η_b(C_m ⊗ C_n) of the product of two regular odd n-cycle (KCBS-type) scenarios in ℝ³, with every context encoded by two bits and local white noise of the same strength on each factor. The threshold is bounded below by the single-cycle thresholds (product states) and by the maximum M_face(m,n) of the threshold over the two-qubit faces v_j^⊥ ⊗ w_k^⊥. We prove that, for all odd m ≥ 9 and n ≥ 5, the face maximum strictly exceeds the single-cycle threshold of C_m (for m ≥ 13 via the published completeness theorem of Araújo et al. for the n-cycle inequalities). Hence entanglement makes C_m ⊗ C_n strictly more robust than both factors for all odd m, n ≥ 9, and the face maximum is at least of order c/m: liminf_m m·inf_n M_face(m,n) ≥ 3√6·π/8 = 2.8857371… > 2 = lim_m m·E(m); no upper bound of order 1/m is proved. The proof uses one Clauser–Horne witness whose violation reduces to a 2×2 form. On each face a six-bit marginal, the CHSH window, is a CHSH test with visibility (1 − η′)², η′ = η/(2 − η); after this reduction Landau's bound gives the closed lower bound Φ(g_m, g_n) = 2(1 − u)/(2 − u), u = (1 S)^(−1/4). For KCBS × KCBS the face threshold equals the window value exactly, M_face(5,5) = 0.26560777045727252964 (a root of an explicit octic), while for 13 pairs (m,n) the face maximum provably exceeds the window value through a second, Clauser–Horne branch whose value stays bounded away from zero as n → ∞. Pure face dominance fails for C₅ ⊗ C₁₁; we formulate a two-regime conjecture and give the numerical evidence for it, together with the known rigorous upper bounds for all states. For KCBS × KCBS we reduce the all-state upper bound to a positivity hypothesis at noise 1/4 on the non-window facets of the noncontextual polytope, verified exactly on all known facet orbits (flip images checked for the lists of 156 and 437 orbits); under it η_b(C₅ ⊗ C₅) = M_face(5,5), the window facets being settled exactly. The stronger hypothesis at the single-cycle threshold η_b(C₅) is false: at least 25 facet orbits outside the window class are violated beyond η_b(C₅), the largest violating noise, attained by two of them, being t_max ∈ [0.2485455, 0.2485456), the lower end being the noise level up to which a planar singlet violates them (numerically its threshold). All values refer to local bit noise and the regular realisation; several of them change under other noise models. Checkers, certificates and cone covers: https://doi.org/10.5281/zenodo.23204387. Lean library (release 1.4.0): https://doi.org/10.5281/zenodo.23204263
We derive closed-form expressions for the KCBS witness K(p) under two noise channels not previously analyzed analytically for a spin-1 qutrit: dephasing and full-cascade amplitude damping. For the KCBS-optimal state |2><2|, dephasing leaves the witness invariant (K(p) = sqrt(5) for all p) because the optimal state carries no coherences. Amplitude damping yields K(p) = A*p*(2-p) + sqrt(5)*(1-p)^2, where A = 5/2 - sqrt(5)/2, with noise threshold p* = 1 - sqrt((sqrt(5)-1)/(3*sqrt(5)-5)) ≈ 0.149. This is 2.78x lower than the depolarizing threshold p* ≈ 0.415, showing that the geometry of the noise channel — not only its strength — determines how quickly contextuality is lost. All results are verified numerically to machine precision.