{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T05:22:32Z","timestamp":1751347352289,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T00:00:00Z","timestamp":1502496000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003945","name":"Link\u00f6ping University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003945","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s11128-017-1679-7","type":"journal-article","created":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T01:03:10Z","timestamp":1502499790000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Efficient classical simulation of the Deutsch\u2013Jozsa and Simon\u2019s algorithms"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5888-1291","authenticated-orcid":false,"given":"Niklas","family":"Johansson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1082-8325","authenticated-orcid":false,"given":"Jan-\u00c5ke","family":"Larsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,12]]},"reference":[{"key":"1679_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"Richard P Feynman","year":"1982","unstructured":"Feynman, Richard P.: Simulating physics with computers. Int. J. Theor. Phys. 21, 467\u2013488 (1982). doi:\n                        10.1007\/BF02650179","journal-title":"Int. J. Theor. Phys."},{"key":"1679_CR2","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1103\/PhysRev.47.777","volume":"47","author":"A Einstein","year":"1935","unstructured":"Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 47, 777\u2013780 (1935). doi:\n                        10.1103\/PhysRev.47.777","journal-title":"Phys. Rev."},{"key":"1679_CR3","unstructured":"Bell, J.S.: On the Einstein\u2013Podolsky\u2013Rosen paradox. In: Physics (Long Island City, NY.) 1, pp. 195\u2013200 (1964). \n                        http:\/\/philoscience.unibe.ch\/documents\/TexteHS10\/bell1964epr.pdf"},{"key":"1679_CR4","first-page":"59","volume":"17","author":"S Kochen","year":"1967","unstructured":"Kochen, S., Specker, E.P.: The problem of hidden variables in quantum mechanics. J. Math. Mech. 17, 59\u201387 (1967)","journal-title":"J. Math. Mech."},{"key":"1679_CR5","doi-asserted-by":"publisher","first-page":"113011","DOI":"10.1088\/1367-2630\/13\/11\/113011","volume":"13","author":"M Kleinmann","year":"2011","unstructured":"Kleinmann, M., G\u00fchne, O., Portillo, J.R., Larsson, J.-\u00c5., Cabello, A.: Memory cost of quantum contextuality. New J. Phys. 13, 113011 (2011). doi:\n                        10.1088\/1367-2630\/13\/11\/113011","journal-title":"New J. Phys."},{"key":"1679_CR6","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1038\/nature13460","volume":"510","author":"Mark Howard","year":"2014","unstructured":"Howard, Mark, et al.: Contextuality supplies the magic for quantum computation. Nature 510, 351\u2013355 (2014). doi:\n                        10.1038\/nature13460","journal-title":"Nature"},{"key":"1679_CR7","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Fault-tolerant quantum computation. In: Proceedings of 37th Annual Symposium on Foundations of Computer Science, pp. 56-65 (1996). doi:\n                        10.1109\/SFCS.1996.548464","DOI":"10.1109\/SFCS.1996.548464"},{"key":"1679_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church\u2013Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400, 97\u2013117 (1985). doi:\n                        10.1098\/rspa.1985.0070","journal-title":"Proc. R. Soc. Lond. A"},{"key":"1679_CR9","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"David Deutsch","year":"1992","unstructured":"Deutsch, David, Jozsa, Richard: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439, 553\u2013558 (1992). doi:\n                        10.1098\/rspa.1992.0167","journal-title":"Proc. R. Soc. Lond. A"},{"key":"1679_CR10","doi-asserted-by":"publisher","unstructured":"Simon, D.R.: On the power of quantum computation. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 116\u2013123 (1994). doi:\n                        10.1109\/SFCS.1994.365701","DOI":"10.1109\/SFCS.1994.365701"},{"key":"1679_CR11","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"D Simon","year":"1997","unstructured":"Simon, D.: On the power of quantum computation. SIAM J. Comput. 26, 1474\u20131483 (1997). doi:\n                        10.1137\/S0097539796298637","journal-title":"SIAM J. Comput."},{"key":"1679_CR12","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 . IEEE Computer Society Press, Santa Fe, NM (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1679_CR13","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1098\/rspa.1998.0164","volume":"454","author":"R Cleve","year":"1998","unstructured":"Cleve, R., et al.: Quantum algorithms revisited. Proc. R. Soc. Lond. A 454, 339\u2013354 (1998). doi:\n                        10.1098\/rspa.1998.0164","journal-title":"Proc. R. Soc. Lond. A"},{"key":"1679_CR14","unstructured":"Nielsen, Michael A., Chuang, Isaac L.: Quantum computation and quantum information. 10th Anniversary Ed. Cambridge University Press, New York, USA (2011). ISBN: 1107002176"},{"key":"1679_CR15","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26, 1411\u20131473 (1997). doi:\n                        10.1137\/S0097539796300921","journal-title":"SIAM J. Comput."},{"key":"1679_CR16","doi-asserted-by":"publisher","first-page":"032110","DOI":"10.1103\/PhysRevA.75.032110","volume":"75","author":"Robert W Spekkens","year":"2007","unstructured":"Spekkens, Robert W.: Evidence for the epistemic view of quantum states: a toy theory. Phys. Rev. A 75, 032110 (2007). doi:\n                        10.1103\/PhysRevA.75.032110","journal-title":"Phys. Rev. A"},{"key":"1679_CR17","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s10701-012-9639-7","volume":"42","author":"Matthew F Pusey","year":"2012","unstructured":"Pusey, Matthew F.: Stabilizer notation for Spekkens\u2019 toy theory. Found. Phys. 42, 688\u2013708 (2012). doi:\n                        10.1007\/s10701-012-9639-7","journal-title":"Found. Phys."},{"key":"1679_CR18","doi-asserted-by":"publisher","first-page":"R1633","DOI":"10.1103\/PhysRevA.58.R1633","volume":"58","author":"David Collins","year":"1998","unstructured":"Collins, David, Kim, K.W., Holton, W.C.: Deutsch\u2013Jozsa algorithm as a test of quantum computation. Phys. Rev. A 58, R1633\u2013R1636 (1998). doi:\n                        10.1103\/PhysRevA.58.R1633","journal-title":"Phys. Rev. A"},{"key":"1679_CR19","unstructured":"Gottesman, D.: The Heisenberg representation of quantum computers. (1998). \n                        arXiv:quant-ph\/9807006"},{"key":"1679_CR20","unstructured":"Johansson, N.: Efficient simulation of Deutsch\u2013Jozsa algorithm. Link\u00f6ping University, The Institute of Technology, 2015. isrn: LiTHIFM- A-EX\u201315\/2992\u2013SE"},{"key":"1679_CR21","doi-asserted-by":"publisher","first-page":"200501","DOI":"10.1103\/PhysRevLett.113.200501","volume":"113","author":"MS Tame","year":"2014","unstructured":"Tame, M.S., et al.: Experimental realization of a one-way quantum computer algorithm solving Simon\u2019s problem. Phys. Rev. Lett. 113, 200501 (2014). doi:\n                        10.1103\/PhysRevLett.113.200501","journal-title":"Phys. Rev. Lett."},{"key":"1679_CR22","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973). doi:\n                        10.1147\/rd.176.0525","journal-title":"IBM J. Res. Dev."},{"key":"1679_CR23","unstructured":"Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for Simon\u2019s problem. In: IEEE Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems 1999, pp. 12\u201323 (1997). \n                        http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=595153"},{"key":"1679_CR24","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00037-003-0181-z","volume":"12","author":"T Mihara","year":"2003","unstructured":"Mihara, T., Sung, S.C.: Deterministic polynomial-time quantum algorithms for Simon\u2019s problem. Comput. Complex. 12, 162\u2013175 (2003). doi:\n                        10.1007\/s00037-003-0181-z","journal-title":"Comput. Complex."},{"key":"1679_CR25","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing. STOC \u201996. New York, NY, USA: ACM, pp. 212\u2013219 (1996). doi:\n                        10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"1679_CR26","doi-asserted-by":"publisher","unstructured":"Fan, Yale.: A generalization of the Deutsch\u2013Jozsa algorithm to multi-valued quantum logic. In: IEEE 44th International Symposium on Multiple-Valued Logic. Vol. 0. Los Alamitos, CA, USA: IEEE Computer Society, p. 12. (2007). doi:\n                        10.1109\/ISMVL.2007.3","DOI":"10.1109\/ISMVL.2007.3"},{"key":"1679_CR27","unstructured":"Alagic, G., Moore, C., Russell, A.: Quantum algorithms for Simon\u2019s problem over general groups. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201907. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, pp. 1217\u20131224 (2007). isbn: 978-0-89871-624-5. \n                        http:\/\/dl.acm.org\/citation.cfmid=1283383.1283514"},{"key":"1679_CR28","unstructured":"Oracular Quantum algorithms, Quantum Algorithm Zoo. \n                        http:\/\/math.nist.gov\/quantum\/zoo\/#oracular.20"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-017-1679-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-017-1679-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-017-1679-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T01:13:17Z","timestamp":1503450797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-017-1679-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,12]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1679"],"URL":"https:\/\/doi.org\/10.1007\/s11128-017-1679-7","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2017,8,12]]},"article-number":"233"}}