Tossing Quantum Coins and Dice

• URL: http://arxiv.org/abs/2103.17007v1
• Date: Wed, 31 Mar 2021 11:39:56 GMT
• Title: Tossing Quantum Coins and Dice
• Authors: V.I. Yukalov
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The procedure of tossing quantum coins and dice is described. 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. These probabilities are designed for characterizing different systems, either quantum or classical, and they, generally, cannot be reduced to each other. Thus the L\"{u}ders probability cannot be treated as a generalization of the classical conditional probability. The analogies between quantum theory of measurements and quantum decision theory are elucidated.

Related papers

• The Hidden Ontological Variable in Quantum Harmonic Oscillators [0.0]
  The standard quantum mechanical harmonic oscillator has an exact, dual relationship with a completely classical system. One finds that, where the classical system always obeys the rule "probability in = probability out", the same probabilities are quantum probabilities in the quantum system.
  arXiv  Detail & Related papers  (2024-07-25T16:05:18Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum Circuit Components for Cognitive Decision-Making [0.12891210250935145]
  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.
  arXiv  Detail & Related papers  (2023-02-06T18:52:10Z)
• Why we should interpret density matrices as moment matrices: the case of (in)distinguishable particles and the emergence of classical reality [69.62715388742298]
  We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs) We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way. We will show that finitely exchangeable probabilities for a classical dice are as weird as QT.
  arXiv  Detail & Related papers  (2022-03-08T14:47:39Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Quantum indistinguishability through exchangeable desirable gambles [69.62715388742298]
  Two particles are identical if all their intrinsic properties, such as spin and charge, are the same. Quantum mechanics is seen as a normative and algorithmic theory guiding an agent to assess her subjective beliefs represented as (coherent) sets of gambles. We show how sets of exchangeable observables (gambles) may be updated after a measurement and discuss the issue of defining entanglement for indistinguishable particle systems.
  arXiv  Detail & Related papers  (2021-05-10T13:11:59Z)
• Macroscopic randomness for quantum entanglement generation [0.0]
  Quantum entanglement between two or more bipartite entities is a core concept in quantum information areas. This paper presents a pure classical method of on-demand entangled light-pair generation.
  arXiv  Detail & Related papers  (2021-03-04T07:58:49Z)
• 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)
• Discrimination against or in favor of qubits in quantum theory [0.0]
  In quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit probabilities having only values 0 and 1. The present paper shows that erasing qubit discrimination leads to a model of computation which permits execution of many primitive operations in a massive parallel way.
  arXiv  Detail & Related papers  (2020-04-09T01:06:10Z)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)

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.