{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:07:34Z","timestamp":1774991254934,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541586","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1685-1689","source":"Crossref","is-referenced-by-count":1,"title":["Quantum capacities for entanglement networks"],"prefix":"10.1109","author":[{"given":"Shawn X","family":"Cui","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of California, Santa Barbara, 93106, USA"}]},{"given":"Zhengfeng","family":"Ji","sequence":"additional","affiliation":[{"name":"Centre for Quantum Computation & Intelligent Systems, School of Software, Faculty of Engineering and Information Technology, University of Technology, Sydney, NSW 2007, Australia"}]},{"given":"Nengkun","family":"Yu","sequence":"additional","affiliation":[{"name":"Institute for Quantum Computing, University of Waterloo, Ontario, N2L 3G1, Canada"}]},{"given":"Bei","family":"Zeng","sequence":"additional","affiliation":[{"name":"Institute for Quantum Computing, University of Waterloo, Ontario, N2L 3G1, Canada"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_52"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048442"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1063\/1.3555801"},{"key":"ref13","article-title":"Tensor network states","author":"bauer","year":"2011"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref15","first-page":"117","article-title":"4.5. Combinatorial implications of max-flow min-cut theorem, 4.6. Linear programming interpretation of max-flow min-cut theorem","author":"lawler","year":"2001","journal-title":"Combinatorial Optimization Networks and Matroids"},{"key":"ref16","author":"papadimitriou","year":"1982","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref17","author":"vazirani","year":"2013","journal-title":"12 Introduction to LP-Duality in Approximation algorithms"},{"key":"ref18","article-title":"Quantum linear network coding as one-way quantum computation","author":"de beaudrap","year":"0","journal-title":"arXiv preprint arXiv 1403 3533 2014"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_52"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.82.1209"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032331"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.181602"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1063\/1.4954231"},{"key":"ref8","article-title":"Holographic duality from random tensor networks","author":"hayden","year":"2016","journal-title":"arXiv 1601 01694"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/JHEP12(2014)162"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature07127"},{"key":"ref9","first-page":"331","article-title":"Quantum network coding and the current status of its studies","author":"nishimura","year":"2014","journal-title":"Information Theory and its Applications (ISITA) 2014 InternationalSymposium on"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.81.5932"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513644"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/14789940801912366"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033701"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.052317"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.062314"},{"key":"ref26","article-title":"The asymptotics of quantum max-flow min-cut","author":"hastings","year":"0","journal-title":"arXiv preprint arXiv 1603 09707 2016"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.052315"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541586.pdf?arnumber=7541586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:54:10Z","timestamp":1774986850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541586\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541586","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}