Fetching the paper…
Reading the bibliography…
Bound secret information is classical information that contains secrecy but from which secrecy cannot be extracted.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland Publishing Company, 1977)
1977
Earlier work this paper cites.
C. H. Bennett and G. Brassard, in Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India (1984) pp. 175–179
1984
Earlier work this paper cites.
C. Bennett and G. Brassard, IBM Technical Disclosure Bulletin 28
1985
Earlier work this paper cites.
U. M. Maurer, IEEE Transactions on Information Theory 39
1993
Earlier work this paper cites.
D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sanpera, Phys. Rev. Lett. 77
1996
Earlier work this paper cites.
D. Bruß, Phys. Rev. Lett. 81
1998
Earlier work this paper cites.
P. W. Shor and J. Preskill, Phys. Rev. Lett. 85
2000
Earlier work this paper cites.
N. Gisin and S. Wolf, “Linking classical and quantum key agreement: Is there “bound information”?” in Advances in Cryptology — CRYPTO 2000: 20th Annual International Cryptology Conference Santa Barbara, California, USA, August 20–24, 2000 Proceedings , edited by M. Bellare (Springer Berlin Heidelberg, Berlin, Heidelberg, 2000) pp. 482–500
2000
Earlier work this paper cites.
N. Gisin, R. Renner, and S. Wolf, “Bound information: The classical analog to bound quantum entanglemen,” in European Congress of Mathematics: Barcelona, July 10–14, 2000 Volume II , edited by C. Casacuberta, R. M. Miró-Roig, J. Verdera, and S. Xambó-Descamps (Birkhäuser Basel, Basel, 2001) pp. 439–447
2001
Earlier work this paper cites.
H. F. Chau, Phys. Rev. A 66
2002
Earlier work this paper cites.
Gisin, Renner, and Wolf, Algorithmica 34
2002
Cited alongside, same era.
D. Collins and S. Popescu, Phys. Rev. A 65
2002
Cited alongside, same era.
D. Gottesman and H.-K. Lo, IEEE Transactions on Information Theory 49
2003
Cited alongside, same era.
R. Renner and S. Wolf, in Advances in Cryptology — EUROCRYPT 2003 , Lecture Notes in Computer Science, Vol. 2656, edited by E. Biham (Springer-Verlag, 2003) pp. 562–577
2003
Cited alongside, same era.
M. Curty, M. Lewenstein, and N. Lütkenhaus, Phys. Rev. Lett. 92
2004
Cited alongside, same era.
J. Lofberg, in Computer Aided Control Systems Design, 2004 IEEE International Symposium on (2004) pp. 284–289
2004
Cited alongside, same era.
J. Bae and A. Acín, Phys. Rev. A 75
2007
Later among the works it cites.
G. O. Myhr, J. M. Renes, A. C. Doherty, and N. Lütkenhaus, Phys. Rev. A 79
2009
Later among the works it cites.
K. S. Ranade, Journal of Physics A: Mathematical and Theoretical 42
2009
Later among the works it cites.
2010
Later among the works it cites.
N. Lütkenhaus, in Quantum Information and Coherence , edited by E. Andersson and P. Öhberg (Springer, 2014) Chap. 10, pp. 107–146
2014
Later among the works it cites.
J. Chen, Z. Ji, D. Kribs, N. Lütkenhaus, and B. Zeng, Phys. Rev. A 90
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Acín and N. Gisin, Phys. Rev. Lett. 94
2005
Cited alongside, same era.
T. Moroder, M. Curty, and N. Lütkenhaus, Phys. Rev. A 74
2006
Cited alongside, same era.
A. Acín, J. Bae, E. Bagan, M. Baig, L. Masanes, and R. Muñoz Tapia, Phys. Rev. A 73
2006
Cited alongside, same era.
See [ 5 ] for an introduction to symmetrically extendable states. See [ 33 , 27 ] for the only currently-known necessary and sufficient criteria for symmetric extendability that hold for two classes of states. From now on, by symmetrically extendable we will always mean symmetrically extendable to a copy of Bob’s system
Cited in the paper.
Normalization of the state is unimportant for symmetric extendability since if ρ A B \rho^{AB} is symmetrically extendable then so is α ρ A B \alpha\rho^{AB} for any α > 0 \alpha>0
Cited in the paper.
Not all of the codes selected initially were inequivalent. The total number of tested codes given is the number of inequivalent codes based on determining the equivalence of codes according to the results of the procedure described above. See [ 22 ] for details
Cited in the paper.
2014
Later among the works it cites.
S. Khatri, Symmetric Extendability of Quantum States and the Extreme Limits of Quantum Key Distribution , Master’s thesis , University of Waterloo (2016)
2016
Closest in time.
B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd, Journal of Optimization Theory and Applications 169
2016
Closest in time.
J. Watrous, “Theory of quantum information,” (2016)
2016
Closest in time.