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

arXiv:2511.22679

Foundations of Quantum Granular Computing with Effect-Based Granules, Algebraic Properties and Reference Architectures

Oscar Montiel Ross

quant-phcs.AISubmitted Nov 27, 2025• Announced Nov 28, 2025• 1 citation
v1 · Nov 27, 2025v2 · Dec 3, 2025
arXivHTMLPDF

Abstract

This paper develops the foundations of Quantum Granular Computing (QGC), extending classical granular computing including fuzzy, rough, and shadowed granules to the quantum regime. Quantum granules are modeled as effects on a finite dimensional Hilbert space, so granular memberships are given by Born probabilities. This operator theoretic viewpoint provides a common language for sharp (projective) and soft (nonprojective) granules and embeds granulation directly into the standard formalism of quantum information theory. We establish foundational results for effect based quantum granules, including normalization and monotonicity properties, the emergence of Boolean islands from commuting families, granular refinement under Luders updates, and the evolution of granules under quantum channels via the adjoint channel in the Heisenberg picture. We connect QGC with quantum detection and estimation theory by interpreting the effect operators realizing Helstrom minimum error measurement for binary state discrimination as Helstrom type decision granules, i.e., soft quantum counterparts of Bayes optimal decision regions. Building on these results, we introduce Quantum Granular Decision Systems (QGDS) with three reference architectures that specify how quantum granules can be defined, learned, and integrated with classical components while remaining compatible with near term quantum hardware. Case studies on qubit granulation, two qubit parity effects, and Helstrom style soft decisions illustrate how QGC reproduces fuzzy like graded memberships and smooth decision boundaries while exploiting noncommutativity, contextuality, and entanglement. The framework thus provides a unified and mathematically grounded basis for operator valued granules in quantum information processing, granular reasoning, and intelligent systems.

Comments
Three figures and the graphical abstract

Related papers

From Boolean algebras to effect algebras: Sharp and unsharp logic in classical and quantum systems

Atul Kumar Singh, Akhilesh Kumar Singh

This paper examines how logical structures represent sharp and unsharp propositions in classical and quantum systems. Classical sharp logic is modeled by Boolean algebras, where propositions have bivalent truth values, complements are globally defined, and distributivity holds. Quantum sharp logic is modeled by orthomodular lattices of closed Hilbert-space subspaces or projection operators; it retains definite yes–no outcomes for ideal measurements but rejects the Boolean assumptions of global truth valuation and distributivity. Classical unsharp logic uses fuzzy membership or probabilistic truth values to describe vagueness and incomplete information, whereas quantum unsharp logic is expressed through effects and effect algebras, which capture noisy, inefficient, and generalized measurements. The paper’s central question is which algebraic structure is appropriate for each combination of classical or quantum behavior and sharp or unsharp measurement. The analysis shows that the four cases form a coherent hierarchy: Boolean algebras describe deterministic classical events, orthomodular lattices describe ideal quantum propositions, fuzzy or probabilistic models describe classical partial truth, and effect algebras describe realistic quantum effects. This classification clarifies the mathematical and physical role of unsharpness and explains why effect algebras are needed beyond projection-based quantum logic.

Engineering and Applied Science Letters•Aug 12, 2026•0 citations

Quantum Computing: Foundations, Algorithms, Architectures, and Philosophical Implications

Pankaj Wahane

This work presents a comprehensive and rigorous examination of quantum computing, spanning its mathematical foundations, physical principles, algorithmic developments, hardware architectures, and philosophical implications. Beginning with linear algebra over Hilbert spaces and the postulates of quantum mechanics, the manuscript develops the formal structure of quantum information theory, including qubits, entanglement, quantum channels, and noise models. The work provides in-depth treatments of the quantum circuit model, alternative computation paradigms such as measurement-based, adiabatic, and topological quantum computation, and the theoretical framework of quantum error correction, including stabilizer and surface codes. Foundational and modern quantum algorithms are analysed in detail, including Shor’s factoring algorithm, Grover’s search, variational quantum eigensolvers, QAOA, and emerging quantum machine learning approaches. Beyond algorithms and implementations, the manuscript addresses scalability challenges, fault tolerance, computational complexity limits, and the implications of quantum computing for cryptography and the extended Church–Turing thesis. The concluding sections explore philosophical questions concerning interpretation, measurement, and the relationship between computation and physical reality. This work is intended as both a reference text and a research-level synthesis for advanced students, researchers, and practitioners in quantum computing, theoretical computer science, and quantum physics.

•Jan 21, 2026•0 citations

Hilbert Spaces in Quantum Computing: Foundations and Architectural Scaling

Chinnaraji Annamalai

Classical computing architectures encode information into discrete binary digits residing in isolated regions of phase space. Quantum computing replaces this paradigm by leveraging complex state vectors defined within continuous, multi-dimensional Hilbert spaces. This paper provides a unified mathematical framework examining finite-dimensional Hilbert spaces in quantum information processing. It traces the structural scaling of quantum state spaces from single-qubit systems up through composite tensor product structures and multi-qubit registers. By detailing computational basis representations, state transformations, probability amplitudes, and multipartite entanglement classes, such as Bell, GHZ, and W states, this paper demonstrates how exponential dimensional scaling enables quantum parallelism while presenting computational barriers to classical simulation.

•Sep 14, 2026•3 citations

An Extended Epistemic Framework Beyond Probability for Quantum Information Processing with Applications in Security, Artificial Intelligence, and Financial Computing

Gerardo Iovane

In this work, we propose a novel quantum-informed epistemic framework that extends the classical notion of probability by integrating plausibility, credibility, and possibility as distinct yet complementary measures of uncertainty. This enriched quadruple (P, Pl, Cr, Ps) enables a deeper characterization of quantum systems and decision-making processes under partial, noisy, or ambiguous information. Our formalism generalizes the Born rule within a multi-valued logic structure, linking Positive Operator-Valued Measures (POVMs) with data-driven plausibility estimators, agent-based credibility priors, and fuzzy-theoretic possibility functions. We develop a hybrid classical-quantum inference engine that computes a vectorial aggregation of the quadruples, enhancing robustness and semantic expressivity in contexts where classical probability fails to capture non-Kolmogorovian phenomena such as entanglement, contextuality, or decoherence. The approach is validated through three real-world application domains-quantum cybersecurity, quantum AI, and financial computing-where the proposed model outperforms standard probabilistic reasoning in terms of accuracy, resilience to noise, interpretability, and decision stability. Comparative analysis against QBism, Dempster-Shafer, and fuzzy quantum logic further demonstrates the uniqueness of architecture in both operational semantics and practical outcomes. This contribution lays the groundwork for a new theory of epistemic quantum computing capable of modelling and acting under uncertainty beyond traditional paradigms.

Entropy•Sep 18, 2025•2 citations

Mediative Fuzzy Logic: From Type-1 Foundations to Type-2, Type-3 and Quantum Extensions

Oscar Montiel Ross

Mediative Fuzzy Logic was conceived as a practical scheme for reconciling hesitant or conflicting assessments in fuzzy control and decision-making. However, its logical and semantic foundations remain underdeveloped, especially beyond operational type-1 settings. This article develops a unified account of the type-1 core together with interval type-2, granular type-3, and quantum extensions. We characterize the mediative operator as a convex aggregation controlled by hesitation and contradiction, model mediative truth values as independent truth-falsity pairs in a continuous bilattice-like structure, and introduce a propositional system extending a standard t-norm-based fuzzy logic with a mediative connective. We establish soundness, paraconsistency, and conservativity over the underlying fuzzy base for formulas without mediation, and formulate coherent semantic extensions to interval type-2 truth values, granule-indexed local evaluations, and effects and density operators on Hilbert spaces. An autonomous-braking sensor-fusion example illustrates how the framework supports transparent, conservative, and safety-first decisions under incomplete, heterogeneous, and mildly contradictory evidence. Under suitable assumptions, the higher-level formulations reduce to the type-1 case, clarifying coherence across levels and reliably supporting future work in intelligent decision systems.

cs.AICross-listedarXiv:2605.22900•May 22, 2026

Quantum Computing Paradigms—Bridging Foundational Quantum Mechanics with Contemporary Computational Architectures

K. Reddy Madhavi, Sam Goundar, K. Saradhi +2 more

Principles and postulates of quantum mechanics underlay general development in quantum computer systems. Quantum processes like superposition, entanglement, and tunneling underlay quantum computational regimes. Theory in quantum computer technology is consolidated in this chapter by bringing together theoretical quantum mechanical model mathematics, such as density matrices and quantum theory of measurement, and extending them to current technical tools in quantum computer technology application. Specific current interest is with respect to stabilizing quantum system coherence in terms of dimensions, steps toward implementing error correction codes, and building quantum networks resilient to faults. Background for theoretical quantum algorithm classification, such as analysis of quantum Fourier transforms and quantum phase estimation in terms of challenge in noisy intermediate-scale quantum (NISQ) times, is part of this chapter. By exploring theoretical background and engineering application, direction of development for quantum computer systems, and possible paradigm shifts in a range of sciences brought about through quantum computer systems, a futuristic perspective for traditional and future quantum architectures is part of conclusion, with a view to development and possibility in the field.

CRC Press eBooks•Nov 28, 2025•0 citations
This paper develops the foundations of Quantum Granular Computing (QGC), extending classical granular computing including fuzzy, rough, and shadowed granules to the quantum regime. Quantum granules are modeled as effects on a finite dimensional Hilbert space, so granular memberships are given by Born probabilities. This operator theoretic viewpoint provides a common language for sharp (projective) and soft (nonprojective) granules and embeds granulation directly into the standard formalism of quantum information theory. We establish foundational results for effect based quantum granules, including normalization and monotonicity properties, the emergence of Boolean islands from commuting families, granular refinement under Luders updates, and the evolution of granules under quantum channels via the adjoint channel in the Heisenberg picture. We connect QGC with quantum detection and estimation theory by interpreting the effect operators realizing Helstrom minimum error measurement for binary state discrimination as Helstrom type decision granules, i.e., soft quantum counterparts of Bayes optimal decision regions. Building on these results, we introduce Quantum Granular Decision Systems (QGDS) with three reference architectures that specify how quantum granules can be defined, learned, and integrated with classical components while remaining compatible with near term quantum hardware. Case studies on qubit granulation, two qubit parity effects, and Helstrom style soft decisions illustrate how QGC reproduces fuzzy like graded memberships and smooth decision boundaries while exploiting noncommutativity, contextuality, and entanglement. The framework thus provides a unified and mathematically grounded basis for operator valued granules in quantum information processing, granular reasoning, and intelligent systems.
This paper examines how logical structures represent sharp and unsharp propositions in classical and quantum systems. Classical sharp logic is modeled by Boolean algebras, where propositions have bivalent truth values, complements are globally defined, and distributivity holds. Quantum sharp logic is modeled by orthomodular lattices of closed Hilbert-space subspaces or projection operators; it retains definite yes–no outcomes for ideal measurements but rejects the Boolean assumptions of global truth valuation and distributivity. Classical unsharp logic uses fuzzy membership or probabilistic truth values to describe vagueness and incomplete information, whereas quantum unsharp logic is expressed through effects and effect algebras, which capture noisy, inefficient, and generalized measurements. The paper’s central question is which algebraic structure is appropriate for each combination of classical or quantum behavior and sharp or unsharp measurement. The analysis shows that the four cases form a coherent hierarchy: Boolean algebras describe deterministic classical events, orthomodular lattices describe ideal quantum propositions, fuzzy or probabilistic models describe classical partial truth, and effect algebras describe realistic quantum effects. This classification clarifies the mathematical and physical role of unsharpness and explains why effect algebras are needed beyond projection-based quantum logic.
This work presents a comprehensive and rigorous examination of quantum computing, spanning its mathematical foundations, physical principles, algorithmic developments, hardware architectures, and philosophical implications. Beginning with linear algebra over Hilbert spaces and the postulates of quantum mechanics, the manuscript develops the formal structure of quantum information theory, including qubits, entanglement, quantum channels, and noise models. The work provides in-depth treatments of the quantum circuit model, alternative computation paradigms such as measurement-based, adiabatic, and topological quantum computation, and the theoretical framework of quantum error correction, including stabilizer and surface codes. Foundational and modern quantum algorithms are analysed in detail, including Shor’s factoring algorithm, Grover’s search, variational quantum eigensolvers, QAOA, and emerging quantum machine learning approaches. Beyond algorithms and implementations, the manuscript addresses scalability challenges, fault tolerance, computational complexity limits, and the implications of quantum computing for cryptography and the extended Church–Turing thesis. The concluding sections explore philosophical questions concerning interpretation, measurement, and the relationship between computation and physical reality. This work is intended as both a reference text and a research-level synthesis for advanced students, researchers, and practitioners in quantum computing, theoretical computer science, and quantum physics.
Classical computing architectures encode information into discrete binary digits residing in isolated regions of phase space. Quantum computing replaces this paradigm by leveraging complex state vectors defined within continuous, multi-dimensional Hilbert spaces. This paper provides a unified mathematical framework examining finite-dimensional Hilbert spaces in quantum information processing. It traces the structural scaling of quantum state spaces from single-qubit systems up through composite tensor product structures and multi-qubit registers. By detailing computational basis representations, state transformations, probability amplitudes, and multipartite entanglement classes, such as Bell, GHZ, and W states, this paper demonstrates how exponential dimensional scaling enables quantum parallelism while presenting computational barriers to classical simulation.
In this work, we propose a novel quantum-informed epistemic framework that extends the classical notion of probability by integrating plausibility, credibility, and possibility as distinct yet complementary measures of uncertainty. This enriched quadruple (P, Pl, Cr, Ps) enables a deeper characterization of quantum systems and decision-making processes under partial, noisy, or ambiguous information. Our formalism generalizes the Born rule within a multi-valued logic structure, linking Positive Operator-Valued Measures (POVMs) with data-driven plausibility estimators, agent-based credibility priors, and fuzzy-theoretic possibility functions. We develop a hybrid classical-quantum inference engine that computes a vectorial aggregation of the quadruples, enhancing robustness and semantic expressivity in contexts where classical probability fails to capture non-Kolmogorovian phenomena such as entanglement, contextuality, or decoherence. The approach is validated through three real-world application domains-quantum cybersecurity, quantum AI, and financial computing-where the proposed model outperforms standard probabilistic reasoning in terms of accuracy, resilience to noise, interpretability, and decision stability. Comparative analysis against QBism, Dempster-Shafer, and fuzzy quantum logic further demonstrates the uniqueness of architecture in both operational semantics and practical outcomes. This contribution lays the groundwork for a new theory of epistemic quantum computing capable of modelling and acting under uncertainty beyond traditional paradigms.
Mediative Fuzzy Logic was conceived as a practical scheme for reconciling hesitant or conflicting assessments in fuzzy control and decision-making. However, its logical and semantic foundations remain underdeveloped, especially beyond operational type-1 settings. This article develops a unified account of the type-1 core together with interval type-2, granular type-3, and quantum extensions. We characterize the mediative operator as a convex aggregation controlled by hesitation and contradiction, model mediative truth values as independent truth-falsity pairs in a continuous bilattice-like structure, and introduce a propositional system extending a standard t-norm-based fuzzy logic with a mediative connective. We establish soundness, paraconsistency, and conservativity over the underlying fuzzy base for formulas without mediation, and formulate coherent semantic extensions to interval type-2 truth values, granule-indexed local evaluations, and effects and density operators on Hilbert spaces. An autonomous-braking sensor-fusion example illustrates how the framework supports transparent, conservative, and safety-first decisions under incomplete, heterogeneous, and mildly contradictory evidence. Under suitable assumptions, the higher-level formulations reduce to the type-1 case, clarifying coherence across levels and reliably supporting future work in intelligent decision systems.
Principles and postulates of quantum mechanics underlay general development in quantum computer systems. Quantum processes like superposition, entanglement, and tunneling underlay quantum computational regimes. Theory in quantum computer technology is consolidated in this chapter by bringing together theoretical quantum mechanical model mathematics, such as density matrices and quantum theory of measurement, and extending them to current technical tools in quantum computer technology application. Specific current interest is with respect to stabilizing quantum system coherence in terms of dimensions, steps toward implementing error correction codes, and building quantum networks resilient to faults. Background for theoretical quantum algorithm classification, such as analysis of quantum Fourier transforms and quantum phase estimation in terms of challenge in noisy intermediate-scale quantum (NISQ) times, is part of this chapter. By exploring theoretical background and engineering application, direction of development for quantum computer systems, and possible paradigm shifts in a range of sciences brought about through quantum computer systems, a futuristic perspective for traditional and future quantum architectures is part of conclusion, with a view to development and possibility in the field.