{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:51:05Z","timestamp":1776955865795,"version":"3.51.4"},"reference-count":18,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181967","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"429-438","source":"Crossref","is-referenced-by-count":32,"title":["Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states"],"prefix":"10.1109","author":[{"given":"R.","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380786"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1577"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"ref13","author":"nielsen","year":"2000","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0222016"},{"key":"ref15","author":"osborne","year":"1994","journal-title":"A Course in Game Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1731"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90069-2"},{"key":"ref18","first-page":"352","article-title":"Quantum circuit complexity","author":"yao","year":"1993","journal-title":"Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001595"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90037-X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.761271"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02228997"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335396"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/09500349414552171"},{"key":"ref2","first-page":"61","article-title":"Quantum entanglement and the communication complexity of the inner product function","volume":"1509","author":"cleve wim van dam","year":"1998","journal-title":"Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications Lecture Notes in Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45841-7_27"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","acronym":"SFCS-02"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181967.pdf?arnumber=1181967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T23:38:38Z","timestamp":1640216318000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181967","relation":{},"subject":[]}}