Fetching the paper…
Reading the bibliography…
We study the use of quantum entanglement in the zero-error source-channel coding problem.
R. E. A. C. Paley, “On orthogonal matrices,” Journal of Mathematics and Physics (now called Studies in Applied Mathematics) , vol. 12, pp. 311–320, 1933
1933
Earlier work this paper cites.
A. Einstein, P. Podolsky, and N. Rosen, “Can quantum-mechanical description of physical reality be considered complete?” Physical Review , vol. 47, pp. 777–780, 1935
1935
Earlier work this paper cites.
C. Shannon, “The zero error capacity of a noisy channel,” IRE Transactions on Information Theory , vol. 2, no. 3, pp. 8–19, 1956
1956
Earlier work this paper cites.
J. S. Bell, “On the Einstein-Podolsky-Rosen paradox,” Physics , vol. 1, pp. 195–200, 1964
1964
Earlier work this paper cites.
M. J. Ferguson and D. W. Bailey, “Zero-error coding for correlated sources,” unpublished manuscript, 1975
1975
Earlier work this paper cites.
H. S. Witsenhausen, “The zero-error side information problem and chromatic numbers,” IEEE Transactions on Information Theory , vol. 22, no. 5, pp. 592–593, 1976
1976
Earlier work this paper cites.
L. Lovász, “On the Shannon capacity of a graph,” IEEE Transactions on Information Theory , vol. 25, no. 1, pp. 1–7, 1979
1979
Earlier work this paper cites.
P. Frankl and R. Wilson, “Intersection theorems with geometric consequences,” Combinatorica , vol. 1, no. 4, pp. 357–368, 1981
1981
Earlier work this paper cites.
M. O. Albertson and K. L. Collins, “Homomorphisms of 3-chromatic graphs,” Discrete Mathematics , vol. 54, no. 2, pp. 127–132, 1985
1985
Earlier work this paper cites.
M. Xia and G. Liu, “An infinite class of supplementary difference sets and Williamson matrices,” Journal of Combinatorial Theory, Series A , vol. 58, no. 2, pp. 310–317, 1991
1991
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels,” Physical Review Letters , vol. 70, pp. 1895–1899, 1993
1993
Earlier work this paper cites.
M. Szegedy, “A note on the ϑ \vartheta number of Lovász and the generalized Delsarte bound,” Proceedings of the 45th Annual IEEE Annual Symposium on Foundations of Computer Science (FOCS 2004) , pp. 36–39, 1994
1994
Earlier work this paper cites.
D. E. Knuth, “The sandwich theorem,” Electronic Journal of Combinatorics , vol. 1, no. A1, 1994
1994
Earlier work this paper cites.
D. Barrington, R. Beigel, and S. Rudich, “Representing boolean functions as polynomials modulo composite numbers,” Computational Complexity , vol. 4, no. 4, pp. 367–382, 1994
1994
Earlier work this paper cites.
S. Vembu, S. Verdu, and Y. Steinberg, “The source-channel separation theorem revisited,” IEEE Transactions on Information Theory , vol. 41, no. 1, pp. 44–54, 1995
1995
Cited alongside, same era.
——, “A new family of supplementary difference sets and Hadamard matrices,” Journal of Statistical Planning and Inference , vol. 51, no. 3, pp. 283–291, 1996
1996
Cited alongside, same era.
R. Wilson and Q. Xiang, “Constructions of Hadamard difference sets,” Journal of combinatorial theory. Series A , vol. 77, no. 1, pp. 148–160, 1997
1997
Cited alongside, same era.
Y. Chen, “On the existence of abelian Hadamard difference sets and a new family of difference sets,” Finite fields and their Applications , vol. 3, no. 3, pp. 234–256, 1997
1997
Cited alongside, same era.
J. Körner and A. Orlitsky, “Zero-error information theory,” IEEE Transactions on Information Theory , vol. 44, no. 6, pp. 2207–2229, 1998
P. Gopalan, “Constructing Ramsey graphs from boolean function representations,” in Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006) , pp. 14, 2006
2006
Later among the works it cites.
E. Lubetzky, “Graph powers and related extremal problems,” Ph.D. dissertation, Tel Aviv University, 2007
2007
Later among the works it cites.
P. Cameron, A. Montanaro, M. Newman, S. Severini, and A. Winter, “On the quantum chromatic number of a graph,” Electronic Journal of Combinatorics , vol. 14, no. R81, p. 1, 2007
2007
Later among the works it cites.
N. Gvozdenovic and M. Laurent, “The operator Ψ \Psi for the chromatic number of a graph,” SIAM Journal on Optimization , vol. 19, no. 2, pp. 572–591, 2008
2008
Later among the works it cites.
T. S. Cubitt, D. Leung, W. Matthews, and A. Winter, “Improving zero-error classical communication with entanglement,” Physical Review Letters , vol. 104, no. 23, p. 230503, 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1998
Cited alongside, same era.
Q. Xiang, “Difference families from lines and half lines,” European Journal of Combinatorics , vol. 19, no. 3, pp. 395–400, 1998
1998
Cited alongside, same era.
N. Alon, “The Shannon capacity of a union,” Combinatorica , vol. 18, no. 3, pp. 301–310, 1998
1998
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . New York: Cambridge University Press, 2000
2000
Cited alongside, same era.
C. H. Bennett, D. P. DiVincenzo, P. W. Shor, J. A. Smolin, B. M. Terhal, and W. K. Wootters, “Remote state preparation,” Physical Review Letters , vol. 87, p. 077902, 2001
2001
Cited alongside, same era.
R. Spekkens and T. Rudolph, “Optimization of coherent attacks in generalizations of the bb84 quantum bit commitment protocol,” Quantum Information & Computation , vol. 2, pp. 66–96, 2002
2002
Cited alongside, same era.
N. Alon, “Graph powers,” Contemporary Combinatorics , pp. 11–28, 2002
2002
Cited alongside, same era.
J. Nayak, E. Tuncel, and K. Rose, “Zero-error source-channel coding with side information,” IEEE Transactions on Information Theory , vol. 52, no. 10, pp. 4626–4629, 2006
2006
Cited alongside, same era.
2010
Later among the works it cites.
S. Beigi, “Entanglement-assisted zero-error capacity is upper-bounded by the Lovász ϑ \vartheta function,” Physical Review A , vol. 82, no. 1, p. 010303, 2010
2010
Later among the works it cites.
D. Leung, L. Mancinska, W. Matthews, M. Ozols, and A. Roy, “Entanglement can increase asymptotic rates of zero-error classical communication over classical channels,” Communications in Mathematical Physics , vol. 311, pp. 97–111, 2012
2012
Later among the works it cites.
J. Briët, H. Buhrman, and D. Gijswijt, “Violating the Shannon capacity of metric graphs with entanglement,” Proceedings of the National Academy of Sciences , 2012
2012
Later among the works it cites.
D. E. Roberson and L. Mančinska, “Graph homomorphisms for quantum players,” arXiv:1212.1724, 2012
2012
Later among the works it cites.
S. Yekhanin, “Locally decodable codes,” Foundations and Trends in Theoretical Computer Science , vol. 6, no. 3, pp. 139–255, 2012
2012
Later among the works it cites.
L. Mančinska, G. Scarpa, and S. Severini, “New separations in zero-error channel capacity through projective Kochen-Specker sets and quantum coloring,” IEEE Transactions on Information Theory , vol. 59, no. 6, pp. 4025–4032, 2013
2013
Closest in time.
Z. Ji, “Binary constraint system games and locally commutative reductions,” arXiv:1310.3794, 2013
2013
Closest in time.
R. Duan, S. Severini, and A. Winter, “Zero-error communication via quantum channels, noncommutative graphs, and a quantum Lovász number,” IEEE Transactions on Information Theory , vol. 59, no. 2, pp. 1164 –1174, 2013
2013
Closest in time.
T. S. Cubitt, L. Mančinska, D. E. Roberson, S. Severini, D. Stahlke, and A. Winter, “Bounds on entanglement assisted source-channel coding via the lovász theta number and its variants,” IEEE Transactions on Information Theory , vol. 60, no. 11, pp. 7330–7344, 2014
2014
Closest in time.