{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T17:09:32Z","timestamp":1746551372290,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_50","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"605-616","source":"Crossref","is-referenced-by-count":10,"title":["Quantum Interactive Proofs with Competing Provers"],"prefix":"10.1007","author":[{"given":"Gus","family":"Gutoski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Watrous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018, 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"key":"50_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences\u00a036, 254\u2013276 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: how to remove intractability assumptions. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 113\u2013131 (1988)","DOI":"10.1145\/62212.62223"},{"key":"50_CR5","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J. Reif","year":"1984","unstructured":"Reif, J.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences\u00a029, 274\u2013301 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/0-387-34799-2_22","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A., Tennenholtz, M.: The noisy oracle problem. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 284\u2013296. Springer, Heidelberg (1990)"},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0022-0000(92)90021-A","volume":"44","author":"U. Feige","year":"1992","unstructured":"Feige, U., Shamir, A.: Multi-oracle interactive protocols with constant space verifiers. Journal of Computer and System Sciences\u00a044, 259\u2013271 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/0899-8256(92)90035-Q","volume":"4","author":"D. Koller","year":"1992","unstructured":"Koller, D., Megiddo, N.: The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior\u00a04, 528\u2013552 (1992)","journal-title":"Games and Economic Behavior"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Koller, D., Shor, P.: A game-theoretic classification of interactive complexity classes. In: Proceedings of the 10th Conference on Structure in Complexity Theory, pp. 227\u2013237 (1995)","DOI":"10.1109\/SCT.1995.514861"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J.: Making games short. In: Proceedings of the Twenty-Ninth annual ACM Symposium on Theory of Computing, pp. 506\u2013516 (1997)","DOI":"10.1145\/258533.258644"},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C. Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the ACM\u00a039, 859\u2013868 (1992)","journal-title":"Journal of the ACM"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. Journal of the ACM\u00a039, 869\u2013877 (1992)","journal-title":"Journal of the ACM"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1145\/146585.146613","volume":"39","author":"A. Shen","year":"1992","unstructured":"Shen, A.: IP = PSPACE: simplified proof. Journal of the ACM\u00a039, 878\u2013880 (1992)","journal-title":"Journal of the ACM"},{"key":"50_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/S0304-3975(01)00375-9","volume":"292","author":"J. Watrous","year":"2003","unstructured":"Watrous, J.: PSPACE has constant-round quantum interactive proof systems. Theoretical Computer Science\u00a0292, 575\u2013588 (2003)","journal-title":"Theoretical Computer Science"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Kitaev, A., Watrous, J.: Parallelization, amplification, and exponential time simulation of quantum interactive proof system. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 608\u2013617 (2000)","DOI":"10.1145\/335305.335387"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 20\u201330 (1998)","DOI":"10.1145\/276698.276708"},{"key":"50_CR17","unstructured":"Rosgen, B., Watrous, J.: On the hardness of distinguishing mixed-state quantum computations (2004), arXiv.org e-Print cs.CC\/0407056"},{"key":"50_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R. Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, Heidelberg (1997)"},{"key":"50_CR19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"50_CR20","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/18.761271","volume":"45","author":"C. Fuchs","year":"1999","unstructured":"Fuchs, C., van de Graaf, J.: Cryptographic distinguishability measures for quantum-mechanical states. IEEE Transactions on Information Theory\u00a045, 1216\u20131227 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"50_CR21","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM Journal of Computing\u00a027, 763\u2013803 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"50_CR22","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/047","volume-title":"Classical and Quantum Computation","author":"A. Kitaev","year":"2002","unstructured":"Kitaev, A., Shen, A., Vyalyi, M.: Classical and Quantum Computation. Graduate Studies in Mathematics, vol.\u00a047. American Mathematical Society, Providence (2002)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:09:47Z","timestamp":1739920187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}