Discrimination against or in favor of qubits in quantum theory

• URL: http://arxiv.org/abs/2004.04313v1
• Date: Thu, 9 Apr 2020 01:06:10 GMT
• Title: Discrimination against or in favor of qubits in quantum theory
• Authors: Arkady Bolotin
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Within context of 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. In the paper, it is demonstrated that such a model (that can be called a quantum parallel random-access machine, QPRAM) is quantum mechanically plausible.

Related papers

• Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits [1.151731504874944]
  We prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits.
  arXiv  Detail & Related papers  (2024-09-27T03:18:28Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• A simple formulation of no-cloning and no-hiding that admits efficient and robust verification [0.0]
  Incompatibility is a feature of quantum theory that sets it apart from classical theory. The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox. We formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification.
  arXiv  Detail & Related papers  (2023-03-05T12:48:11Z)
• 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)
• 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)
• Stochastic emulation of quantum algorithms [0.0]
  We introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares basic properties of quantum mechanical states needed for a quantum algorithm. We prove that the propagation via the map built from those universal maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of emulation.
  arXiv  Detail & Related papers  (2021-09-16T07:54:31Z)
• 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)
• 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)
• 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)
• Quantum Probability's Algebraic Origin [0.0]
  We show that quantum probabilities and classical probabilities have very different origins. A transition probability that differs from 0 and 1 manifests the typical quantum indeterminacy. It provides an unexpected access to these quantum probabilities that does not rely on states or wave functions.
  arXiv  Detail & Related papers  (2020-09-17T18:19:41Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.