lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On consistency of the quantum-like representation algorithm.
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
2010 (English)In: International journal of theoretical physics, ISSN 0020-7748, E-ISSN 1572-9575, Vol. 49, no 1, p. 1-9Article in journal (Refereed) Published
Abstract [en]

In this paper we continue to study so-called “inverse Born’s rule problem”: to constructa representation of probabilistic data of any origin by a complex probability amplitudewhich matches Born’s rule. The corresponding algorithm—quantum-like representation algorithm(QLRA)—was recently proposed by A. Khrennikov (Found. Phys. 35(10):1655–1693, 2005; Physica E 29:226–236, 2005; Dokl. Akad. Nauk 404(1):33–36, 2005; J. Math.Phys. 46(6):062111–062124, 2005; Europhys. Lett. 69(5):678–684, 2005). Formally QLRAdepends on the order of conditioning. For two observables (of any origin, e.g., physical orbiological) a and b, b|a- and a|b conditional probabilities produce two representations, sayin Hilbert spaces Hb|a and Ha|b. In this paper we prove that under “natural assumptions”(which hold, e.g., for quantum observables represented by operators with nondegeneratespectra) these two representations are unitary equivalent. This result proves the consistencyof QLRA.

Place, publisher, year, edition, pages
2010. Vol. 49, no 1, p. 1-9
Keywords [en]
Quantum-like representation algorithm, Inverse Born's rule problem, Order of conditioning, Unitary equivalence of representations
National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
URN: urn:nbn:se:lnu:diva-13816DOI: 10.1007/s10773-009-0171-2OAI: oai:DiVA.org:lnu-13816DiVA, id: diva2:435357
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2017-12-08Bibliographically approved
In thesis
1. On relations between classical and quantum theories of information and probability
Open this publication in new window or tab >>On relations between classical and quantum theories of information and probability
2011 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was  introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometric interference term and this is in fact a generalization of the familiar formula of interference of probabilities.

We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical data is collected from measurements of two dichotomous and trichotomous observables respectively. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum--like representation.

We also study simulations of quantum computers on classical computers.Although it can not be denied that great progress have been made in quantum technologies, it is clear that there is still a huge gap between the creation of experimental quantum computers and realization of a quantum computer that can be used in applications. Therefore the simulation of quantum computations on classical computers became an important part in the attempt to cover this gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation.

 The second part of this thesis is devoted to adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulations on classical computers. Concretely we represent Simon's algorithm, Deutsch-Josza algorithm, Shor's algorithm, Grover's algorithm and quantum error-correcting codes in the Mathematica symbolic language. We see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include future algorithms in this framework.

Place, publisher, year, edition, pages
Växjö, Kalmar: Linnaeus University Press, 2011. p. 161
Series
Linnaeus University Dissertations ; 60/2011
Keywords
Born’s rule, Clifford algebra, Deutsch-Josza algorithm, Grover’s algorithm, Hyperbolic interferences, Inverse Born’s rule problem, Probabilistic data, Quantum computing, Quantum error-correcting, Quantum-like representation algorithm, Shor’s algorithm, Simon’s algorithm, Simulation of quantum algorithms
National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:lnu:diva-13830 (URN)978-91-86491-98-7 (ISBN)
Public defence
2011-09-22, Weber, Universitetsplatsen 1, Växjö, 14:15 (English)
Opponent
Supervisors
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2011-08-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Nyman, Peter

Search in DiVA

By author/editor
Nyman, Peter
By organisation
School of Computer Science, Physics and Mathematics
In the same journal
International journal of theoretical physics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf