{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:12Z","timestamp":1740136152245,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T00:00:00Z","timestamp":1233705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s11047-009-9112-5","type":"journal-article","created":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T18:07:55Z","timestamp":1233684475000},"page":"539-546","source":"Crossref","is-referenced-by-count":3,"title":["On the solution of trivalent decision problems by quantum state identification"],"prefix":"10.1007","volume":"8","author":[{"given":"Karl","family":"Svozil","sequence":"first","affiliation":[]},{"given":"Josef","family":"Tkadlec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,4]]},"reference":[{"key":"9112_CR1","doi-asserted-by":"crossref","unstructured":"Beals R, Buhrman H, Cleve R, Mosca M, de Wolf R (2001) Quantum lower bounds by polynomials. J ACM 48:778\u2013797. http:\/\/dx.doi.org\/10.1145\/502090.502097","DOI":"10.1145\/502090.502097"},{"key":"9112_CR2","doi-asserted-by":"crossref","unstructured":"Bennett CH, Bernstein E, Brassard G, Vazirani U (1997) Strengths and weaknesses of quantum computing. SIAM J Comput 26:1510\u20131523. http:\/\/dx.doi.org\/10.1137\/S0097539796300933","DOI":"10.1137\/S0097539796300933"},{"key":"9112_CR3","first-page":"647","volume":"49","author":"\u010c Brukner","year":"1999","unstructured":"Brukner \u010c, Zeilinger A (1999a) Malus\u2019 law and quantum information. Acta Physica Slovaca 49:647\u2013652","journal-title":"Acta Physica Slovaca"},{"key":"9112_CR4","doi-asserted-by":"crossref","first-page":"3354","DOI":"10.1103\/PhysRevLett.83.3354","volume":"83","author":"\u010c Brukner","year":"1999","unstructured":"Brukner \u010c, Zeilinger A (1999b) Operationally invariant information in quantum mechanics. Phys Rev Lett 83:3354\u20133357","journal-title":"Phys Rev Lett"},{"key":"9112_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-662-10557-3_21","volume-title":"Time, quantum and information","author":"\u010c Brukner","year":"2003","unstructured":"Brukner \u010c, Zeilinger A (2003) Information and fundamental elements of the structure of quantum theory. In: Castell L, Ischebek O (eds) Time, quantum and information, Springer, Berlin, pp 323\u2013355"},{"key":"9112_CR6","unstructured":"Brukner \u010c, Zukowski M, Zeilinger A (2002) The essence of entanglement. Translated to Chinese by Qiang Zhang and Yond-de Zhang, New advances in physics (J Chin Phys Soc). http:\/\/xxx.lanl.gov\/abs\/quant-ph\/0106119"},{"key":"9112_CR7","unstructured":"Cleve R (2000) An introduction to quantum complexity theory. In: Macchiavello C, Palma G, Zeilinger A (eds) Collected papers on quantum computation and quantum information theory. World Scientific, Singapore, pp 103\u2013127"},{"key":"9112_CR8","doi-asserted-by":"crossref","unstructured":"Cleve R, Ekert A, Macchiavello C, Mosca M (1998) Rapid solution of problems by quantum computation. Proc R Soc A Math Phys Eng Sci 454:339\u2013354. http:\/\/dx.doi.org\/10.1098\/rspa.1998.0164","DOI":"10.1098\/rspa.1998.0164"},{"key":"9112_CR9","doi-asserted-by":"crossref","unstructured":"Deutsch D (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proc R Soc Lond Ser A Math Phys (1934\u20131990) 400:97\u2013117. http:\/\/dx.doi.org\/10.1098\/rspa.1985.0070","DOI":"10.1098\/rspa.1985.0070"},{"key":"9112_CR10","doi-asserted-by":"crossref","unstructured":"Deutsch D, Jozsa R (1992) Rapid solution of problems by quantum computation. Proc R Soc Math Phys Sci (1990\u20131995) 439:553\u2013558. http:\/\/dx.doi.org\/10.1098\/rspa.1992.0167","DOI":"10.1098\/rspa.1992.0167"},{"key":"9112_CR11","doi-asserted-by":"crossref","unstructured":"Donath N, Svozil K (2002) Finding a state among a complete set of orthogonal ones. Phys Rev A (Atomic, Molecular, and Optical Physics) 65:044 302. http:\/\/dx.doi.org\/10.1103\/PhysRevA.65.044302","DOI":"10.1103\/PhysRevA.65.044302"},{"key":"9112_CR12","doi-asserted-by":"crossref","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (1998) Limit on the speed of quantum computation in determining parity. Phys Rev Lett 81:5442\u20135444. http:\/\/dx.doi.org\/10.1103\/PhysRevLett.81.5442","DOI":"10.1103\/PhysRevLett.81.5442"},{"key":"9112_CR13","unstructured":"Fortnow L (2003) One complexity theorist\u2019s view of quantum computing. Theor Comput Sci 292:597\u2013610. http:\/\/dx.doi.org\/10.1016\/S0304-3975(01 )00377-2"},{"key":"9112_CR14","volume-title":"Quantum computing","author":"J Gruska","year":"1999","unstructured":"Gruska J (1999) Quantum computing. McGraw-Hill, London"},{"key":"9112_CR15","doi-asserted-by":"crossref","unstructured":"Mermin ND (2003) From Cbits to Qbits: teaching computer scientists quantum mechanics. Am J Phys 71:23\u201330. http:\/\/dx.doi.org\/10.1119\/1.1522741","DOI":"10.1119\/1.1522741"},{"key":"9112_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813870","volume-title":"Quantum computer science","author":"ND Mermin","year":"2007","unstructured":"Mermin ND (2007) Quantum computer science. Cambridge University Press, Cambridge"},{"key":"9112_CR17","unstructured":"Miao X (2001) A polynomial-time solution to the parity problem on an NMR quantum computer. eprint: arXiv: quant-ph\/0108116"},{"key":"9112_CR18","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen MA, Chuang IL (2000) Quantum computation and quantum information. Cambridge University Press, Cambridge"},{"key":"9112_CR19","volume-title":"Classical recursion theory, vol 1","author":"P Odifreddi","year":"1989","unstructured":"Odifreddi P (1989) Classical recursion theory, vol 1. North-Holland, Amsterdam"},{"key":"9112_CR20","doi-asserted-by":"crossref","unstructured":"Orus R, Latorre JI, Martin-Delgado MA (2004) Systematic analysis of majorization in quantum algorithms. Eur Phys J D 29:119\u2013132. http:\/\/dx.doi.org\/10.1140\/epjd\/e2004-00009-3","DOI":"10.1140\/epjd\/e2004-00009-3"},{"key":"9112_CR21","doi-asserted-by":"crossref","unstructured":"Ozhigov Y (1998) Quantum computer can not speed up iterated applications of a black box. Lect Notes Comput Sci 1509:152\u2013159. http:\/\/dx.doi.org\/10.1007\/3-540-49208-9","DOI":"10.1007\/3-540-49208-9"},{"key":"9112_CR22","volume-title":"Theory of recursive functions and effective computability","author":"H Rogers Jr","year":"1967","unstructured":"Rogers H Jr (1967) Theory of recursive functions and effective computability. McGraw-Hill, New York"},{"key":"9112_CR23","doi-asserted-by":"crossref","unstructured":"Stadelhofer R, Suterand D, Banzhaf W (2005) Quantum and classical parallelism in parity algorithms for ensemble quantum computers. Phys Rev A (Atomic, Molecular, and Optical Physics) 71:032345. http:\/\/dx.doi.org\/10.1103\/PhysRevA.71.032345","DOI":"10.1103\/PhysRevA.71.032345"},{"key":"9112_CR24","doi-asserted-by":"crossref","unstructured":"Svozil K (2006) Characterization of quantum computable decision problems by state discrimination. In: Adenier G, Khrennikov A, Nieuwenhuizen TM (eds) Quantum theory: reconsideration of foundations\u20133, vol 810, pp 271\u2013279. http:\/\/link.aip.org\/link\/?APC\/810\/271\/1","DOI":"10.1063\/1.2158729"},{"key":"9112_CR25","doi-asserted-by":"crossref","unstructured":"Svozil K (2002) Quantum information in base n defined by state partitions. Phys Rev A (Atomic, Molecular, and Optical Physics) 66:044306. http:\/\/dx.doi.org\/10.1103\/PhysRevA.66.044306","DOI":"10.1103\/PhysRevA.66.044306"},{"key":"9112_CR26","doi-asserted-by":"crossref","unstructured":"Svozil K (2004) Quantum information via state partitions and the context translation principle. J Mod Opt 51:811\u2013819. http:\/\/dx.doi.org\/10.1080\/09500340410001664179","DOI":"10.1080\/09500340410001664179"},{"key":"9112_CR27","doi-asserted-by":"crossref","unstructured":"Zeilinger A (1999) A foundational principle for quantum mechanics. Found Phys 29:631\u2013643. http:\/\/dx.doi.org\/10.1023\/A:1018820410908","DOI":"10.1023\/A:1018820410908"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9112-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-009-9112-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9112-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T10:54:43Z","timestamp":1738925683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-009-9112-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,4]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9112"],"URL":"https:\/\/doi.org\/10.1007\/s11047-009-9112-5","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2009,2,4]]}}}