Guesswork with Quantum Side Information

S. Bhela, D. Deka, H. Nagarajan, and V. Kekatos, “Designing Power Grid Topologies for Minimizing Network Disturbances: An Exact MILP Formulation,” Mar. 2019, arXiv:1903.08354

Original

1903

Earlier work this paper cites.

A. S. Holevo, “Information-theoretical aspects of quantum measurement,” Problemy Peredachi Informatsii , vol. 9, no. 2, pp. 31–42, 1973, English Translation: A. S. Holevo, Problems of Information Transmission, vol. 9, pp. 110-118, 1973

1973

Earlier work this paper cites.

M. K. Hanawal and R. Sundaresan, “Guessing Revisited: A Large Deviations Approach,” arXiv:1008.1977 [cs, math] , Aug. 2010. [Online]. Available: http://arxiv.org/abs/1008.1977

Original

1977

Earlier work this paper cites.

C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” in Proceedings of IEEE International Conference on Computers Systems and Signal Processing , Bangalore, India, December 1984, pp. 175–179

1984

Earlier work this paper cites.

A. K. Ekert, “Quantum cryptography based on Bell’s theorem,” Physical Review Letters , vol. 67, no. 6, pp. 661–663, August 1991

1991

Earlier work this paper cites.

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization , ser. Algorithms and Combinatorics. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993, vol. 2. [Online]. Available: http://link.springer.com/10.1007/978-3-642-78240-4

1993

Earlier work this paper cites.

J. Massey, “Guessing and entropy,” in Proceedings of 1994 IEEE International Symposium on Information Theory . Trondheim, Norway: IEEE, 1994, p. 204. [Online]. Available: http://ieeexplore.ieee.org/document/394764/

1994

Earlier work this paper cites.

E. Arikan, “An inequality on guessing and its application to sequential decoding,” IEEE Transactions on Information Theory , vol. 42, no. 1, pp. 99–105, Jan. 1996. [Online]. Available: http://ieeexplore.ieee.org/document/481781/

1996

Earlier work this paper cites.

E. Arikan and N. Merhav, “Guessing subject to distortion,” IEEE Trans. Inform. Theory , vol. 44, no. 3, pp. 1041–1056, May 1998. [Online]. Available: http://ieeexplore.ieee.org/document/669158/

1998

Earlier work this paper cites.

——, “Joint source-channel coding and guessing with application to sequential decoding,” IEEE Trans. Inform. Theory , vol. 44, no. 5, pp. 1756–1769, Sep. 1998. [Online]. Available: http://ieeexplore.ieee.org/document/705557/

1998

Earlier work this paper cites.

J. Pliam, “The disparity between work and entropy in cryptology,” Cryptology ePrint Archive, Report 1998/024, 1998. [Online]. Available: http://eprint.iacr.org/1998/024

1998

Earlier work this paper cites.

K. R. Parthasarathy, “Extremal decision rules in quantum hypothesis testing,” Infinite Dimensional Analysis, Quantum Probability and Related Topics , vol. 02, no. 04, pp. 557–568, Dec. 1999

1999

Earlier work this paper cites.

D. Malone and W. Sullivan, “Guesswork and Entropy,” IEEE Transactions on Information Theory , vol. 50, no. 3, pp. 525–526, Mar. 2004. [Online]. Available: http://ieeexplore.ieee.org/document/1273661/

2004

Earlier work this paper cites.

S. P. Boyd and L. Vandenberghe, Convex optimization . Cambridge, UK ; New York: Cambridge University Press, 2004, 40706

2004

Earlier work this paper cites.

T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. Wiley-Interscience, 2006

2006

Cited alongside, same era.

R. Lundin, T. Holleboom, and S. Lindskog, “On the Relationship between Confidentiality Measures: Entropy and Guesswork,” in Proceedings of the 5th International Workshop on Security in Information Systems , 2007, pp. 135–144

2007

Cited alongside, same era.

R. Sundaresan, “Guessing Under Source Uncertainty,” IEEE Transactions on Information Theory , vol. 53, no. 1, pp. 269–287, Jan. 2007. [Online]. Available: http://ieeexplore.ieee.org/document/4039677/

2007

Cited alongside, same era.

R. Koenig, R. Renner, and C. Schaffner, “The operational meaning of min- and max-entropy,” IEEE Transactions on Information Theory , vol. 55, no. 9, pp. 4337–4347, Sep. 2009, arXiv:0807.1338

Original

2009

Cited alongside, same era.

M. Tomamichel, Quantum Information Processing with Finite Resources - Mathematical Foundations . Springer, 2016, vol. 5, arXiv:1504.00233

Original

2016

Later among the works it cites.

J. Bezanson, A. Edelman, S. Karpinski, and V. B. Shah, “Julia: A fresh approach to numerical computing,” SIAM review , vol. 59, no. 1, pp. 65–98, 2017. [Online]. Available: https://doi.org/10.1137/141000671

2017

Later among the works it cites.

M. Wilhelm and M. D. Stuber, “Easy Advanced Global Optimization (EAGO): An Open-Source Platform for Robust and Global Optimization in Julia.” AIChE, Oct. 2017. [Online]. Available: https://aiche.confex.com/aiche/2017/meetingapp.cgi/Paper/490467

2017

Later among the works it cites.

M. Berta, O. Fawzi, and M. Tomamichel, “On variational expressions for quantum relative entropies,” Letters in Mathematical Physics , vol. 107, no. 12, pp. 2239–2265, Dec. 2017, arXiv:1512.02615

Original

2017

Later among the works it cites.