暂无分享,去创建一个
[1] A. Pati. Minimum classical bit for remote preparation and measurement of a qubit , 1999, quant-ph/9907022.
[2] H. S. WITSENHAUSEN,et al. The zero-error side information problem and chromatic numbers (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[3] D. Leung,et al. Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels , 2010, Communications in Mathematical Physics.
[4] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[5] A. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .
[6] R. McEliece,et al. The Lovasz bound and some generalizations , 1978 .
[7] Simon Litsyn,et al. Survey of binary Krawtchouk polynomials , 1999, Codes and Association Schemes.
[8] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[9] Moni Naor,et al. Three results on interactive communication , 1993, IEEE Trans. Inf. Theory.
[10] Jop Briët,et al. On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination , 2016, ArXiv.
[11] David E. Roberson,et al. Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants , 2014, TQC.
[12] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[13] D. Kleitman. On a combinatorial conjecture of Erdös , 1966 .
[14] Alexander Schrijver,et al. A comparison of the Delsarte and Lovász bounds , 1979, IEEE Trans. Inf. Theory.
[15] M. Laurent,et al. Complexity of the positive semidefinite matrix completion problem with a rank constraint , 2012, 1203.6602.
[16] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[17] Chris D. Godsil,et al. Coloring an Orthogonality Graph , 2008, SIAM J. Discret. Math..
[18] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[19] Franz Rendl,et al. A semidefinite programming-based heuristic for graph coloring , 2008, Discret. Appl. Math..
[20] Harry Buhrman,et al. Violating the Shannon capacity of metric graphs with entanglement , 2012, Proceedings of the National Academy of Sciences.
[21] A. Razborov. Communication Complexity , 2011 .
[22] Nicolas Gisin,et al. Quantum communication , 2017, 2017 Optical Fiber Communications Conference and Exhibition (OFC).
[23] Alon Orlitsky,et al. Worst-case interactive communication - II: Two messages are not optimal , 1991, IEEE Trans. Inf. Theory.
[24] Andris Ambainis,et al. Quantum search algorithms , 2004, SIGA.
[25] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[26] Private Communications , 2001 .
[27] Harry Buhrman,et al. Quantum Computing and Communication Complexity , 2001, Bull. EATCS.
[28] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[29] Philippe Delsarte,et al. Association Schemes and Coding Theory , 1998, IEEE Trans. Inf. Theory.
[30] H. Lo. Classical-communication cost in distributed quantum-information processing: A generalization of quantum-communication complexity , 1999, quant-ph/9912009.
[31] Charles H. Bennett,et al. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.
[32] David E. Roberson,et al. Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants , 2013, IEEE Transactions on Information Theory.
[33] Alon Orlitsky,et al. Worst-case interactive communication I: Two messages are almost optimal , 1990, IEEE Trans. Inf. Theory.
[34] Shenggen Zheng,et al. Generalizations of the distributed Deutsch–Jozsa promise problem , 2014, Mathematical Structures in Computer Science.
[35] Vladimir I. Levenshtein,et al. Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces , 1995, IEEE Trans. Inf. Theory.
[36] Debbie W. Leung,et al. Improving zero-error classical communication with entanglement , 2009, Physical review letters.
[37] Gilles Brassard,et al. Quantum Counting , 1998, ICALP.
[38] Zoltán Füredi. On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.
[39] Simone Severini,et al. Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number , 2011, IEEE Transactions on Information Theory.
[40] René Peeters,et al. Orthogonal representations over finite fields and the chromatic number of graphs , 1996, Comb..
[41] Simone Severini,et al. On the Quantum Chromatic Number of a Graph , 2007, Electron. J. Comb..
[42] P. Delsarte. AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .
[43] Miklós Ruszinkó,et al. On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.