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

Cambridge University Press eBooks

Quantum reasoning

Robert B. Griffiths

Published Nov 29, 2001• 0 citations
Publisher
DOI
10.1017/cbo9780511606052.017

Related papers

Knowledge Graph Reasoning with Quantum-Inspired Reinforcement Learning

Junliang Chen, Xianchao Zhang, Fengsong Sun +1 more

Knowledge reasoning is a critical task in information fusion systems, and its core step is reasoning missing information from existing facts to improve the knowledge graphs. Embedding-based reasoning methods and path-based reasoning methods are two mainstream knowledge reasoning methods. Embedding-based reasoning methods enable fast and direct reasoning but are limited to simple relationships between entities and exhibit poor performance in reasoning complex logical relationships. Path-based reasoning methods perform better in complex reasoning tasks, but suffer from high computational complexity, a large number of model parameters, and low reasoning efficiency. To address the aforementioned issues, this paper introduces a knowledge reasoning model called Quantum-Inspired Reinforcement Learning (QIRL). QIRL leverages quantum reinforcement learning to train a strategy network via a quantum circuit, aiming to generate and optimize reasoning paths. Quantum circuit achieves complex nonlinear operations through limited quantum reasoning paths gate operations, reducing computational complexity. In addition, this article utilizes the quantum entanglement property to encode high-dimensional data, reducing the number of model training parameters. This article evaluates the QIRL method on entity prediction task and proves that the QIRL method can effectively reduce the number of model training parameters.

Chinese journal of information fusion.•May 25, 2025•1 citation

Reasoning About Quantum Knowledge

Ellie D’Hondt, Prakash Panangaden

Lecture notes in computer science•Jan 1, 2005•11 citations

Reasoning About Quantum Systems

Paulo Mateus, Amílcar Sernadas

Lecture notes in computer science•Jan 1, 2004•23 citations

Quantum Circuit Reasoning Models: A Variational Framework for Differentiable Logical Inference

Andrew Kiruluta

This report introduces a novel class of reasoning architectures, termed Quantum Circuit Reasoning Models (QCRM), which extend the concept of Variational Quantum Circuits (VQC) from energy minimization and classification tasks to structured logical inference and reasoning. We posit that fundamental quantum mechanical operations, superposition, entanglement, interference, and measurement, naturally map to essential reasoning primitives such as hypothesis branching, constraint propagation, consistency enforcement, and decision making. The resulting framework combines quantum-inspired computation with differentiable optimization, enabling reasoning to emerge as a process of amplitude evolution and interference-driven selection of self-consistent states. We develop the mathematical foundation of QCRM, define its parameterized circuit architecture, and show how logical rules can be encoded as unitary transformations over proposition-qubit states. We further formalize a training objective grounded in classical gradient descent over circuit parameters and discuss simulation-based implementations on classical hardware. Finally, we propose the Quantum Reasoning Layer (QRL) as a differentiable hybrid component for composable reasoning models applicable to scientific, biomedical, and chemical inference domains.

quant-pharXiv:2512.07871•Nov 28, 2025•1 citation

Quantum-Inspired Relational Reasoning

Jincheng Zhang

This paper introduces a novel approach to relational reasoning, termed Quantum-Inspired Relational Reasoning (QIRR). QIRR leverages principles inspired by quantum mechanics, specifically superposition and interference, to model and reason with complex relational data, such as those found in databases and knowledge graphs. Unlike traditional relational algebra which operates on definite relationships, QIRR represents relationships as probabilistic amplitudes. This allows for the simultaneous consideration of multiple potential connections between entities, factoring in their correlations and interferences. Inference is then performed by simulating the resulting quantum interference patterns, effectively identifying the most probable relationships. We argue that this approach has the potential to significantly improve query performance and reasoning capabilities in scenarios with intricate relational structures, offering a paradigm shift from the limitations of classical methods. The core idea is to treat relationships as quantum states, allowing for parallel exploration and interference, mimicking quantum computation's ability to explore multiple possibilities concurrently. This work outlines the theoretical foundations, the proposed mathematical framework, and the potential implications of QIRR. ---

•Aug 31, 2026•0 citations

Quantum Logic

Peter Mittelstaedt

Springer eBooks•Jan 1, 1978•0 citations
Knowledge reasoning is a critical task in information fusion systems, and its core step is reasoning missing information from existing facts to improve the knowledge graphs. Embedding-based reasoning methods and path-based reasoning methods are two mainstream knowledge reasoning methods. Embedding-based reasoning methods enable fast and direct reasoning but are limited to simple relationships between entities and exhibit poor performance in reasoning complex logical relationships. Path-based reasoning methods perform better in complex reasoning tasks, but suffer from high computational complexity, a large number of model parameters, and low reasoning efficiency. To address the aforementioned issues, this paper introduces a knowledge reasoning model called Quantum-Inspired Reinforcement Learning (QIRL). QIRL leverages quantum reinforcement learning to train a strategy network via a quantum circuit, aiming to generate and optimize reasoning paths. Quantum circuit achieves complex nonlinear operations through limited quantum reasoning paths gate operations, reducing computational complexity. In addition, this article utilizes the quantum entanglement property to encode high-dimensional data, reducing the number of model training parameters. This article evaluates the QIRL method on entity prediction task and proves that the QIRL method can effectively reduce the number of model training parameters.
This report introduces a novel class of reasoning architectures, termed Quantum Circuit Reasoning Models (QCRM), which extend the concept of Variational Quantum Circuits (VQC) from energy minimization and classification tasks to structured logical inference and reasoning. We posit that fundamental quantum mechanical operations, superposition, entanglement, interference, and measurement, naturally map to essential reasoning primitives such as hypothesis branching, constraint propagation, consistency enforcement, and decision making. The resulting framework combines quantum-inspired computation with differentiable optimization, enabling reasoning to emerge as a process of amplitude evolution and interference-driven selection of self-consistent states. We develop the mathematical foundation of QCRM, define its parameterized circuit architecture, and show how logical rules can be encoded as unitary transformations over proposition-qubit states. We further formalize a training objective grounded in classical gradient descent over circuit parameters and discuss simulation-based implementations on classical hardware. Finally, we propose the Quantum Reasoning Layer (QRL) as a differentiable hybrid component for composable reasoning models applicable to scientific, biomedical, and chemical inference domains.
This paper introduces a novel approach to relational reasoning, termed Quantum-Inspired Relational Reasoning (QIRR). QIRR leverages principles inspired by quantum mechanics, specifically superposition and interference, to model and reason with complex relational data, such as those found in databases and knowledge graphs. Unlike traditional relational algebra which operates on definite relationships, QIRR represents relationships as probabilistic amplitudes. This allows for the simultaneous consideration of multiple potential connections between entities, factoring in their correlations and interferences. Inference is then performed by simulating the resulting quantum interference patterns, effectively identifying the most probable relationships. We argue that this approach has the potential to significantly improve query performance and reasoning capabilities in scenarios with intricate relational structures, offering a paradigm shift from the limitations of classical methods. The core idea is to treat relationships as quantum states, allowing for parallel exploration and interference, mimicking quantum computation's ability to explore multiple possibilities concurrently. This work outlines the theoretical foundations, the proposed mathematical framework, and the potential implications of QIRR. ---