UvA-DARE ( Digital Academic Repository ) Round Elimination in Exact Communication
暂无分享,去创建一个
[1] David E. Roberson,et al. Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants , 2014, TQC.
[2] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[3] Philippe Delsarte,et al. Association Schemes and Coding Theory , 1998, IEEE Trans. Inf. Theory.
[4] A. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .
[5] René Peeters,et al. Orthogonal representations over finite fields and the chromatic number of graphs , 1996, Comb..
[6] Debbie W. Leung,et al. Improving zero-error classical communication with entanglement , 2009, Physical review letters.
[7] Chris D. Godsil,et al. Coloring an Orthogonality Graph , 2008, SIAM J. Discret. Math..
[8] D. Leung,et al. Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels , 2010, Communications in Mathematical Physics.
[9] H. S. WITSENHAUSEN,et al. The zero-error side information problem and chromatic numbers (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[10] Alon Orlitsky,et al. Worst-case interactive communication I: Two messages are almost optimal , 1990, IEEE Trans. Inf. Theory.
[11] 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.
[12] Nicolas Gisin,et al. Quantum communication , 2017, 2017 Optical Fiber Communications Conference and Exhibition (OFC).
[13] Simone Severini,et al. Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number , 2011, IEEE Transactions on Information Theory.
[14] Gilles Brassard,et al. Quantum Counting , 1998, ICALP.
[15] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[16] Vladimir I. Levenshtein,et al. Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces , 1995, IEEE Trans. Inf. Theory.
[17] Shenggen Zheng,et al. Generalizations of the distributed Deutsch–Jozsa promise problem , 2014, Mathematical Structures in Computer Science.
[18] Harry Buhrman,et al. Violating the Shannon capacity of metric graphs with entanglement , 2012, Proceedings of the National Academy of Sciences.
[19] Simone Severini,et al. On the Quantum Chromatic Number of a Graph , 2007, Electron. J. Comb..
[20] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[21] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[22] Zoltán Füredi. On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.
[23] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[24] A. Razborov. Communication Complexity , 2011 .
[25] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[26] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[27] Harry Buhrman,et al. Quantum Computing and Communication Complexity , 2001, Bull. EATCS.
[28] Moni Naor,et al. Three results on interactive communication , 1993, IEEE Trans. Inf. Theory.
[29] Andris Ambainis,et al. Quantum search algorithms , 2004, SIGA.