Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

STEAM-H: Science, Technology, Engineering, Agriculture, Mathematics & Health

Classification Problem in a Quantum Framework

Enrica Santucci, Giuseppe Sergioli

Published Jan 1, 2018• 8 citations
Publisher
DOI
10.1007/978-3-319-74971-6_16

Related papers

Quantum Machine Learning with SQUID

Alessandro Roggero, Jakub Filipek, Shih-Chieh Hsu +1 more

In this work we present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. The classical infrastructure is based on PyTorch and we provide a standardized design to implement a variety of quantum models with the capability of back-propagation for efficient training. We present the structure of our framework and provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset. In particular, we highlight the implications for scalability for gradient-based optimization of quantum models on the choice of output for variational quantum models.

arXiv:2105.00098•Quantum•May 30, 2022•1 citation

Quantum Classification

Péter Wittek

Elsevier eBooks•Jan 1, 2014•1 citation

Quantum Classification

Davide Pastorello

Springer eBooks•Jan 1, 2026•0 citations

Quantum Classification of Mathematical Objects (QCMO): A Probability-Based Framework for Complex Structures

Jincheng Zhang

Classical mathematical taxonomy has long relied on binary, crisp set membership where an object either belongs to a specific category or it does not. In contemporary mathematics, however, the proliferation of highly complex, multi-faceted, and abstract objects renders traditional binary classification inadequate. This paper introduces the Quantum Classification of Mathematical Objects (QCMO) framework, a novel paradigm that shifts from crisp set inclusion to a probabilistic classification model. By defining mathematical objects as states within a generalized vector space and employing conditional probabilities of the form P(C_i | X), QCMO captures the inherent ambiguity, multi-categorization, and structural superposition of advanced mathematical entities. We formulate the theoretical foundations, the mathematical mapping mechanisms, and the structural properties of QCMO, providing a robust tool for organizing and resolving high-complexity classification problems across diverse mathematical disciplines.

•Aug 7, 2026•0 citations

Quantum Parameterized Complexity

Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann +3 more

Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish a quantum equivalent of classical parameterized complexity theory, motivated by the need for new tools for the classifications of the complexity of real-world problems. We introduce the quantum analogues of a range of parameterized complexity classes and examine the relationship between these classes, their classical counterparts, and well-studied problems. This framework exposes a rich classification of the complexity of parameterized versions of QMA-hard problems, demonstrating, for example, a clear separation between the Quantum Circuit Satisfiability problem and the Local Hamiltonian problem.

arXiv:2203.08002•Mar 15, 2022•1 citation

Quantum Classification

Davide Pastorello

Machine learning•Dec 16, 2022•0 citations
In this work we present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. The classical infrastructure is based on PyTorch and we provide a standardized design to implement a variety of quantum models with the capability of back-propagation for efficient training. We present the structure of our framework and provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset. In particular, we highlight the implications for scalability for gradient-based optimization of quantum models on the choice of output for variational quantum models.
Classical mathematical taxonomy has long relied on binary, crisp set membership where an object either belongs to a specific category or it does not. In contemporary mathematics, however, the proliferation of highly complex, multi-faceted, and abstract objects renders traditional binary classification inadequate. This paper introduces the Quantum Classification of Mathematical Objects (QCMO) framework, a novel paradigm that shifts from crisp set inclusion to a probabilistic classification model. By defining mathematical objects as states within a generalized vector space and employing conditional probabilities of the form P(C_i | X), QCMO captures the inherent ambiguity, multi-categorization, and structural superposition of advanced mathematical entities. We formulate the theoretical foundations, the mathematical mapping mechanisms, and the structural properties of QCMO, providing a robust tool for organizing and resolving high-complexity classification problems across diverse mathematical disciplines.
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish a quantum equivalent of classical parameterized complexity theory, motivated by the need for new tools for the classifications of the complexity of real-world problems. We introduce the quantum analogues of a range of parameterized complexity classes and examine the relationship between these classes, their classical counterparts, and well-studied problems. This framework exposes a rich classification of the complexity of parameterized versions of QMA-hard problems, demonstrating, for example, a clear separation between the Quantum Circuit Satisfiability problem and the Local Hamiltonian problem.