analiza aiqbench
This research simplifies one-shot information theory calculations by demonstrating that using marginal states instead of complex optimizers introduces only a small, bounded overhead in Petz-Rényi divergence and fidelity measures. The finding provides a practical approximation method for quantum information tasks where full optimization is computationally prohibitive or analytically difficult. By reducing the complexity of state selection, this work advances the efficiency of theoretical frameworks used in quantum communication and cryptography.
The marginal is pretty good
arXiv:2609.05225v1 Announce Type: new Abstract: One-shot information theory measures often require an optimization over states, but the form of these optimizers can be complicated or depend on the initial problem in nonlinear ways. In this note, we show that in many instances using the marginal instead of the optimal state is sufficiently good and only changes the result by a small factor. We prove that for the Petz-R\'enyi divergence of order $\alpha\in[1/2,1)$, replacing the optimizing state on $B$ by the marginal $\rho_B$ results in a multiplicative overhead of at most $1/\alpha$. We also show a similar relation for the fidelity, and in the case of pure or quantum-classical states for the sandwiched R\'enyi divergence.
Abstract:One-shot information theory measures often require an optimization over states, but the form of these optimizers can be complicated or depend on the initial problem in nonlinear ways. In this note, we show that in many instances using the marginal instead of the optimal state is sufficiently good and only changes the result by a small factor. We prove that for the Petz-Rényi divergence of order $\alpha\in[1/2,1)$, replacing the optimizing state on $B$ by the marginal $\rho_B$ results in a multiplicative overhead of at most $1/\alpha$. We also show a similar relation for the fidelity, and in the case of pure or quantum-classical states for the sandwiched Rényi divergence.
Quantum Physics (quant-ph); Information Theory (cs.IT)
arXiv:2609.05225 [quant-ph]
(or arXiv:2609.05225v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.05225 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 206 cuvinte
Subiecte conexe
Gears for political races
LessWrong · 17 iun. 2026

Frontier post-training recipe review with Finbarr Timbers
Interconnects · 16 iun. 2026

Coherent (COHR) Q4 2026 Earnings Call Transcript
fool.com · 20 aug. 2026
Podcast with Venture Investor Russ Fein
Quantum Computing Report · 27 aug. 2026