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

arXiv:quant-ph/0204075 · Lecture notes in computer science

Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations

Masami Amano, Kazuo Iwama, Rudy Raymond Harry Putra

Published Jan 1, 2002• 1 citation
arXivHTMLPDF
DOI
10.1007/3-540-45833-6_9

Related papers

Quantum Topology: A Probabilistic Computing Framework

Jincheng Zhang

Quantum topology, a fascinating and largely unexplored field, offers a unique perspective on the properties of spacetime and its implications for computation. This paper introduces a probabilistic computing framework predicated on the inherent properties of quantum topology, designed to efficiently calculate the probability of various quantum systems. We propose a novel algorithm leveraging quantum topology to provide a computationally effective method for optimization and simulation within the quantum realm. The core mechanism centers around exploiting the topological structure of quantum systems to guide the calculation of probabilities, offering a significant advancement over existing approaches. This work explores the potential of this framework for enhancing quantum algorithms and providing a robust foundation for quantum-enhanced computation.

•Sep 2, 2026•0 citations

Simulations of Probabilities for Quantum Computing

Michail A. Zak

•Jan 1, 1996•0 citations

Advanced Quantum Probability Applications

Jerome R. Busemeyer, Peter Bruza

Cambridge University Press eBooks•Nov 14, 2024•0 citations

Based on Quantum Entanglement: Adaptive Probability Models

Jincheng Zhang

This paper investigates a novel probabilistic model leveraging quantum entanglement to dynamically adjust probability distributions within a system. We propose a framework that allows the model to adapt to changing system states, resulting in enhanced accuracy and computational efficiency compared to traditional approaches. The core mechanism involves exploiting the inherent correlations within entangled states to create a self-correcting probability function. This research explores the potential of quantum entanglement for optimizing probabilistic calculations, offering a promising path towards more robust and efficient computation.

•Sep 3, 2026•0 citations

A Quantum Probabilistic Comparator: Circuit Implementation

Linh Nguyen, Zhenhua Jiang

Decision making in stochastic autonomous systems, which considers uncertainty of many factors, is always a challenge. The problem can typically be addressed by probabilistic methods such as approximate stochastic optimization or Monte Carlo (MC) simulation. The potential solution may usually be constrained by the system's computing power, due to the size of the probabilistic problem. This paper aims to present and implement a quantum probabilistic comparison (QPC) algorithm that can help to find a desired solution or make decision between two random variables under uncertainty. This approach takes advantage of quantum computing to perform parallel comparison and fast calculation of the probability of matched state vectors. In the presented scheme, two random variables have different values (e.g., 2, 4, 8, or more values) and different probability distributions. The data of the variables are encoded to the basis states of the corresponding qubits. The quantum probabilistic comparator is used to make up the quantum output matrix that stores the comparison solutions as well as their probability probabilities. Moreover, unlike the existing quantum comparator algorithm, which uses bit string comparison approaches, the proposed probabilistic comparator is not only comparing the basis state, but also accumulating the outcome's probabilities. The calculation results of the quantum probabilistic comparator circuit are compared with those from classical computation and quantum circuit simulation as well as on an IBM quantum computer, for analysis and verification.

IEEE National Aerospace and Electronics Conference (NAECON)•Aug 28, 2023•2 citations

Quantum Probability for Probabilists

P. A. Meyer

Lecture notes in mathematics•Jan 1, 1995•163 citations
Quantum topology, a fascinating and largely unexplored field, offers a unique perspective on the properties of spacetime and its implications for computation. This paper introduces a probabilistic computing framework predicated on the inherent properties of quantum topology, designed to efficiently calculate the probability of various quantum systems. We propose a novel algorithm leveraging quantum topology to provide a computationally effective method for optimization and simulation within the quantum realm. The core mechanism centers around exploiting the topological structure of quantum systems to guide the calculation of probabilities, offering a significant advancement over existing approaches. This work explores the potential of this framework for enhancing quantum algorithms and providing a robust foundation for quantum-enhanced computation.
This paper investigates a novel probabilistic model leveraging quantum entanglement to dynamically adjust probability distributions within a system. We propose a framework that allows the model to adapt to changing system states, resulting in enhanced accuracy and computational efficiency compared to traditional approaches. The core mechanism involves exploiting the inherent correlations within entangled states to create a self-correcting probability function. This research explores the potential of quantum entanglement for optimizing probabilistic calculations, offering a promising path towards more robust and efficient computation.
Decision making in stochastic autonomous systems, which considers uncertainty of many factors, is always a challenge. The problem can typically be addressed by probabilistic methods such as approximate stochastic optimization or Monte Carlo (MC) simulation. The potential solution may usually be constrained by the system's computing power, due to the size of the probabilistic problem. This paper aims to present and implement a quantum probabilistic comparison (QPC) algorithm that can help to find a desired solution or make decision between two random variables under uncertainty. This approach takes advantage of quantum computing to perform parallel comparison and fast calculation of the probability of matched state vectors. In the presented scheme, two random variables have different values (e.g., 2, 4, 8, or more values) and different probability distributions. The data of the variables are encoded to the basis states of the corresponding qubits. The quantum probabilistic comparator is used to make up the quantum output matrix that stores the comparison solutions as well as their probability probabilities. Moreover, unlike the existing quantum comparator algorithm, which uses bit string comparison approaches, the proposed probabilistic comparator is not only comparing the basis state, but also accumulating the outcome's probabilities. The calculation results of the quantum probabilistic comparator circuit are compared with those from classical computation and quantum circuit simulation as well as on an IBM quantum computer, for analysis and verification.