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

Journal of Mathematical Psychology

Deciding by quantum-like belief morphing or hopping?Its application to multi-agent response influence

Jan Broekaert, Thomas O. Hancock, Faizal M.F. Hafiz, Stephane Hess, Davide La Torre

Published Jun 11, 2026• 0 citations
Publisher
DOI
10.1016/j.jmp.2026.102994

Related papers

Deciding by quantum-like belief morphing or hopping?

Jan Broekaert

Other people's beliefs may influence our own beliefs. Such effects, sometimes referred to as 'crowd-wisdom', can be revealed from group-informed responses in controlled experiments. Our study presents a formal choice model to understand how multiple respondents iteratively interact when communicating their responses, which we test on data from Granovskiy et al. (2015)'s social information experiment. In this multi-stage decision process, information from the group's response distribution influences individual judgments before respondents adjust their next response. Our model describes each respondent's probabilistic belief state, and uses a quantum-like morphing evolution based on the Brassard-Høyer-Grover amplification formalism. This framework enables: (i) the description of multi-respondent cognitive interactions through assimilation to or polarization away from other beliefs, (ii) the implementation via Hamiltonian operators using projection operators of source ('initial') and target ('informing') belief states, and (iii) the resolution of periodicity issues in previous Schrödinger-like models through through bounded temporal parametrization. A performance comparison is done for the quantum-like models using morphing and standard hopping, and a classical Markov hopping model. The quantum-like morphing model with multi-component target belief demonstrated superior BIC performance across the parameter space of evolution time (tfrac), belief uncertainty (SD), and sampling temperature (T). This belief morphing approach hence provides an effective and innovative method to model social influence in group decision-making.

•Jan 20, 2026•0 citations

Quantum-inspired ensemble approach to multi-attributed and multi-agent decision-making

Ishwarya M.S., Aswani Kumar Cherukuri

Applied Soft Computing•Mar 18, 2021•23 citations

Challenge-Response Quantum Reinforcement Learning with Application to Quantum-Assisted Authentication

Jawaher Kaldari, Saif Al-Kuwari

Quantum reinforcement learning (QRL) has emerged as a promising research direction that integrates quantum information processing into reinforcement learning frameworks. While many existing QRL studies apply quantum agents to classical environments, it has been realized that the potential advantages of QRL are most naturally explored in environments that exhibit intrinsically quantum characteristics, where the agent's observations and interactions arise from quantum processes. In this work, we propose a quantum reinforcement learning environment formulated as a challenge-response task with hidden information. In the proposed environment, Alice encodes a classical bit into the parameters of a quantum circuit, while Bob, with a trained reinforcement learning agent, interacts with a limited number of quantum state copies to infer the hidden bit. The agent must select measurement strategies and decide when to terminate the interaction under explicit resource constraints. To study the solvability of the proposed environment, we consider three agents: a purely classical agent, a lightweight hybrid agent and a deep hybrid agent. Through experiments, we analyze the trade-off between inference accuracy and quantum resource consumption under varying interaction penalties. Our results show that the lightweight hybrid agent achieves reliable inference using as few as two quantum state copies, outperforming both the classical baseline and the deep hybrid agent across both high and low-penalty regimes. We further evaluate robustness under realistic quantum noise models and discuss the relevance of the proposed environment for security-oriented applications, including quantum-assisted authentication.

quant-pharXiv:2602.12464•Feb 16, 2026•0 citations

Quantum Decision Making by Social Agents

Vyacheslav I. Yukalov, Didier Sornette

•Jan 1, 2012•8 citations

Challenge-response quantum reinforcement learning with application to quantum-assisted authentication

Jawaher Kaldari, Saif M. Al-Kuwari

Abstract Quantum reinforcement learning (QRL) has emerged as a promising research direction that integrates quantum information processing into reinforcement learning frameworks. While many existing QRL studies apply quantum agents to classical environments, it has been realized that the potential advantages of QRL are most naturally explored in environments that exhibit intrinsically quantum characteristics, where the agent’s observations and interactions arise from quantum processes. In this work, we propose a quantum reinforcement learning environment formulated as a challenge-response task with hidden information. In the proposed environment, Alice encodes a classical bit into the parameters of a quantum circuit, while Bob, with a trained reinforcement learning agent, interacts with a limited number of quantum state copies to infer the hidden bit. The agent must select measurement strategies and decide when to terminate the interaction under explicit resource constraints. To study the solvability of the proposed environment, we consider three agents: a purely classical agent, a lightweight hybrid agent and a deep hybrid agent. Through experiments, we analyze the trade-off between inference accuracy and quantum resource consumption under varying interaction penalties. Our results show that the lightweight hybrid agent achieves reliable inference using as few as two quantum state copies, outperforming both the classical baseline and the deep hybrid agent across both high and low-penalty regimes. We further evaluate robustness under realistic quantum noise models and discuss the relevance of the proposed environment for security-oriented applications, including quantum-assisted authentication.

Quantum Machine Intelligence•Aug 3, 2026•0 citations

A survey of quantum-like approaches to decision making and cognition

Mehrdad Ashtiani, Mohammad Abdollahi Azgomi

Mathematical Social Sciences•Mar 3, 2015•96 citations
Other people's beliefs may influence our own beliefs. Such effects, sometimes referred to as 'crowd-wisdom', can be revealed from group-informed responses in controlled experiments. Our study presents a formal choice model to understand how multiple respondents iteratively interact when communicating their responses, which we test on data from Granovskiy et al. (2015)'s social information experiment. In this multi-stage decision process, information from the group's response distribution influences individual judgments before respondents adjust their next response. Our model describes each respondent's probabilistic belief state, and uses a quantum-like morphing evolution based on the Brassard-Høyer-Grover amplification formalism. This framework enables: (i) the description of multi-respondent cognitive interactions through assimilation to or polarization away from other beliefs, (ii) the implementation via Hamiltonian operators using projection operators of source ('initial') and target ('informing') belief states, and (iii) the resolution of periodicity issues in previous Schrödinger-like models through through bounded temporal parametrization. A performance comparison is done for the quantum-like models using morphing and standard hopping, and a classical Markov hopping model. The quantum-like morphing model with multi-component target belief demonstrated superior BIC performance across the parameter space of evolution time (tfrac), belief uncertainty (SD), and sampling temperature (T). This belief morphing approach hence provides an effective and innovative method to model social influence in group decision-making.
Quantum reinforcement learning (QRL) has emerged as a promising research direction that integrates quantum information processing into reinforcement learning frameworks. While many existing QRL studies apply quantum agents to classical environments, it has been realized that the potential advantages of QRL are most naturally explored in environments that exhibit intrinsically quantum characteristics, where the agent's observations and interactions arise from quantum processes. In this work, we propose a quantum reinforcement learning environment formulated as a challenge-response task with hidden information. In the proposed environment, Alice encodes a classical bit into the parameters of a quantum circuit, while Bob, with a trained reinforcement learning agent, interacts with a limited number of quantum state copies to infer the hidden bit. The agent must select measurement strategies and decide when to terminate the interaction under explicit resource constraints. To study the solvability of the proposed environment, we consider three agents: a purely classical agent, a lightweight hybrid agent and a deep hybrid agent. Through experiments, we analyze the trade-off between inference accuracy and quantum resource consumption under varying interaction penalties. Our results show that the lightweight hybrid agent achieves reliable inference using as few as two quantum state copies, outperforming both the classical baseline and the deep hybrid agent across both high and low-penalty regimes. We further evaluate robustness under realistic quantum noise models and discuss the relevance of the proposed environment for security-oriented applications, including quantum-assisted authentication.
Abstract Quantum reinforcement learning (QRL) has emerged as a promising research direction that integrates quantum information processing into reinforcement learning frameworks. While many existing QRL studies apply quantum agents to classical environments, it has been realized that the potential advantages of QRL are most naturally explored in environments that exhibit intrinsically quantum characteristics, where the agent’s observations and interactions arise from quantum processes. In this work, we propose a quantum reinforcement learning environment formulated as a challenge-response task with hidden information. In the proposed environment, Alice encodes a classical bit into the parameters of a quantum circuit, while Bob, with a trained reinforcement learning agent, interacts with a limited number of quantum state copies to infer the hidden bit. The agent must select measurement strategies and decide when to terminate the interaction under explicit resource constraints. To study the solvability of the proposed environment, we consider three agents: a purely classical agent, a lightweight hybrid agent and a deep hybrid agent. Through experiments, we analyze the trade-off between inference accuracy and quantum resource consumption under varying interaction penalties. Our results show that the lightweight hybrid agent achieves reliable inference using as few as two quantum state copies, outperforming both the classical baseline and the deep hybrid agent across both high and low-penalty regimes. We further evaluate robustness under realistic quantum noise models and discuss the relevance of the proposed environment for security-oriented applications, including quantum-assisted authentication.