On consistency of the quantum-like representation algorithm

Details On consistency of the quantum-like representation algorithm On consistency of the quantum-like representation algorithm

2009-06-11

arxiv.org/abs/0906.2157v1

Physics

Mathematical Physics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On consistency of the quantum-like representation algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On consistency of the quantum-like representation algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On consistency of the quantum-like representation algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-516885