{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:41:24Z","timestamp":1760060484297,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"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>Chatbots, search engines and Database Query Systems are invaluable sources of information for decision-making processes in the data-driven world in which we live today. In this study, we explore the extent to which classical and Quantum Query Systems can support future decisions, taken at a moment where the query service may be inaccessible and the decision has to be based solely on information collected in the past. We show that encoding information at the quantum level allows Query Systems to support future or delayed decisions. More precisely, Grover\u2019s algorithm can be employed in order to extract the desired answer from a large superposition of question\u2013answer pairs obtained through a single interrogation of the system. The method works best for binary answers and can be applied to queries encompassing hundreds or thousands of questions in one query. Extensions are possible if we allow more than one query to be addressed to the system. By comparison, a classical system would require hundreds or thousands of queries in order to offer the same level of support for delayed decisions.<\/jats:p>","DOI":"10.3390\/e27090894","type":"journal-article","created":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T00:10:36Z","timestamp":1756080636000},"page":"894","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Information Supports Delayed Decisions"],"prefix":"10.3390","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2202-1681","authenticated-orcid":false,"given":"Marius","family":"Nagy","sequence":"first","affiliation":[{"name":"College of Computer Engineering and Science, Prince Mohammad Bin Fahd University, Dhahran 34754, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5325-0781","authenticated-orcid":false,"given":"Naya","family":"Nagy","sequence":"additional","affiliation":[{"name":"College of Computer Science and IT, Imam Abdulrahman Bin Faisal University, Dammam 31441, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,8,23]]},"reference":[{"key":"ref_1","unstructured":"Grant, N., and Metz, C. (2025, August 20). A New Chat Bot Is a \u2018Code Red\u2019 for Google\u2019s Search Business, The New York Times, Available online: https:\/\/www.nytimes.com\/2022\/12\/21\/technology\/ai-chatgpt-google-search.html."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"02029","DOI":"10.1051\/e3sconf\/202447402029","article-title":"Using the power query system for processing and data mining SAP ERP","volume":"474","author":"Tkachenko","year":"2024","journal-title":"E3S Web Conf."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"102231","DOI":"10.1016\/j.is.2023.102231","article-title":"Adaptive search query generation and refinement in systematic literature review","volume":"117","author":"Badami","year":"2023","journal-title":"Inf. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MAHC.2012.61","article-title":"Early history of SQL","volume":"34","author":"Chamberlin","year":"2012","journal-title":"IEEE Ann. Hist. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Shaik, B., and Chemuduru, D. (2023). Dynamic SQL. Procedural Programming with PostgreSQL PL\/pgSQL, Apress.","DOI":"10.1007\/978-1-4842-9840-4"},{"key":"ref_6","unstructured":"Crowe, M., and Laux, F. (2024, January 10\u201314). Implementing the draft Graph Query Language Standard The Financial Benchmark. Proceedings of the International Conference on Advances in Databases, Knowledge, and Data Applications, Athens, Greece."},{"key":"ref_7","first-page":"1","article-title":"Improving query processing in blockchain systems by using a multi-level sharding mechanism","volume":"80","author":"Matani","year":"2024","journal-title":"J. Supercomput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"6307","DOI":"10.1007\/s10115-024-02144-0","article-title":"A hybrid storage blockchain-based query efficiency enhancement method for business environment evaluation","volume":"66","author":"Li","year":"2024","journal-title":"Knowl. Inf. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3770","DOI":"10.1109\/TDSC.2022.3227141","article-title":"Efficient and Privacy-Preserving Spatial Keyword Similarity Query Over Encrypted Data","volume":"20","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10916-019-1229-1","article-title":"Achieving Efficient and Privacy-Preserving k-NN Query for Outsourced eHealthcare Data","volume":"43","author":"Zheng","year":"2019","journal-title":"J. Med. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Qiao, B., Ma, L., Chen, L., and Hu, B. (2022). A PID-Based k-NN Query Processing Algorithm for Spatial Data. Sensors, 22.","DOI":"10.3390\/s22197651"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4387","DOI":"10.1109\/TDSC.2022.3211870","article-title":"PRkNN: Efficient and Privacy-Preserving Reverse k-NN Query Over Encrypted Data","volume":"20","author":"Zheng","year":"2022","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/3524455","article-title":"Advances in the quantum internet","volume":"65","author":"Gyongyosi","year":"2022","journal-title":"Commun. ACM"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Gyongyosi, L., and Imre, S. (2020). Circuit Depth Reduction for Gate-Model Quantum Computers. Sci. Rep., 10.","DOI":"10.1038\/s41598-020-67014-5"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Gyongyosi, L., and Imre, S. (2021). Scalable distributed gate-model quantum computers. Sci. Rep., 11.","DOI":"10.1038\/s41598-020-76728-5"},{"key":"ref_16","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, USA."},{"key":"ref_17","unstructured":"Schmitt, I. (2025, August 20). Quantum Query Processing: Unifying Database Querying and Information Retrieval. Available online: https:\/\/api.semanticscholar.org\/CorpusID:55578861."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Melucci, M. (2015). Introduction to Information Retrieval and Quantum Mechanics, Springer.","DOI":"10.1007\/978-3-662-48313-8"},{"key":"ref_19","unstructured":"Quantum News (2024). Quantum Computing and AI Integration Revolutionizing Decision-Making. Quantum Zeitgeist, Available online: https:\/\/quantumzeitgeist.com\/quantum-computing-and-ai-integration-revolutionizing-decision-making\/."},{"key":"ref_20","first-page":"18","article-title":"Real-Time AI Decision Making in IoT with Quantum Computing: Investigating & Exploring the Development and Implementation of Quantum-Supported AI Inference Systems for IoT Applications","volume":"1","author":"Raparthi","year":"2021","journal-title":"Internet Things Edge Comput. J."},{"key":"ref_21","unstructured":"Research News (2024). How Quantum Computing Will Affect Artificial Intelligence Applications in Healthcare, Lerner Research Institute. Available online: https:\/\/www.lerner.ccf.org\/news\/article\/?title=+How+quantum+computing+will\\+affect+artificial+intelligence+applications+in+healthcare+\\&id=79c89a1fcb93c39e8321c3313ded4b84005e9d44."},{"key":"ref_22","first-page":"1474","article-title":"On the power of quantum computation","volume":"26","author":"Simon","year":"1997","journal-title":"Spec. Issue Quantum Comput. Siam J. Comput."},{"key":"ref_23","first-page":"1484","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"Spec. Issue Quantum Comput. Siam J. Comput."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1364\/OPTICA.3.000100","article-title":"Highly efficient optical quantum memory with long coherence time in cold atoms","volume":"3","author":"Cho","year":"2016","journal-title":"Optica"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2381","DOI":"10.1038\/s41467-021-22706-y","article-title":"One-hour coherent optical storage in an atomic frequency comb memory","volume":"12","author":"Ma","year":"2021","journal-title":"Nat. Commun."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1038\/nature14025","article-title":"Optically addressable nuclear spins in a solid with a six-hour coherence time","volume":"517","author":"Zhong","year":"2015","journal-title":"Nature"},{"key":"ref_27","unstructured":"Boyer, M., Brassard, G., Hoeyer, P., and Tapp, A. (1996, January 22\u201324). Tight bounds on quantum searching. Proceedings of the Workshop on Physics and Computation: PhysComp \u201996, Boston, MA, USA. Available online: http:\/\/arxiv.org\/abs\/quant-ph\/9605034."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-49208-9_10","article-title":"Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution","volume":"Volume 1509","author":"Williams","year":"1999","journal-title":"Quantum Computing and Quantum Communications"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1140\/epjd\/e2007-00295-1","article-title":"Noise effect on Grover algorithm","volume":"46","author":"Salas","year":"2008","journal-title":"Eur. Phys. J. D"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"L012017","DOI":"10.1103\/PhysRevResearch.7.L012017","article-title":"Noise-tolerant Grover\u2019s algorithm via success-probability prediction","volume":"7","author":"Leng","year":"2025","journal-title":"Phys. Rev. Res."},{"key":"ref_31","unstructured":"Ishii, M., Qassim, H., Kurita, T., Emerson, J., Maruyama, K., Oshima, H., and Sato, S. (2025). Implementation and verification of coherent error suppression using randomized compiling for Grover\u2019s algorithm on a trapped-ion device. arXiv."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-642-36046-6_17","article-title":"Grover\u2019s Algorithm with Errors","volume":"Volume 7721","author":"Henzinger","year":"2013","journal-title":"Mathematical and Engineering Methods in Computer Science"},{"key":"ref_33","first-page":"644","article-title":"Error Mitigation of Grover\u2019s Quantum Search Algorithm","volume":"60","author":"Kumar","year":"2022","journal-title":"Indian J. Pure Appl. Phys."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/9\/894\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:34:53Z","timestamp":1760034893000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/9\/894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,23]]},"references-count":33,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["e27090894"],"URL":"https:\/\/doi.org\/10.3390\/e27090894","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,8,23]]}}}