{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:19:36Z","timestamp":1756462776002},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T00:00:00Z","timestamp":1318982400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00037-011-0016-2","type":"journal-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T05:48:35Z","timestamp":1318916915000},"page":"499-510","source":"Crossref","is-referenced-by-count":4,"title":["A Quantum Characterization Of NP"],"prefix":"10.1007","volume":"21","author":[{"given":"Hugue","family":"Blier","sequence":"first","affiliation":[]},{"given":"Alain","family":"Tapp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,19]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"S. Aaronson, S. Beigi, A. Drucker, B. Fefferman & P. Shor (2008). The Power of Unentanglement. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 223\u2013236","DOI":"10.1109\/CCC.2008.5"},{"key":"16_CR2","first-page":"13","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh F. (1995) Interior point methods in semidefinite programming with applications to combinatorial optimization. Proceedings of SIAM Journal on Optimization 5: 13\u201351","journal-title":"Interior point methods in semidefinite programming with applications to combinatorial optimization. Proceedings of SIAM Journal on Optimization"},{"key":"16_CR3","unstructured":"S. Beigi (2008). NP vs QMA log(2). Technical notes arXiv:0810.5109v1 [quant-ph]."},{"key":"16_CR4","unstructured":"H. Blier & A. Tapp (2007). All languages in NP have very short quantum proofs. Technical notes arXiv:0709,0738v1 [quant-ph]."},{"key":"16_CR5","unstructured":"H. Blier & A. Tapp (2008). All languages in NP have very short quantum proofs. In Proceedings of The Third International Conference on Quantum, Nano and Micro Technologies."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Harry Buhrman, Richard Cleve, John Watrous & Ronald de Wolf (2001). Quantum fingerprinting. In Phys. Rev. Lett. 87, 167902 (2001), volume 87.","DOI":"10.1103\/PhysRevLett.87.167902"},{"key":"16_CR7","unstructured":"A. Kitaev & J. Watrous (2000). Parallelization, Amplification, and Exponential Time Simulation of Quantum Interactive Proof Systems. In Proceedings ACM Symposium on Theory of Computing, 608\u2013617."},{"key":"16_CR8","unstructured":"C. Marriott & J. Watrous (2004). Quantum Arthur-Merlin games. In Proceedings of the IEEE Conference on Computational Complexity, volume 14, 122\u2013152."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"1","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe L., Boyd S. (1996) Semidefinite programming. SIAM Review 1: 49\u201395","journal-title":"SIAM Review"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"J. Watrous (2000). Succinct quantum proofs for properties of finite groups. In Proceedings of Symposium on Foundations of Computer Science, 537\u2013546.","DOI":"10.1109\/SFCS.2000.892141"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-011-0016-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-011-0016-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-011-0016-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T21:25:44Z","timestamp":1560806744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-011-0016-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,19]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s00037-011-0016-2","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,19]]}}}