Asymptotic Redundancies for Universal Quantum Coding
| dc.creator | Krattenthaler, Christian | |
| dc.creator | Slater, Paul | |
| dc.date | 1996-12-18 | |
| dc.date | 1999-03-25 | |
| dc.date.accessioned | 2026-07-07T09:05:11Z | |
| dc.date.available | 2026-07-07T09:05:11Z | |
| dc.description | We investigate the question of whether or not there exists a noncommutative/ quantum extension of a recent (commutative probabilistic) result of Clarke and Barron. They demonstrated that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy - the excess of the encoding cost over the source entropy - of universal data compression in a parametric setting. We study certain probability distributions for the two-level quantum systems. We are able to compute exact formulas for the corresponding redundancies, for which we find the asymptotic limits. These results are very suggestive and do indeed point towards a possible quantum extension of the result of Clarke and Barron. | |
| dc.description | 35 pages, AmS-LaTeX v1.2, with psfig.sty, two postscript figures (fig2.eps, fig3.eps). This is a substantial revision of the previous version. The introduction was rewritten completely. The minimax redundancy problem is now resolved as well | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9612043 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9612043 | |
| dc.identifier | IEEE Trans.Info.Theor. 46 (2000) 801-819 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/149632 | |
| dc.subject | Quantum Physics | |
| dc.title | Asymptotic Redundancies for Universal Quantum Coding | |
| dc.type | text |