{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:53:26Z","timestamp":1725576806578},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180729"},{"type":"electronic","value":"9783642180736"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18073-6_6","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T11:07:19Z","timestamp":1295435239000},"page":"63-76","source":"Crossref","is-referenced-by-count":3,"title":["Testing Non-isometry Is QMA-Complete"],"prefix":"10.1007","author":[{"given":"Bill","family":"Rosgen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: 30th ACM Symposium on the Theory of Computing, pp. 20\u201330 (1998)","DOI":"10.1145\/276698.276708"},{"key":"6_CR2","unstructured":"Beigi, S., Shor, P.W.: On the complexity of computing zero-error and Holevo capacity of quantum channels (2007), arXiv:0709.2090v3 [quant-ph]"},{"issue":"16","key":"6_CR3","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Physical Review Letters\u00a087(16), 167902 (2001)","journal-title":"Physical Review Letters"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0024-3795(75)90075-0","volume":"10","author":"M.-D. Choi","year":"1975","unstructured":"Choi, M.-D.: Completely positive linear maps on complex matrices. Linear Algebra and its Applications\u00a010(3), 285\u2013290 (1975)","journal-title":"Linear Algebra and its Applications"},{"issue":"21","key":"6_CR5","doi-asserted-by":"publisher","first-page":"217901","DOI":"10.1103\/PhysRevLett.88.217901","volume":"88","author":"A.K. Ekert","year":"2002","unstructured":"Ekert, A.K., Alves, C.M., Oi, D.K., Horodecki, M., Horodecki, P., Kwek, L.C.: Direct estimations of linear and nonlinear functionals of a quantum state. Physical Review Letters\u00a088(21), 217901 (2002)","journal-title":"Physical Review Letters"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1142\/S0219749905001067","volume":"3","author":"D. Janzing","year":"2005","unstructured":"Janzing, D., Wocjan, P., Beth, T.: \u201cNon-identity-check\u201d is QMA-complete. International Journal of Quantum Information\u00a03(3), 463\u2013473 (2005)","journal-title":"International Journal of Quantum Information"},{"key":"6_CR7","unstructured":"Ji, Z., Wu, X.: Non-identity check remains QMA-complete for short circuits (2009), arXiv:0906.5416 [quant-ph]"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1137\/S0097539704445226","volume":"35","author":"J. Kempe","year":"2006","unstructured":"Kempe, J., Kitaev, A., Regev, O.: The complexity of the local Hamiltonian problem. SIAM Journal on Computing\u00a035(5), 1070\u20131097 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR9","unstructured":"Kitaev, A.Y.: Quantum NP. Talk at the 2nd Workshop on Algorithms in Quantum Information Processing (AQIP), DePaul University (1999)"},{"key":"6_CR10","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/047","volume-title":"Classical and Quantum Computation","author":"A.Y. Kitaev","year":"2002","unstructured":"Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics, vol.\u00a047. American Mathematical Society, Providence (2002)"},{"key":"6_CR11","unstructured":"Knill, E.: Quantum randomness and nondeterminism. Tech. Rep. LAUR-96-2186, Los Alamos National Laboratory (1996)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/11830924_40","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y.K. Liu","year":"2006","unstructured":"Liu, Y.K.: Consistency of local density matrices is QMA-complete. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 438\u2013449. Springer, Heidelberg (2006)"},{"issue":"11","key":"6_CR13","doi-asserted-by":"publisher","first-page":"110503","DOI":"10.1103\/PhysRevLett.98.110503","volume":"98","author":"Y.-K. Liu","year":"2007","unstructured":"Liu, Y.-K., Christandl, M., Verstraete, F.: Quantum computational complexity of the N-representability problem: QMA complete. Physical Review Letters\u00a098(11), 110503 (2007)","journal-title":"Physical Review Letters"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s00037-005-0194-x","volume":"14","author":"C. Marriott","year":"2005","unstructured":"Marriott, C., Watrous, J.: Quantum Arthur-Merlin games. Computational Complexity\u00a014(2), 122\u2013152 (2005)","journal-title":"Computational Complexity"},{"key":"6_CR15","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"25","key":"6_CR16","doi-asserted-by":"publisher","first-page":"250501","DOI":"10.1103\/PhysRevLett.100.250501","volume":"100","author":"N. Schuch","year":"2008","unstructured":"Schuch, N., Cirac, I., Verstraete, F.: Computational difficulty of finding matrix product ground states. Physical Review Letters\u00a0100(25), 250501 (2008)","journal-title":"Physical Review Letters"},{"issue":"10","key":"6_CR17","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1038\/nphys1370","volume":"5","author":"N. Schuch","year":"2009","unstructured":"Schuch, N., Verstraete, F.: Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nature Physics\u00a05(10), 732\u2013735 (2009)","journal-title":"Nature Physics"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Succinct quantum proofs for properties of finite groups. In: 41st IEEE Symposium on Foundations of Computer Science, pp. 537\u2013546 (2000)","DOI":"10.1109\/SFCS.2000.892141"},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"40501","DOI":"10.1103\/PhysRevLett.104.040501","volume":"104","author":"T.-C. Wei","year":"2010","unstructured":"Wei, T.-C., Mosca, M., Nayak, A.: Interacting boson problems can be QMA hard. Physical Review Letters\u00a0104(4), 40501 (2010)","journal-title":"Physical Review Letters"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"12315","DOI":"10.1103\/PhysRevA.70.012315","volume":"70","author":"P. Zanardi","year":"2004","unstructured":"Zanardi, P., Lidar, D.A.: Purity and state fidelity of quantum channels. Physical Review A\u00a070(1), 012315 (2004)","journal-title":"Physical Review A"}],"container-title":["Lecture Notes in Computer Science","Theory of Quantum Computation, Communication, and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18073-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T23:00:17Z","timestamp":1553382017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18073-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180729","9783642180736"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18073-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}