{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:02:39Z","timestamp":1780095759982,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709176","type":"print"},{"value":"9783540709183","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_52","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"610-621","source":"Crossref","is-referenced-by-count":81,"title":["Quantum Network Coding"],"prefix":"10.1007","author":[{"given":"Masahito","family":"Hayashi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harumichi","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rudy","family":"Raymond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shigeru","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., et al.: Network information flow. IEEE Transactions on Information Theory\u00a046, 1204\u20131216 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/581771.581773","volume":"49","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A., et al.: Dense quantum coding and quantum finite automata. J. ACM\u00a049, 496\u2013511 (2002)","journal-title":"J. ACM"},{"key":"52_CR3","first-page":"175","volume-title":"Proc. IEEE International Conference on Computers, Systems and Signal Processing","author":"C.H. Bennett","year":"1984","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proc. IEEE International Conference on Computers, Systems and Signal Processing, pp. 175\u2013179. IEEE Computer Society Press, Los Alamitos (1984)"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","volume":"70","author":"C.H. Bennett","year":"1993","unstructured":"Bennett, C.H., et al.: Teleporting an unknown quantum states via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett.\u00a070, 1895\u20131899 (1993)","journal-title":"Phys. Rev. Lett."},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","volume":"69","author":"C.H. Bennett","year":"1992","unstructured":"Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett.\u00a069, 2881\u20132884 (1992)","journal-title":"Phys. Rev. Lett."},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"12302","DOI":"10.1103\/PhysRevA.62.012302","volume":"62","author":"D. Bru\u00df","year":"2000","unstructured":"Bru\u00df, D., et al.: Phase-covariant quantum cloning. Phys. Rev. A\u00a062, 12302 (2000)","journal-title":"Phys. Rev. A"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1103\/PhysRevA.54.1844","volume":"54","author":"V. Bu\u017eek","year":"1996","unstructured":"Bu\u017eek, V., Hillery, M.: Quantum copying: Beyond the no-cloning theorem. Phys. Rev. A\u00a054, 1844\u20131852 (1996)","journal-title":"Phys. Rev. A"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.1103\/PhysRevA.60.R2626","volume":"60","author":"V. Bu\u017eek","year":"1999","unstructured":"Bu\u017eek, V., Hillery, M., Werner, R.F.: Optimal manipulation with qubits: universal NOT gate. Phys. Rev. A\u00a060, 2626\u20132629 (1999)","journal-title":"Phys. Rev. A"},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"7415","DOI":"10.1088\/0305-4470\/35\/34\/312","volume":"35","author":"H. Fan","year":"2002","unstructured":"Fan, H., et al.: Phase-covariant quantum cloning. J. Phys. A: Math. Gen.\u00a035, 7415\u20137423 (2002)","journal-title":"J. Phys. A: Math. Gen."},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1103\/PhysRevA.59.3290","volume":"59","author":"A. Fujiwara","year":"1999","unstructured":"Fujiwara, A., Algoet, P.: One-to-one parametrization of quantum channels. Phys. Rev. A\u00a059, 3290\u20133294 (1999)","journal-title":"Phys. Rev. A"},{"key":"52_CR11","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1103\/PhysRevLett.83.432","volume":"83","author":"N. Gisin","year":"1999","unstructured":"Gisin, N., Popescu, S.: Spin flips and quantum information for antiparallel spins. Phys. Rev. Lett.\u00a083, 432\u2013435 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"52_CR12","unstructured":"Harvey, N.J., Kleinberg, R.D., Lehman, A.R.: Comparing network coding with multicommodity flow for the k-pairs communication problem. MIT LCS Technical Report 964 (September 2004)"},{"key":"52_CR13","unstructured":"Hayashi, M., et al.: Quantum network coding. Talk at 9th QIP, quant-ph\/0601088 (2006)"},{"key":"52_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1088\/1367-2630\/8\/8\/129","volume":"8","author":"M. Hayashi","year":"2006","unstructured":"Hayashi, M., et al. (4,1)-quantum random access coding does not exist. New J. Phys.\u00a08, 129 (2006)","journal-title":"New J. Phys."},{"key":"52_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-45841-7_24","volume-title":"STACS 2002","author":"P. H\u00f8yer","year":"2002","unstructured":"H\u00f8yer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 299\u2013310. Springer, Heidelberg (2002)"},{"key":"52_CR16","unstructured":"Koetter, R.: Network coding home page. \n                    \n                      http:\/\/tesla.csl.uiuc.edu\/~koetter\/NWC\/"},{"key":"52_CR17","unstructured":"Leung, D., Oppenheim, J., Winter, A.: Quantum network communication \u2013the butterfly and beyond. quant-ph\/0608233"},{"key":"52_CR18","first-page":"369","volume-title":"Proc. 40th IEEE FOCS","author":"A. Nayak","year":"1999","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proc. 40th IEEE FOCS, pp. 369\u2013376. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"52_CR19","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge (2000)"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0024-3795(01)00547-X","volume":"347","author":"M.B. Ruskai","year":"2002","unstructured":"Ruskai, M.B., Szarek, S., Werner, E.: An analysis of complete-positive trace-preserving maps on 2\u00d72 matrices. Lin. Alg. Appl.\u00a0347, 159\u2013187 (2002)","journal-title":"Lin. Alg. Appl."},{"key":"52_CR21","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1103\/PhysRevA.51.2738","volume":"51","author":"B. Schumacher","year":"1995","unstructured":"Schumacher, B.: Quantum coding. Phys. Rev. A\u00a051, 2738\u20132747 (1995)","journal-title":"Phys. Rev. A"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Shi, Y., Soljanin, E.: On multicast in quantum network. In: Proc. 40th Annual Conference on Information Sciences and Systems (2006)","DOI":"10.1109\/CISS.2006.286589"},{"key":"52_CR23","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"P. Shor","year":"1995","unstructured":"Shor, P.: Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A\u00a052, 2493\u20132496 (1995)","journal-title":"Phys. Rev. A"},{"key":"52_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1007\/11523468_115","volume-title":"Automata, Languages and Programming","author":"S. Wehner","year":"2005","unstructured":"Wehner, S., de Wolf, R.: Improved lower bounds for locally decodable codes and private information retrieval. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1424\u20131436. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:59Z","timestamp":1605762719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_52","relation":{},"subject":[]}}