Fetching the paper…
Reading the bibliography…
The task of compressing classical information in the one-shot scenario is studied in the setting where the decompressor additionally has access to some given quantum side information.
D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inf. Theory , vol. 19, no. 4, pp. 471–480, Jul. 1973
1973
Earlier work this paper cites.
J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” J. Comput. Syst. Sci. , vol. 18, no. 2, pp. 143–154, Apr. 1979
1979
Earlier work this paper cites.
P. Hausladen and W. K. Wootters, “A ‘Pretty good’ measurement for distinguishing quantum states,” J. Mod. Opt. , vol. 41, no. 12, p. 2385, 1994
1994
Earlier work this paper cites.
S. Verdu and T. S. Han, “A general formula for channel capacity,” IEEE Trans. Inf. Theory , vol. 40, no. 4, pp. 1147–1157, 1994
1994
Earlier work this paper cites.
A. Winter, “Coding theorem and strong converse for quantum channels,” IEEE Trans. Inf. Theory , vol. 45, no. 7, pp. 2481–2485, 1999
1999
Earlier work this paper cites.
T. S. Han, Information-Spectrum Method in Information Theory , 1st ed. Springer, Nov. 2002
2002
Earlier work this paper cites.
I. Devetak and A. Winter, “Classical data compression with quantum side information,” Phys. Rev. A , vol. 68, no. 4, p. 042301, Oct. 2003
2003
Earlier work this paper cites.
M. Hayashi and H. Nagaoka, “General formulas for capacity of classical-quantum channels,” IEEE Trans. Inf. Theory , vol. 49, no. 7, pp. 1753–1768, 2003
2003
Earlier work this paper cites.
R. Renner and S. Wolf, “Smooth Rényi entropy and applications,” in Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on , 2004, p. 233
2004
Earlier work this paper cites.
R. Renner and S. Wolf, “Simple and tight bounds for information reconciliation and privacy amplification,” in Advances in Cryptology - ASIACRYPT 2005 , ser. Lecture Notes in Computer Science. Springer, 2005, pp. 199–216
2005
Earlier work this paper cites.
R. Renner, “Security of quantum key distribution,” Ph.D. dissertation, ETH Zürich, Sep. 2005, arXiv:quant-ph/0512258v2
2005
Earlier work this paper cites.
R. Renner and R. König, “Universally composable privacy amplification against quantum adversaries,” in Proceedings of the Second Theory of Cryptography Conference , ser. Lecture Notes in Computer Science, vol. 3378. Berlin: Springer, Feb. 2005, pp. 407–425
2005
Cited alongside, same era.
I. Devetak and A. Winter, “Distillation of secret key and entanglement from quantum states,” Proc. R. Soc. A , vol. 461, no. 2053, pp. 207–235, Jan. 2005
2005
Cited alongside, same era.
G. Bowen and N. Datta, “Quantum coding theorems for arbitrary sources, channels and entanglement resources,” arXiv:quant-ph/0610003 , Sep. 2006
2006
Cited alongside, same era.
K. M. R. Audenaert, J. Calsamiglia, R. Munoz-Tapia, E. Bagan, L. Masanes, A. Acin, and F. Verstraete, “Discriminating states: The quantum chernoff bound,” Phys. Rev. Lett. , vol. 98, no. 16, p. 160501, Apr. 2007
2007
Cited alongside, same era.
R. König, R. Renner, and C. Schaffner, “The operational meaning of min- and Max-Entropy,” IEEE Trans. Inf. Theory , vol. 55, no. 9, pp. 4337–4347, 2009
2009
Later among the works it cites.
N. Datta and R. Renner, “Smooth Rényi entropies and the quantum information spectrum,” IEEE Trans. Inf. Theory , vol. 55, no. 6, pp. 2807–2815, May 2009
2009
Later among the works it cites.
F. Dupuis, “The decoupling approach to quantum information theory,” Ph.D. dissertation, Université de Montréal, Apr. 2010, arXiv: 1004.1641v1 [quant-ph]
2010
Closest in time.
F. Buscemi and N. Datta, “Distilling entanglement from arbitrary resources,” J. Math. Phys. , vol. 51, no. 10, p. 102201, 2010
2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
K. Audenaert, M. Nussbaum, A. Szkola, and F. Verstraete, “Asymptotic error rates in quantum hypothesis testing,” Comm. Math. Phys. , vol. 279, no. 1, pp. 251–283, Apr. 2008
2008
Cited alongside, same era.
J. M. Renes and J. Boileau, “Physical underpinnings of privacy,” Phys. Rev. A , vol. 78, no. 3, pp. 032 335–12, Sep. 2008
2008
Cited alongside, same era.
2008
Cited alongside, same era.
M. Mosonyi and N. Datta, “Generalized relative entropies and the capacity of classical-quantum channels,” J. Math. Phys. , vol. 50, no. 7, pp. 072 104–14, Jul. 2009
2009
Cited alongside, same era.
N. Datta, “Min- and max- relative entropies and a new entanglement monotone,” IEEE Trans. Inf. Theory , vol. 55, no. 6, pp. 2816–2826, May 2009
2009
Cited alongside, same era.
M. Tomamichel, R. Colbeck, and R. Renner, “A fully quantum asymptotic equipartition property,” IEEE Trans. Inf. Theory , vol. 55, no. 12, pp. 5840–5847, Nov. 2009
2009
Cited alongside, same era.
2010
Closest in time.
M. Tomamichel, R. Colbeck, and R. Renner, “Duality between smooth min- and Max-Entropies,” IEEE Trans. Inf. Theory , vol. 56, no. 9, pp. 4674–4681, 2010
2010
Closest in time.
M. Berta, M. Christandl, R. Colbeck, J. M. Renes, and R. Renner, “The uncertainty principle in the presence of quantum memory,” Nature Physics , vol. 6, pp. 659–662, Jul. 2010
2010
Closest in time.
F. Brandão and N. Datta, “One-shot rates for entanglement manipulation under non-entangling maps,” IEEE Trans. Inf. Theory , vol. 57, no. 3, pp. 1754–1760, Mar. 2011
2011
Closest in time.
2011
Closest in time.
M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, “Leftover hashing against quantum side information,” IEEE Trans. Inf. Theory , vol. 57, no. 8, pp. 5524–5535, Aug. 2011
2011
Closest in time.
J. M. Renes, “Duality of privacy amplification against quantum adversaries and data compression with quantum side information,” Proc. R. Soc. A: Mathematical, Physical and Engineering Science , vol. 467, no. 2130, pp. 1604–1623, Jun. 2011
2011
Closest in time.