Quantum Circuit Components for Cognitive Decision-Making

• URL: http://arxiv.org/abs/2302.03012v3
• Date: Thu, 23 Mar 2023 19:55:55 GMT
• Title: Quantum Circuit Components for Cognitive Decision-Making
• Authors: Dominic Widdows, Jyoti Rani, Emmanuel Pothos
• Abstract summary: This paper demonstrates that some non-classical models of human decision-making can be run successfully as circuits on quantum computers. The claim is not that the human brain uses qubits and quantum circuits explicitly, but that the mathematics shared between quantum cognition and quantum computing motivates the exploration of quantum computers for cognition modeling.
• Score: 0.12891210250935145
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper demonstrates that some non-classical models of human decision-making can be run successfully as circuits on quantum computers. Since the 1960s, many observed cognitive behaviors have been shown to violate rules based on classical probability and set theory. For example, the order in which questions are posed in a survey affects whether participants answer 'yes' or 'no', so the population that answers 'yes' to both questions cannot be modeled as the intersection of two fixed sets. It can, however, be modeled as a sequence of projections carried out in different orders. This and other examples have been described successfully using quantum probability, which relies on comparing angles between subspaces rather than volumes between subsets. Now in the early 2020s, quantum computers have reached the point where some of these quantum cognitive models can be implemented and investigated on quantum hardware, by representing the mental states in qubit registers, and the cognitive operations and decisions using different gates and measurements. This paper develops such quantum circuit representations for quantum cognitive models, focusing particularly on modeling order effects and decision-making under uncertainty. The claim is not that the human brain uses qubits and quantum circuits explicitly (just like the use of Boolean set theory does not require the brain to be using classical bits), but that the mathematics shared between quantum cognition and quantum computing motivates the exploration of quantum computers for cognition modeling. Key quantum properties include superposition, entanglement, and collapse, as these mathematical elements provide a common language between cognitive models, quantum hardware, and circuit implementations.

Related papers

• Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
  We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer. The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
  arXiv  Detail & Related papers  (2024-03-25T15:47:35Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Visualizing Quantum Circuit Probability -- estimating computational action for quantum program synthesis [0.0]
  The probability of states in the circuit model of computation is defined. The reachability and expressibility in a space-time-bounded setting for classical and quantum gate sets are enumerated and visualized. The article suggests how applications like geometric quantum machine learning, novel quantum algorithm and quantum artificial general intelligence can benefit from studying circuit probabilities.
  arXiv  Detail & Related papers  (2023-04-05T10:49:36Z)
• A Quantum-Classical Model of Brain Dynamics [62.997667081978825]
  Mixed Weyl symbol is used to describe brain processes at the microscopic level. Electromagnetic fields and phonon modes involved in the processes are treated either classically or semi-classically. Zero-point quantum effects can be incorporated into numerical simulations by controlling the temperature of each field mode.
  arXiv  Detail & Related papers  (2023-01-17T15:16:21Z)
• Experimental verification of the quantum nature of a neural network [0.0]
  I discuss what makes a system quantum and to what extent we can interpret a neural network as having quantum remnants. I suggest a possible experiment that could extract entanglement from the quantum functioning rules (maps) of an otherwise classical neural network.
  arXiv  Detail & Related papers  (2022-08-23T06:33:59Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Tossing Quantum Coins and Dice [0.0]
  This case is an important example of a quantum procedure because it presents a typical framework employed in quantum information processing and quantum computing. The emphasis is on the clarification of the difference between quantum and classical conditional probabilities.
  arXiv  Detail & Related papers  (2021-03-31T11:39:56Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Operational Resource Theory of Imaginarity [48.7576911714538]
  We show that quantum states are easier to create and manipulate if they only have real elements. As an application, we show that imaginarity plays a crucial role for state discrimination.
  arXiv  Detail & Related papers  (2020-07-29T14:03:38Z)
• Characterization of the probabilistic models that can be embedded in quantum theory [0.0]
  We show that only classical and standard quantum theory with superselection rules can arise from a physical decoherence map. Our results have significant consequences for some experimental tests of quantum theory, by clarifying how they could (or could not) falsify it.
  arXiv  Detail & Related papers  (2020-04-13T18:09:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.