{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T08:59:54Z","timestamp":1769763594368,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,1,5]],"date-time":"2018-01-05T00:00:00Z","timestamp":1515110400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11432-017-9190-0","type":"journal-article","created":{"date-parts":[[2018,1,9]],"date-time":"2018-01-09T05:15:11Z","timestamp":1515474911000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Quantum network communication: a discrete-time quantum-walk approach"],"prefix":"10.1007","volume":"61","author":[{"given":"Yuguang","family":"Yang","sequence":"first","affiliation":[]},{"given":"Jiajie","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yihua","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Weimin","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Xiubo","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Huijuan","family":"Zuo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,5]]},"reference":[{"key":"9190_CR1","doi-asserted-by":"crossref","unstructured":"Zhou Z L, Wu Q J, Huang F, et al. Fast and accurate near-duplicate image elimination for visual sensor networks. Int J Distrib Sens N, doi: 10.1177\/1550147717694172","DOI":"10.1177\/1550147717694172"},{"key":"9190_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/CC.2016.7489970","volume":"13","author":"Y H Zhang","year":"2016","unstructured":"Zhang Y H, Sun X M, Wang B W. Efficient algorithm for K-Barrier coverage based on integer linear programming. China Commun, 2016, 13: 16\u201323","journal-title":"China Commun"},{"key":"9190_CR3","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/TBC.2016.2580920","volume":"62","author":"Z Q Pan","year":"2016","unstructured":"Pan Z Q, Lei J J, Zhang Y, et al. Fast motion estimation based on content property for low-complexity H. HEVC encoder. IEEE Trans Broadcast, 2016, 62: 675\u2013684","journal-title":"IEEE Trans Broadcast"},{"key":"9190_CR4","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.jvcir.2016.07.018","volume":"40","author":"Z Q Pan","year":"2016","unstructured":"Pan Z Q, Jin P, Lei J J, et al. Fast reference frame selection based on content similarity for low complexity HEVC encoder. J Vis Commun Image R, 2016, 40: 516\u2013524","journal-title":"J Vis Commun Image R"},{"key":"9190_CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1504\/IJSNET.2017.083533","volume":"23","author":"J Zhang","year":"2017","unstructured":"Zhang J, Tang J, Wang T B, et al. Energy-efficient data-gathering rendezvous algorithms with mobile sinks for wireless sensor networks. Int J Sens Netw, 2017, 23: 248\u2013257","journal-title":"Int J Sens Netw"},{"key":"9190_CR6","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li S-Y R, et al. Network information flow. IEEE Trans Inf Theory, 2000, 46: 1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"key":"9190_CR7","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W K Wootters","year":"1982","unstructured":"Wootters W K, Zurek W H. A single quantum cannot be cloned. Nature, 1982, 299: 802\u2013803","journal-title":"Nature"},{"key":"9190_CR8","first-page":"610","volume-title":"Proceedings of Annual Symposium on Theoretical Aspects of Computer Science","author":"M Hayashi","year":"2007","unstructured":"Hayashi M, Iwama K, Nishimura H, et al. Quantum network coding. In: Proceedings of Annual Symposium on Theoretical Aspects of Computer Science. Berlin: Springer, 2007. 4393: 610\u2013621","edition":"4393"},{"key":"9190_CR9","doi-asserted-by":"crossref","first-page":"040301","DOI":"10.1103\/PhysRevA.76.040301","volume":"76","author":"M Hayashi","year":"2007","unstructured":"Hayashi M. Prior entanglement between senders enables perfect quantum network coding with modification. Phys Rev A, 2007, 76: 040301","journal-title":"Phys Rev A"},{"key":"9190_CR10","doi-asserted-by":"crossref","first-page":"032331","DOI":"10.1103\/PhysRevA.86.032331","volume":"86","author":"T Satoh","year":"2012","unstructured":"Satoh T, Le Gall F, Imai H. Quantum network coding for quantum repeaters. Phys Rev A, 2012, 86: 032331","journal-title":"Phys Rev A"},{"key":"9190_CR11","doi-asserted-by":"crossref","first-page":"012333","DOI":"10.1103\/PhysRevA.84.012333","volume":"84","author":"A Soeda","year":"2011","unstructured":"Soeda A, Kinjo Y, Turner P S, et al. Quantum computation over the butterfly network. Phys Rev A, 2011, 84: 012333","journal-title":"Phys Rev A"},{"key":"9190_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/LCOMM.2014.2379253","volume":"19","author":"J Li","year":"2015","unstructured":"Li J, Chen X B, Xu G, et al. Perfect quantum network coding independent of classical network solutions. IEEE Commun Lett, 2015, 19: 115\u2013118","journal-title":"IEEE Commun Lett"},{"key":"9190_CR13","doi-asserted-by":"crossref","first-page":"042301","DOI":"10.1007\/s11432-016-5539-3","volume":"59","author":"J Li","year":"2016","unstructured":"Li J, Chen X B, Sun X M, et al. Quantum network coding for multi-unicast problem based on 2D and 3D cluster states. Sci China Inf Sci, 2016, 59: 042301","journal-title":"Sci China Inf Sci"},{"key":"9190_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10948-014-2795-6","volume":"28","author":"M Mahdian","year":"2015","unstructured":"Mahdian M, Bayramzadeh R. Perfect K-pair quantum network coding using superconducting qubits. J Supercond Nov Magn, 2015, 28: 345\u2013348","journal-title":"J Supercond Nov Magn"},{"key":"9190_CR15","doi-asserted-by":"crossref","first-page":"3533","DOI":"10.1007\/s11128-015-1066-1","volume":"14","author":"T Shang","year":"2015","unstructured":"Shang T, Li J, Pei Z, et al. Quantum network coding for general repeater networks. Quantum Inf Process, 2015, 14: 3533\u20133552","journal-title":"Quantum Inf Process"},{"key":"9190_CR16","doi-asserted-by":"crossref","first-page":"4297","DOI":"10.1007\/s11128-015-1098-6","volume":"14","author":"G Xu","year":"2015","unstructured":"Xu G, Chen X-B, Li J, et al. Network coding for quantum cooperative multicast. Quantum Inf Process, 2015, 14: 4297\u20134322","journal-title":"Quantum Inf Process"},{"key":"9190_CR17","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1007\/s11128-015-1219-2","volume":"15","author":"T Shang","year":"2016","unstructured":"Shang T, Du G, Liu J-W. Opportunistic quantum network coding based on quantum teleportation. Quantum Inf Process, 2016, 15: 1743\u20131763","journal-title":"Quantum Inf Process"},{"key":"9190_CR18","first-page":"2686","volume-title":"Perfect quantum network communication protocol based on classical network coding","author":"H Kobayashi","year":"2010","unstructured":"Kobayashi H, Le Gall F, Nishimura H, et al. Perfect quantum network communication protocol based on classical network coding. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Austin, 2010. 2686\u20132690"},{"key":"9190_CR19","first-page":"109","volume-title":"Constructing quantum network coding schemes from classical nonlinear protocols","author":"H Kobayashi","year":"2011","unstructured":"Kobayashi H, Le Gall F, Nishimura H, et al. Constructing quantum network coding schemes from classical nonlinear protocols. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), St. Petersburg, 2011. 109\u2013113"},{"key":"9190_CR20","doi-asserted-by":"crossref","first-page":"032201","DOI":"10.1063\/1.3555801","volume":"52","author":"A Jain","year":"2011","unstructured":"Jain A, Franceschetti M, Meyer D A. On quantum network coding. J Math Phys, 2011, 52: 032201","journal-title":"J Math Phys"},{"key":"9190_CR21","doi-asserted-by":"crossref","first-page":"210502","DOI":"10.1103\/PhysRevLett.117.210502","volume":"117","author":"X-L Wang","year":"2016","unstructured":"Wang X-L, Chen L-K, Li W, et al. Experimental ten-photon entanglement. Phys Rev Lett, 2016, 117: 210502","journal-title":"Phys Rev Lett"},{"key":"9190_CR22","doi-asserted-by":"crossref","first-page":"3478","DOI":"10.1109\/TIT.2010.2048442","volume":"56","author":"D Leung","year":"2010","unstructured":"Leung D, Oppenheim J, Winter A. Quantum network communication: the butterfly and beyond. IEEE Trans Inf Theory, 2010, 56: 3478\u20133490","journal-title":"IEEE Trans Inf Theory"},{"key":"9190_CR23","first-page":"50","volume-title":"Quantum walks on graphs","author":"D Aharonov","year":"2001","unstructured":"Aharonov D, Ambainis A, Kempe J, et al. Quantum walks on graphs. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, Hersonissos, 2001. 50\u201359"},{"key":"9190_CR24","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A Ambainis","year":"2007","unstructured":"Ambainis A. Quantum walk algorithm for element distinctness. SIAM J Comput, 2007, 37: 210\u2013239","journal-title":"SIAM J Comput"},{"key":"9190_CR25","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/050643684","volume":"37","author":"F Magniez","year":"2007","unstructured":"Magniez F, Santha M, Szegedy M. Quantum algorithms for the triangle problem. SIAM J Comput, 2007, 37: 413\u2013424","journal-title":"SIAM J Comput"},{"key":"9190_CR26","doi-asserted-by":"crossref","first-page":"325302","DOI":"10.1088\/1751-8113\/47\/32\/325302","volume":"47","author":"D Tamascelli","year":"2014","unstructured":"Tamascelli D, Zanetti L. A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems. J Phys A-Math Theor, 2014, 47: 325302","journal-title":"J Phys A-Math Theor"},{"key":"9190_CR27","doi-asserted-by":"crossref","first-page":"052337","DOI":"10.1103\/PhysRevA.89.052337","volume":"89","author":"A M Childs","year":"2014","unstructured":"Childs A M, Ge Y M. Spatial search by continuous-time quantum walks on crystal lattices. Phys Rev A, 2014, 89: 052337","journal-title":"Phys Rev A"},{"key":"9190_CR28","doi-asserted-by":"crossref","first-page":"012339","DOI":"10.1103\/PhysRevA.90.012339","volume":"90","author":"A M Babatunde","year":"2014","unstructured":"Babatunde A M, Cresser J, Twamley J. Using a biased quantum random walk as a quantum lumped element router. Phys Rev A, 2014, 90: 012339","journal-title":"Phys Rev A"},{"key":"9190_CR29","doi-asserted-by":"crossref","first-page":"012331","DOI":"10.1103\/PhysRevA.90.012331","volume":"90","author":"X Zhan","year":"2014","unstructured":"Zhan X, Qin H, Bian Z-H, et al. Perfect state transfer and efficient quantum routing: a discrete-time quantum-walk approach. Phys Rev A, 2014, 90: 012331","journal-title":"Phys Rev A"},{"key":"9190_CR30","doi-asserted-by":"crossref","first-page":"225302","DOI":"10.1088\/1751-8113\/48\/22\/225302","volume":"48","author":"Yal\u00e7\u0131nkaya","year":"2015","unstructured":"Yal\u00e7\u0131nkaya \u0130, Gedik Z. Qubit state transfer via discrete-time quantum walks. J Phys A-Math Theor, 2015, 48: 225302","journal-title":"J Phys A-Math Theor"},{"key":"9190_CR31","doi-asserted-by":"crossref","first-page":"032310","DOI":"10.1103\/PhysRevA.65.032310","volume":"65","author":"B C Travaglione","year":"2002","unstructured":"Travaglione B C, Milburn G J. Implementing the quantum random walk. Phys Rev A, 2002, 65: 032310","journal-title":"Phys Rev A"},{"key":"9190_CR32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1088\/1367-2630\/5\/1\/383","volume":"5","author":"B Tregenna","year":"2003","unstructured":"Tregenna B, Flanagan W, Maile R, et al. Controlling discrete quantum walks: coins and initial states. New J Phys, 2003, 5: 83","journal-title":"New J Phys"},{"key":"9190_CR33","volume-title":"Quantum computation over the butterfly network","author":"A Soeda","year":"2011","unstructured":"Soeda A, Kinjo Y, Turner P S, et al. Quantum computation over the butterfly network. 2011. arXiv: 1010.4350v3"},{"key":"9190_CR34","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1166\/jctn.2013.3104","volume":"10","author":"P P Rohde","year":"2013","unstructured":"Rohde P P, Schreiber A, Stefanak M, et al. Increasing the dimensionality of quantum walks using multiple walkers. J Comput Theor Nano, 2013, 10: 1644\u20131652","journal-title":"J Comput Theor Nano"},{"key":"9190_CR35","doi-asserted-by":"crossref","first-page":"022312","DOI":"10.1103\/PhysRevA.68.022312","volume":"68","author":"R Raussendorf","year":"2003","unstructured":"Raussendorf R, Browne D E, Briegel H J. Measurement-based quantum computation on cluster states. Phys Rev A, 2003, 68: 022312","journal-title":"Phys Rev A"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-017-9190-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-017-9190-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-017-9190-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,9]],"date-time":"2018-01-09T05:15:24Z","timestamp":1515474924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-017-9190-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,5]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9190"],"URL":"https:\/\/doi.org\/10.1007\/s11432-017-9190-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,5]]},"article-number":"042501"}}