{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T22:31:31Z","timestamp":1774996291849,"version":"3.50.1"},"reference-count":77,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T00:00:00Z","timestamp":1565827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the advantage of quantum algorithms. We do so by using a simulation framework, Quantum Simulation Logic (QSL), to construct oracles and algorithms that solve some problems with the same success probability and number of queries as the quantum algorithms. The framework can be simulated using only classical resources at a constant overhead as compared to the quantum resources used in quantum computation. Our results clarify the assumptions made and the conditions needed when using quantum oracles. Using the same assumptions on oracles within the simulation framework we show that for some specific algorithms, such as the Deutsch-Jozsa and Simon\u2019s algorithms, there simply is no advantage in terms of query complexity. This does not detract from the fact that quantum query complexity provides examples of how a quantum computer can be expected to behave, which in turn has proved useful for finding new quantum algorithms outside of the oracle paradigm, where the most prominent example is Shor\u2019s algorithm for integer factorization.<\/jats:p>","DOI":"10.3390\/e21080800","type":"journal-article","created":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T11:11:00Z","timestamp":1565867460000},"page":"800","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Quantum Simulation Logic, Oracles, and the Quantum Advantage"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5888-1291","authenticated-orcid":false,"given":"Niklas","family":"Johansson","sequence":"first","affiliation":[{"name":"Institutionen f\u00f6r Systemteknik, Link\u00f6pings Universitet, 581 83 Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1082-8325","authenticated-orcid":false,"given":"Jan-\u00c5ke","family":"Larsson","sequence":"additional","affiliation":[{"name":"Institutionen f\u00f6r Systemteknik, Link\u00f6pings Universitet, 581 83 Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,8,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","article-title":"Simulating Physics with Computers","volume":"21","author":"Feynman","year":"1982","journal-title":"Int. J. Theor. Phys."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1103\/PhysRev.47.777","article-title":"Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?","volume":"47","author":"Einstein","year":"1935","journal-title":"Phys. Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195","article-title":"On the Einstein Podolsky Rosen Paradox","volume":"1","author":"Bell","year":"1964","journal-title":"Phys. Phys. Fizika"},{"key":"ref_4","first-page":"59","article-title":"The Problem of Hidden Variables in Quantum Mechanics","volume":"17","author":"Kochen","year":"1967","journal-title":"J. Math. Mech."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"113011","DOI":"10.1088\/1367-2630\/13\/11\/113011","article-title":"Memory Cost of Quantum Contextuality","volume":"13","author":"Kleinmann","year":"2011","journal-title":"New J. Phys."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1038\/nature13460","article-title":"Contextuality Supplies the \u2018Magic\u2019 for Quantum Computation","volume":"510","author":"Howard","year":"2014","journal-title":"Nature"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"140401","DOI":"10.1103\/PhysRevLett.113.140401","article-title":"Quantifying Coherence","volume":"113","author":"Baumgratz","year":"2014","journal-title":"Phys. Rev. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"012111","DOI":"10.1103\/PhysRevA.93.012111","article-title":"Coherence as a Resource in Decision Problems: The Deutsch-Jozsa Algorithm and a Variation","volume":"93","author":"Hillery","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_9","first-page":"97","article-title":"Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer","volume":"400","author":"Deutsch","year":"1985","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"key":"ref_10","first-page":"553","article-title":"Rapid Solution of Problems by Quantum Computation","volume":"439","author":"Deutsch","year":"1992","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Eng. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"R1633","DOI":"10.1103\/PhysRevA.58.R1633","article-title":"Deutsch-Jozsa Algorithm as a Test of Quantum Computation","volume":"58","author":"Collins","year":"1998","journal-title":"Phys. Rev. A"},{"key":"ref_12","unstructured":"Gottesman, D. (1998). The Heisenberg Representation of Quantum Computers. arXiv."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"032110","DOI":"10.1103\/PhysRevA.75.032110","article-title":"Evidence for the Epistemic View of Quantum States: A Toy Theory","volume":"75","author":"Spekkens","year":"2007","journal-title":"Phys. Rev. A"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s11128-017-1679-7","article-title":"Efficient Classical Simulation of the Deutsch\u2013Jozsa and Simon\u2019s Algorithms","volume":"16","author":"Johansson","year":"2017","journal-title":"Quantum Inf. Process."},{"key":"ref_15","unstructured":"Simon, D. (1994, January 20\u201322). On the Power of Quantum Computation. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1137\/S0097539796298637","article-title":"On the Power of Quantum Computation","volume":"26","author":"Simon","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_17","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bernstein, E., and Vazirani, U. (1993, January 16\u201318). Quantum Complexity Theory. Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, CA, USA.","DOI":"10.1145\/167088.167097"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","article-title":"Quantum Complexity Theory","volume":"26","author":"Bernstein","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_21","first-page":"257","article-title":"The Statistical Interpretation of Quantum Mechanics","volume":"11","author":"Born","year":"1954","journal-title":"Nobel Lect."},{"key":"ref_22","first-page":"663","article-title":"Concerning the State-change Due to the Measurement Process","volume":"15","year":"2006","journal-title":"Ann. Der Phys."},{"key":"ref_23","unstructured":"Yao, A.C.C. (1993, January 3\u20135). Quantum Circuit Complexity. Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science, Palo Alto, CA, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Arora, S., and Barak, B. (2009). Computational Complexity: A Modern Approach, Cambridge University Press. [1st ed.].","DOI":"10.1017\/CBO9780511804090"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539796300933","article-title":"Strengths and Weaknesses of Quantum Computing","volume":"26","author":"Bennett","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","article-title":"Logical Reversibility of Computation","volume":"17","author":"Bennett","year":"1973","journal-title":"IBM J. Res. Dev."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Chow, S., Eisen, P., Johnson, H., and Oorschot, P.C.V. (2002). White-Box Cryptography and an AES Implementation. Selected Areas in Cryptography, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-36492-7_17"},{"key":"ref_28","unstructured":"Fransson, M. (2015). Power Analysis of the Advanced Encryption Standard: Attacks and Countermeasures for 8-Bit Microcontrollers. [Master\u2019s Thesis, Link\u00f6ping University]."},{"key":"ref_29","unstructured":"van den Bosch, P.P.J., and van der Klauw, A.C. (1994). Modeling, Identification and Simulation of Dynamical Systems, CRC Press."},{"key":"ref_30","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press. [10th anniversary ed.]."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1063\/1.2713445","article-title":"Three Ways to Look at Mutually Unbiased Bases","volume":"889","author":"Bengtsson","year":"2007","journal-title":"AIP Conf. Proc."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1098\/rspa.1998.0164","article-title":"Quantum Algorithms Revisited","volume":"454","author":"Cleve","year":"1998","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Eng. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1103\/PhysRevA.54.1034","article-title":"Efficient Networks for Quantum Factoring","volume":"54","author":"Beckman","year":"1996","journal-title":"Phys. Rev. A"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0034-4877(76)90060-4","article-title":"The \u201cTransition Probability\u201d in the State Space of a *-Algebra","volume":"9","author":"Uhlmann","year":"1976","journal-title":"Rep. Math. Phys."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1080\/09500349414552171","article-title":"Fidelity for Mixed Quantum States","volume":"41","author":"Jozsa","year":"1994","journal-title":"J. Mod. Opt."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/18.761271","article-title":"Cryptographic Distinguishability Measures for Quantum-Mechanical States","volume":"45","author":"Fuchs","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1007\/s10701-012-9639-7","article-title":"Stabilizer Notation for Spekkens\u2019 Toy Theory","volume":"42","author":"Pusey","year":"2012","journal-title":"Found. Phys."},{"key":"ref_38","unstructured":"Judson, T.W. (2016). Abstract Algebra: Theory and Applications, Orthogonal Publishing L3C."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"082103","DOI":"10.1063\/1.2966133","article-title":"On the Epistemic View of Quantum States","volume":"49","author":"Skotiniotis","year":"2008","journal-title":"J. Math. Phys."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"042315","DOI":"10.1103\/PhysRevA.64.042315","article-title":"Universal State Inversion and Concurrence in Arbitrary Dimensions","volume":"64","author":"Rungta","year":"2001","journal-title":"Phys. Rev. A"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1103\/PhysRevLett.80.2245","article-title":"Entanglement of Formation of an Arbitrary State of Two Qubits","volume":"80","author":"Wootters","year":"1998","journal-title":"Phys. Rev. Lett."},{"key":"ref_42","unstructured":"Bennett, C.H., and Brassard, G. (1984, January 10\u201312). Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of the International Conference on Computers, Systems & Signal Processing, Bangalore, India."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Myrvold, W.C., and Christian, J. (2009). \u201cNo Information Without Disturbance\u201d: Quantum Limitations of Measurement. Quantum Reality, Relativistic Causality, and Closing the Epistemic Circle: Essays in Honour of Abner Shimony, Springer.","DOI":"10.1007\/978-1-4020-9107-0"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1038\/299802a0","article-title":"A Single Quantum Cannot Be Cloned","volume":"299","author":"Wootters","year":"1982","journal-title":"Nature"},{"key":"ref_45","unstructured":"Harrysson, P. (2016). Memory Cost of Quantum Contextuality. [Master\u2019s Thesis, Link\u00f6ping University]."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Aaronson, S., and Gottesman, D. (2004). Improved Simulation of Stabilizer Circuits. Phys. Rev. A, 70.","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Chiribella, G., and Spekkens, R.W. (2016). Quasi-Quantization: Classical Statistical Theories with an Epistemic Restriction. Quantum Theory: Informational Foundations and Foils, Springer. Number 181 in Fundamental Theories of Physics.","DOI":"10.1007\/978-94-017-7303-4"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"455304","DOI":"10.1088\/1751-8113\/47\/45\/455304","article-title":"Sequences of Projective Measurements in Generalized Probabilistic Models","volume":"47","author":"Kleinmann","year":"2014","journal-title":"J. Phys. A Math. Theor."},{"key":"ref_49","unstructured":"Kallenberg, O. (1997). Foundations of Modern Probability, Springer. Probability and its applications."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Cohen, D.W. (1989). An Introduction to Hilbert Space and Quantum Logic, Springer. Problem Books in Mathematics.","DOI":"10.1007\/978-1-4613-8841-8"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1142\/S0219749906002109","article-title":"Quantum-Classical Correspondence in the Oracle Model of Computation","volume":"04","author":"Chhajlany","year":"2006","journal-title":"Int. J. Quantum Inf."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1925","DOI":"10.1016\/j.physleta.2016.04.006","article-title":"Quantum Computation with Classical Light: Implementation of the Deutsch\u2013Jozsa Algorithm","volume":"380","author":"McLaren","year":"2016","journal-title":"Phys. Lett. A"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1142\/S021974990700292X","article-title":"De-Quantizing the Solution of Deutsch\u2019s Problem","volume":"05","author":"Calude","year":"2007","journal-title":"Int. J. Quantum Inf."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11047-011-9276-7","article-title":"The Deutsch\u2013Jozsa Problem: De-Quantisation and Entanglement","volume":"11","author":"Abbott","year":"2012","journal-title":"Nat. Comput."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TCAD.2003.811448","article-title":"Synthesis of Reversible Logic Circuits","volume":"22","author":"Shende","year":"2003","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"ref_56","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., and Moulton, D.P. (2004). A New Quantum Ripple-Carry Addition Circuit. arXiv."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"361","DOI":"10.26421\/QIC12.5-6-1","article-title":"Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation","volume":"12","author":"Markov","year":"2012","journal-title":"Quantum Inform. Comput."},{"key":"ref_58","unstructured":"Machta, J. (1998). Phase Information in Quantum Oracle Computing. arXiv."},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A Fast Quantum Mechanical Algorithm for Database Search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"1918","DOI":"10.1038\/s41467-017-01904-7","article-title":"Complete 3-Qubit Grover Search on a Programmable Quantum Computer","volume":"8","author":"Figgatt","year":"2017","journal-title":"Nat. Commun."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"200501","DOI":"10.1103\/PhysRevLett.113.200501","article-title":"Experimental Realization of a One-Way Quantum Computer Algorithm Solving Simon\u2019s Problem","volume":"113","author":"Tame","year":"2014","journal-title":"Phys. Rev. Lett."},{"key":"ref_62","unstructured":"Brassard, G., and Hoyer, P. (1997, January 17\u201319). An Exact Quantum Polynomial-Time Algorithm for Simon\u2019s Problem. Proceedings of the Fifth Israeli Symposium on IEEE Theory of Computing and Systems, Ramat-Gan, Israel."},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Kuwakado, H., and Morii, M. (2010, January 13\u201318). Quantum Distinguisher between the 3-Round Feistel Cipher and the Random Permutation. Proceedings of the 2010 IEEE International Symposium on Information Theory, Austin, TX, USA.","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"ref_64","unstructured":"Kuwakado, H., and Morii, M. (2012, January 28\u201331). Security on the Quantum-Type Even-Mansour Cipher. Proceedings of the 2012 International Symposium on Information Theory and Its Applications, Honolulu, HI, USA."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., and Naya-Plasencia, M. (2016). Breaking Symmetric Cryptosystems Using Quantum Period Finding. Advances in Cryptology\u2014CRYPTO 2016, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-662-53008-5_8"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1126\/science.aad9480","article-title":"Realization of a Scalable Shor Algorithm","volume":"351","author":"Monz","year":"2016","journal-title":"Science"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1038\/nphys2385","article-title":"Computing Prime Factors with a Josephson Phase Qubit Quantum Processor","volume":"8","author":"Lucero","year":"2012","journal-title":"Nat. Phys."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1038\/nphoton.2012.259","article-title":"Experimental Realization of Shor\u2019s Quantum Factoring Algorithm Using Qubit Recycling","volume":"6","author":"Laing","year":"2012","journal-title":"Nat. Photonics"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1126\/science.1173731","article-title":"Shor\u2019s Quantum Factoring Algorithm on a Photonic Chip","volume":"325","author":"Politi","year":"2009","journal-title":"Science"},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"250504","DOI":"10.1103\/PhysRevLett.99.250504","article-title":"Demonstration of a Compiled Version of Shor\u2019s Quantum Factoring Algorithm Using Photonic Qubits","volume":"99","author":"Lu","year":"2007","journal-title":"Phys. Rev. Lett."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"250505","DOI":"10.1103\/PhysRevLett.99.250505","article-title":"Experimental Demonstration of a Compiled Version of Shor\u2019s Algorithm with Quantum Entanglement","volume":"99","author":"Lanyon","year":"2007","journal-title":"Phys. Rev. Lett."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1038\/414883a","article-title":"Experimental Realization of Shor\u2019s Quantum Factoring Algorithm Using Nuclear Magnetic Resonance","volume":"414","author":"Vandersypen","year":"2001","journal-title":"Nature"},{"key":"ref_73","unstructured":"Coppersmith, D. (2002). An Approximate Fourier Transform Useful in Quantum Factoring. arXiv."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1038\/nature12290","article-title":"Oversimplifying Quantum Factoring","volume":"499","author":"Smolin","year":"2013","journal-title":"Nature"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"3228","DOI":"10.1103\/PhysRevLett.76.3228","article-title":"Semiclassical Fourier Transform for Quantum Computation","volume":"76","author":"Griffiths","year":"1996","journal-title":"Phys. Rev. Lett."},{"key":"ref_76","unstructured":"Cao, Z., and Liu, L. (2015). A Note On One Realization of a Scalable Shor Algorithm. arXiv."},{"key":"ref_77","unstructured":"Car\u00f8e, M.K. (2012). Design of Reversible Logic Circuits Using Standard Cells: Standard Cells and Functional Programming, Department of Computer Science, University of Copenhagen. Technical Report No. 2012-03."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/8\/800\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:11:26Z","timestamp":1760188286000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/8\/800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,15]]},"references-count":77,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2019,8]]}},"alternative-id":["e21080800"],"URL":"https:\/\/doi.org\/10.3390\/e21080800","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,15]]}}}