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:0906.2157 · International Journal of Theoretical Physics

On Consistency of the Quantum-Like Representation Algorithm

Peter Nyman

Published Nov 3, 2009• 5 citations
arXivHTMLPDF
DOI
10.1007/s10773-009-0171-2

Related papers

On the Consistency of the Quantum-Like Representation Algorithm for Hyperbolic Interference

Peter Nyman

arXiv:1009.1744•Advances in Applied Clifford Algebras•Mar 16, 2011•9 citations

On quantum computational algorithms

이수준

•Jan 1, 2002•0 citations

On consistency of the quantum-like representation algorithm

Peter Nyman

In this paper we continue to study so called “inverse Born’s rule problem”: to construct representation of probabilistic data of any origin by a complex probability amplitude which matches Born’s rule. The corresponding algorithm – quantum-like representation algorithm (QLRA) was recently proposed by A. Khrennikov [1]–[5]. Formally QLRA depends on the order of conditioning. For two observables a and b, b|a- and a|b conditional probabilities produce two representations, say in Hilbert spaces H b|a and H a|b. In this paper we prove that under natural assumptions these two representations are unitary equivalent. This result proves consistency QLRA. Keywords quantum-like representation algorithm, inverse Born’s rule problem, order of conditioning, unitary equivalence of representations. 1

•Jan 1, 2009•8 citations

On quantum algorithms

CleveRichard, EkertArtur, HendersonLea +2 more

Complexity•Sep 1, 1998•0 citations

On quantum algorithms

Richard Cleve, ARTUR K. EKERT, Leah Henderson +2 more

Complexity•Sep 1, 1998•30 citations

Binarization of grayscale quantum image denoted with novel enhanced quantum representations

Shiping Du, Kailun Luo, Yan Zhi +2 more

This paper proposes a new algorithm for binarizing the grayscale quantum images represented by novel enhanced quantum image representation(NEQR) through pixel qubit flipping. The algorithm consists of two steps: the first step performs the qubit state checking, and the second completes pixel qubit flipping based on the results in previous step. The key data analysis shows that our algorithm has the following advantages, which include: (1) Contrasting with the probable algorithm, the result of this paper is deterministic( without error). (2) Comparing with the latest result, our paper has some superior characters: fewer quantum gates, fewer auxiliary qubits and less quantum delay.

Results in Physics•Jun 14, 2022•9 citations
In this paper we continue to study so called “inverse Born’s rule problem”: to construct representation of probabilistic data of any origin by a complex probability amplitude which matches Born’s rule. The corresponding algorithm – quantum-like representation algorithm (QLRA) was recently proposed by A. Khrennikov [1]–[5]. Formally QLRA depends on the order of conditioning. For two observables a and b, b|a- and a|b conditional probabilities produce two representations, say in Hilbert spaces H b|a and H a|b. In this paper we prove that under natural assumptions these two representations are unitary equivalent. This result proves consistency QLRA. Keywords quantum-like representation algorithm, inverse Born’s rule problem, order of conditioning, unitary equivalence of representations. 1
This paper proposes a new algorithm for binarizing the grayscale quantum images represented by novel enhanced quantum image representation(NEQR) through pixel qubit flipping. The algorithm consists of two steps: the first step performs the qubit state checking, and the second completes pixel qubit flipping based on the results in previous step. The key data analysis shows that our algorithm has the following advantages, which include: (1) Contrasting with the probable algorithm, the result of this paper is deterministic( without error). (2) Comparing with the latest result, our paper has some superior characters: fewer quantum gates, fewer auxiliary qubits and less quantum delay.