{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:14:18Z","timestamp":1767374058716,"version":"build-2065373602"},"reference-count":44,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T00:00:00Z","timestamp":1749513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>This paper studies the important problem of quantum classification of Boolean functions from an entirely novel perspective. Typically, quantum classification algorithms allow us to classify functions with a probability of 1.0, if we are promised that they meet specific unique properties. The primary objective of this study is to explore whether it is feasible to obtain any insights when the input function deviates from the promised class. For concreteness, we use a recently introduced quantum algorithm that is designed to classify a large class of imbalanced Boolean functions with probability 1.0 using just a single oracular query. First, we establish a completely new concept characterizing \u201cnearness\u201d between Boolean functions. Utilizing this concept, we show that, as long as the unknown function is close enough to the promised class, it is still possible to obtain useful information about its behavioral pattern from the classification algorithm. In this regard, the current study is among the first to provide evidence that shows how useful it is to apply quantum classification algorithms to functions outside the promised class in order to get a glimpse of important information.<\/jats:p>","DOI":"10.3390\/computers14060228","type":"journal-article","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T09:59:14Z","timestamp":1749549554000},"page":"228","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum Classification Outside the Promised Class"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3741-1271","authenticated-orcid":false,"given":"Theodore","family":"Andronikos","sequence":"first","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3669-0453","authenticated-orcid":false,"given":"Constantinos","family":"Bitsakos","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4424-9951","authenticated-orcid":false,"given":"Konstantinos","family":"Nikas","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7811-4831","authenticated-orcid":false,"given":"Georgios I.","family":"Goumas","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4890-8427","authenticated-orcid":false,"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[{"name":"Computing Systems Laboratory, National Technical University of Athens, 15772 Zografou, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,6,10]]},"reference":[{"unstructured":"Chow, J., Dial, O., and Gambetta, J. (2025, January 07). IBM Quantum Breaks the 100-Qubit Processor Barrier. Available online: https:\/\/www.ibm.com\/quantum\/blog\/127-qubit-quantum-processor-eagle\/.","key":"ref_1"},{"unstructured":"IBM (2025, January 07). IBM Unveils 400 Qubit-Plus Quantum Processor. Available online: https:\/\/newsroom.ibm.com\/2022-11-09-IBM-Unveils-400-Qubit-Plus-Quantum-Processor-and-Next-Generation-IBM-Quantum-System-Two\/.","key":"ref_2"},{"unstructured":"Gambetta, J. (2025, January 07). The Hardware and Software for the Era of Quantum Utility Is Here. Available online: https:\/\/www.ibm.com\/quantum\/blog\/quantum-roadmap-2033\/.","key":"ref_3"},{"unstructured":"IBM (2025, January 07). IBM Launches Its Most Advanced Quantum Computers, Fueling New Scientific Value and Progress towards Quantum Advantage. Available online: https:\/\/newsroom.ibm.com\/2024-11-13-ibm-launches-its-most-advanced-quantum-computers,-fueling-new-scientific-value-and-progress-towards-quantum-advantage\/.","key":"ref_4"},{"unstructured":"Neven, H. (2025, January 07). Meet Willow, Our State-of-the-Art Quantum CHIP. Available online: https:\/\/blog.google\/technology\/research\/google-willow-quantum-chip\/.","key":"ref_5"},{"doi-asserted-by":"crossref","unstructured":"Garisto, D. (2025, January 07). Google Uncovers How Quantum Computers Can Beat Today\u2019s Best Supercomputers. Available online: https:\/\/www.nature.com\/articles\/d41586-024-03288-3\/.","key":"ref_6","DOI":"10.1038\/d41586-024-03288-3"},{"unstructured":"Aasen, D., Aghaee, M., Alam, Z., Andrzejczuk, M., Antipov, A., Astafev, M., Avilovas, L., Barzegar, A., Bauer, B., and Becker, J. (2025). Roadmap to fault tolerant quantum computation using topological qubit arrays. arXiv.","key":"ref_7"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/s41586-024-08445-2","article-title":"Interferometric single-shot parity measurement in InAs\u2013Al hybrid devices","volume":"638","author":"Aghaee","year":"2025","journal-title":"Nature"},{"unstructured":"Microsoft (2025, February 21). Microsoft\u2019s Majorana 1 Chip Carves New Path for Quantum Computing. Available online: https:\/\/news.microsoft.com\/source\/features\/innovation\/microsofts-majorana-1-chip-carves-new-path-for-quantum-computing\/.","key":"ref_9"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1126\/science.ado6285","article-title":"Beyond-classical computation in quantum simulation","volume":"388","author":"King","year":"2025","journal-title":"Science"},{"unstructured":"Davide, C. (2025, March 17). Fresh \u2018Quantum Advantage\u2019 Claim Made by Computing Firm D-Wave. Available online: https:\/\/www.nature.com\/articles\/d41586-025-00765-1\/.","key":"ref_11"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"090601","DOI":"10.1103\/PhysRevLett.134.090601","article-title":"Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor","volume":"134","author":"Gao","year":"2025","journal-title":"Phys. Rev. Lett."},{"doi-asserted-by":"crossref","unstructured":"Sanders, B.C. (2025, March 17). Superconducting Quantum Computing Beyond 100 Qubits. Available online: https:\/\/physics.aps.org\/articles\/v18\/45\/.","key":"ref_13","DOI":"10.1103\/Physics.18.45"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6041","DOI":"10.1109\/TNSM.2024.3452326","article-title":"Multipartite Entanglement Distribution in the Quantum Internet: Knowing When to Stop!","volume":"21","author":"Cacciapuoti","year":"2024","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.1109\/TCOMM.2023.3344140","article-title":"Quantum MAC: Genuine Entanglement Access Control via Many-Body Dicke States","volume":"72","author":"Illiano","year":"2024","journal-title":"IEEE Trans. Commun."},{"unstructured":"Photonic (2025, January 07). Photonic Demonstrates Distributed Entanglement Between Modules, Marking Significant Milestone Toward Scalable Quantum Computing and Networking. Available online: https:\/\/photonic.com\/news\/photonic-demonstrates-distributed-entanglement-between-modules\/.","key":"ref_16"},{"unstructured":"Nu Quantum (2025, January 07). Announcing the Qubit-Photon Interface (QPI): Towards Unlocking Modular and Scalable Distributed Quantum Computing. Available online: https:\/\/www.nu-quantum.com\/news\/qubit-photon-interface-qpi-towards-unlocking-modular-and-scalable-distributed-quantum-computing\/.","key":"ref_17"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1038\/s41586-024-08404-x","article-title":"Distributed quantum computing across an optical network link","volume":"638","author":"Main","year":"2025","journal-title":"Nature"},{"unstructured":"Oxford News (2025, February 07). First Distributed Quantum Algorithm Brings Quantum Supercomputers Closer. Available online: https:\/\/www.ox.ac.uk\/news\/2025-02-06-first-distributed-quantum-algorithm-brings-quantum-supercomputers-closer\/.","key":"ref_19"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1103\/PhysRevLett.82.1052","article-title":"Quantum strategies","volume":"82","author":"Meyer","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3077","DOI":"10.1103\/PhysRevLett.83.3077","article-title":"Quantum games and quantum strategies","volume":"83","author":"Eisert","year":"1999","journal-title":"Phys. Rev. Lett."},{"doi-asserted-by":"crossref","unstructured":"Koh, D.E., Kumar, K., and Goh, S.T. (2024). Quantum Volunteer\u2019s Dilemma. arXiv.","key":"ref_22","DOI":"10.1103\/PhysRevResearch.7.013104"},{"unstructured":"Bennett, C.H., and Brassard, G. (1984, January 10\u201312). Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India.","key":"ref_23"},{"doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2024). A Multiparty Quantum Private Equality Comparison Scheme Relying on |GHZ3\u232a States. Future Internet, 16.","key":"ref_24","DOI":"10.3390\/fi16090309"},{"key":"ref_25","first-page":"553","article-title":"Rapid solution of problems by quantum computation","volume":"439","author":"Deutsch","year":"1992","journal-title":"Proc. R. Soc. Lond. Ser. A Math. Phys. Sci."},{"key":"ref_26","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. Ser. A Math. Phys. Eng. Sci."},{"key":"ref_27","first-page":"5251","article-title":"Initialization-free generalized Deutsch-Jozsa algorithm","volume":"34","author":"Chi","year":"2001","journal-title":"J. Phys. A Math. Gen."},{"key":"ref_28","first-page":"319","article-title":"A Generalization of the Deutsch-Jozsa Quantum Algorithm","volume":"9","author":"Holmes","year":"2003","journal-title":"Far East J. Math Sci."},{"doi-asserted-by":"crossref","unstructured":"Ballhysa, E., and Say, A.C.C. (2004). Generating Equiprobable Superpositions of Arbitrary Sets for a New Generalization of the Deutsch-Jozsa Algorithm. Computer and Information Sciences\u2014ISCIS 2004, Springer.","key":"ref_29","DOI":"10.1007\/978-3-540-30182-0_97"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"062331","DOI":"10.1103\/PhysRevA.97.062331","article-title":"Generalized Deutsch-Jozsa problem and the optimal quantum algorithm","volume":"97","author":"Qiu","year":"2018","journal-title":"Phys. Rev. A"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11128-023-03884-8","article-title":"A generalisation of the Phase Kick-Back","volume":"22","author":"Tornero","year":"2023","journal-title":"Quantum Inf. Process."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"104605","DOI":"10.1016\/j.ic.2020.104605","article-title":"Revisiting Deutsch-Jozsa algorithm","volume":"275","author":"Qiu","year":"2020","journal-title":"Inf. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/FI-2021-2076","article-title":"Testing Boolean Functions Properties","volume":"182","author":"Xie","year":"2021","journal-title":"Fundam. Informaticae"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1016\/j.physleta.2019.04.023","article-title":"Non-local quantum functions and the distributed Deutsch-Jozsa algorithm","volume":"383","author":"Mina","year":"2019","journal-title":"Phys. Lett. A"},{"doi-asserted-by":"crossref","unstructured":"Li, H., Qiu, D., and Luo, L. (2025). Distributed Generalized Deutsch-Jozsa Algorithm. Computing and Combinatorics, Springer Nature Singapore.","key":"ref_35","DOI":"10.2139\/ssrn.4698889"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"2557","DOI":"10.1007\/s10773-020-04522-0","article-title":"Generalization of Deutsch\u2019s Algorithm","volume":"59","author":"Nagata","year":"2020","journal-title":"Int. J. Theor. Phys."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1137\/S0097539795293123","article-title":"Learning DNF over the Uniform Distribution Using a Quantum Example Oracle","volume":"28","author":"Bshouty","year":"1998","journal-title":"SIAM J. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"4331","DOI":"10.1103\/PhysRevA.60.4331","article-title":"Bound on the number of functions that can be distinguished with k quantum queries","volume":"60","author":"Farhi","year":"1999","journal-title":"Phys. Rev. A"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1137\/S0097539704412910","article-title":"Equivalences and Separations Between Quantum and Classical Learnability","volume":"33","author":"Servedio","year":"2004","journal-title":"SIAM J. Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11128-009-0129-6","article-title":"The geometry of quantum learning","volume":"9","author":"Hunziker","year":"2009","journal-title":"Quantum Inf. Process."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"103014","DOI":"10.1088\/1367-2630\/16\/10\/103014","article-title":"A quantum speedup in machine learning: Finding anN-bit Boolean function for a classification","volume":"16","author":"Yoo","year":"2014","journal-title":"New J. Phys."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"012327","DOI":"10.1103\/PhysRevA.92.012327","article-title":"Quantum learning robust against noise","volume":"92","author":"Cross","year":"2015","journal-title":"Phys. Rev. A"},{"doi-asserted-by":"crossref","unstructured":"Andronikos, T., Bitsakos, C., Nikas, K., Goumas, G.I., and Koziris, N. (2025). A Quantum Algorithm for the Classification of Patterns of Boolean Functions. Mathematics, 13.","key":"ref_43","DOI":"10.3390\/math13111750"},{"unstructured":"Qiskit (2025, January 07). Qiskit Is the World\u2019s Most Popular Software Stack for Quantum Computing. Available online: https:\/\/www.ibm.com\/quantum\/qiskit\/.","key":"ref_44"}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/6\/228\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:49:35Z","timestamp":1760032175000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/6\/228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,10]]},"references-count":44,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["computers14060228"],"URL":"https:\/\/doi.org\/10.3390\/computers14060228","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2025,6,10]]}}}