Unbounded Additive Gains and Uniform Lifetime Bounds for Controlled Qubit Memories

We study the entanglement-breaking lifetime of a qubit subjected repeatedly to one fixed noise channel. Let m_U denote the best lifetime obtained by repeating one unitary control, N_U the lifetime under varying unitary controls, and N the lifetime under arbitrary deterministic qubit channels. We construct a nonempty open set of strictly completely positive channels with m_U = 3 and N_U = N = 4, disproving the stationary-control clause of the Lami–Giovannetti conjecture. A fixed Lindblad generator also produces weak-step channels for which N_U − m_U diverges. Nevertheless, every channel with finite m_U satisfies N_U < 50m_U and N < 128m_U. For such a non-entanglement-breaking channel, write C for its normalized Choi concurrence and δ for its minimum output eigenvalue over pure inputs. The scale T = 1 + log(1 + (1 − C)/δ)/(−log C) satisfies T/50 < m_U ≤ N_U ≤ N ≤ 14T. The proof combines a concurrence estimate for the positive-partial-transpose criterion, a stationary purity alignment, and a partition that charges purifying controls for their concurrence loss. The constants are conservative, and the separation constructions have existential small-parameter ranges. The lifetime comparisons exclude retained ancillas, persistent measurement records and postselection; N = N_U remains open. A visual guide records the reasoning routes and distinguishes inherited premises, numerical leads and proved conclusions.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24212309
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Unbounded Additive Gains and Uniform Lifetime Bounds for Controlled Qubit Memories

Ying Xie
Zenodo (CERN European Organization for Nuclear Research)
Quantum Information and Cryptography
preprint

Unbounded Additive Gains and Uniform Lifetime Bounds for Controlled Qubit Memories

Ying Xie
preprint en

Abstract

We study the entanglement-breaking lifetime of a qubit subjected repeatedly to one fixed noise channel. Let m_U denote the best lifetime obtained by repeating one unitary control, N_U the lifetime under varying unitary controls, and N the lifetime under arbitrary deterministic qubit channels. We construct a nonempty open set of strictly completely positive channels with m_U = 3 and N_U = N = 4, disproving the stationary-control clause of the Lami–Giovannetti conjecture. A fixed Lindblad generator also produces weak-step channels for which N_U − m_U diverges. Nevertheless, every channel with finite m_U satisfies N_U < 50m_U and N < 128m_U. For such a non-entanglement-breaking channel, write C for its normalized Choi concurrence and δ for its minimum output eigenvalue over pure inputs. The scale T = 1 + log(1 + (1 − C)/δ)/(−log C) satisfies T/50 < m_U ≤ N_U ≤ N ≤ 14T. The proof combines a concurrence estimate for the positive-partial-transpose criterion, a stationary purity alignment, and a partition that charges purifying controls for their concurrence loss. The constants are conservative, and the separation constructions have existential small-parameter ranges. The lifetime comparisons exclude retained ancillas, persistent measurement records and postselection; N = N_U remains open. A visual guide records the reasoning routes and distinguishes inherited premises, numerical leads and proved conclusions.

Zenodo (CERN European Organization for Nuclear Research)
Kennesaw State University (US)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon