{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:19:06Z","timestamp":1745986746129,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642356551"},{"type":"electronic","value":"9783642356568"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35656-8_6","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:14:11Z","timestamp":1357298051000},"page":"74-86","source":"Crossref","is-referenced-by-count":2,"title":["Testing Quantum Circuits and Detecting Insecure Encryption"],"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: Proc. 30th STOC, pp. 20\u201330 (1998)","DOI":"10.1145\/276698.276708"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Mosca, M., Tapp, A., de Wolf, R.: Private quantum channels. In: Proc. 41st FOCS, pp. 547\u2013553 (2000)","DOI":"10.1109\/SFCS.2000.892142"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-27821-4_23","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Smith, A.: Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 249\u2013260. Springer, Heidelberg (2004)"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"42317","DOI":"10.1103\/PhysRevA.67.042317","volume":"67","author":"P.O. Boykin","year":"2003","unstructured":"Boykin, P.O., Roychowdhury, V.: Optimal encryption of quantum bits. Phys. Rev. A\u00a067(4), 042317 (2003)","journal-title":"Phys. Rev. A"},{"key":"6_CR5","unstructured":"Braunstein, S., Lo, H.K., Spiller, T.: Forgetting qubits is hot to do (1999) (unpublished manuscript)"},{"issue":"16","key":"6_CR6","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. Phys. Rev. Lett.\u00a087(16), 167902 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"21","key":"6_CR7","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. Phys. Rev. Lett.\u00a088(21), 217901 (2002)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00220-004-1087-6","volume":"250","author":"P. Hayden","year":"2004","unstructured":"Hayden, P., Leung, D., Shor, P.W., Winter, A.: Randomizing quantum states: constructions and applications. Commun. Math. Phys.\u00a0250, 371\u2013391 (2004)","journal-title":"Commun. Math. Phys."},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/S0019-9958(67)90302-6","volume":"10","author":"C.W. Helstrom","year":"1967","unstructured":"Helstrom, C.W.: Detection theory and quantum mechanics. Inform. Control\u00a010(3), 254\u2013291 (1967)","journal-title":"Inform. Control"},{"issue":"3","key":"6_CR10","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. Int. J. Quantum Inf.\u00a03(3), 463\u2013473 (2005)","journal-title":"Int. J. Quantum Inf."},{"issue":"5","key":"6_CR11","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 J. Comput.\u00a035(5), 1070\u20131097 (2006)","journal-title":"SIAM J. Comput."},{"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":"2","key":"6_CR13","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. Comp. Compl.\u00a014(2), 122\u2013152 (2005)","journal-title":"Comp. Compl."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Rosgen, B., Watrous, J.: On the hardness of distinguishing mixed-state quantum computations. In: Proc. 20th CCC, pp. 344\u2013354 (2005)","DOI":"10.1109\/CCC.2005.21"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-18073-6_6","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"B. Rosgen","year":"2011","unstructured":"Rosgen, B.: Testing Non-isometry Is QMA-Complete. In: van Dam, W., Kendon, V.M., Severini, S. (eds.) TQC 2010. LNCS, vol.\u00a06519, pp. 63\u201376. Springer, Heidelberg (2011)"},{"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. Phys. Rev. Lett.\u00a0100(25), 250501 (2008)","journal-title":"Phys. Rev. Lett."},{"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. Nat. Phys.\u00a05(10), 732\u2013735 (2009)","journal-title":"Nat. Phys."},{"issue":"7","key":"6_CR18","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1109\/18.796385","volume":"45","author":"A. Winter","year":"1999","unstructured":"Winter, A.: Coding theorem and strong converse for quantum channels. IEEE T. Inform. Theory\u00a045(7), 2481\u20132485 (1999)","journal-title":"IEEE T. Inform. Theory"}],"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-35656-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:34Z","timestamp":1745942434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35656-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642356551","9783642356568"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35656-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}