Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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 relations between classical and quantum theories of information and probability
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
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. , 161 p.
Series
Linnaeus University Dissertations, 60/2011
Keyword [en]
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: urn:nbn:se:lnu:diva-13830ISBN: 978-91-86491-98-7 (print)OAI: oai:DiVA.org:lnu-13830DiVA: diva2:435435
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
List of papers
1. Simulation of Quantum Algorithms on a Symbolic Computer
Open this publication in new window or tab >>Simulation of Quantum Algorithms on a Symbolic Computer
2007 (English)In: Quantum Theory: FOUNDATIONS OF PROBABILITY AND PHYSICS - 4, Melville, New York , 2007, 383-389 p.Conference paper, Published paper (Other academic)
Abstract [en]

This paper is a presentation of how to implement quantum algorithms (namely, Shor's algorithm ) on a classical computer by using the well-known Mathematica package. It will give us a lucid connection between mathematical formulation of quantum mechanics and computational methods.

Place, publisher, year, edition, pages
Melville, New York, 2007
Keyword
quantum computing, algorithm theory
National Category
Other Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:vxu:diva-3106 (URN)
Available from: 2008-01-07 Created: 2008-01-07 Last updated: 2011-08-18Bibliographically approved
2. Simulation of Deutsch-Jozsa Algorithm in Mathematica
Open this publication in new window or tab >>Simulation of Deutsch-Jozsa Algorithm in Mathematica
2007 (English)In: Quantum Theory: Reconsideration of Foundations - 4, Melville, New York , 2007, 312-315 p.Conference paper, Published paper (Other academic)
Abstract [en]

This study examines the simulation of Deutsch-Jozsa algorithm in Mathematica. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods in Mathematica. This program code will be a foundation of a universal simulation language.

Place, publisher, year, edition, pages
Melville, New York, 2007
Keyword
Deutsch-Jozsa algorithm, Mathematica, Quantum computing
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:vxu:diva-3109 (URN)
Available from: 2008-01-07 Created: 2008-01-07 Last updated: 2011-08-18Bibliographically approved
3. Simulation of Simon’s Algorithm in Mathematica
Open this publication in new window or tab >>Simulation of Simon’s Algorithm in Mathematica
2008 (English)In: Quantum Computers and Computing, ISSN 1607-9817, Vol. 8, no 1, 126-133 p.Article in journal (Refereed) Published
Abstract [en]

A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of quantum mechanical processes as well as quantum algorithms. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make a simulation of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This give us an uncomplicated and clear language for implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulation of quantum algorithms.

Place, publisher, year, edition, pages
Moscow: , 2008
Keyword
Mathematica, Simon’s Algorithm, Quantum Algorithm Simulation, Quantum Computing
National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:vxu:diva-6221 (URN)
Available from: 2009-11-09 Created: 2009-11-09 Last updated: 2013-07-29Bibliographically approved
4. On consistency of the quantum-like representation algorithm.
Open this publication in new window or tab >>On consistency of the quantum-like representation algorithm.
2010 (English)In: International journal of theoretical physics, ISSN 0020-7748, E-ISSN 1572-9575, Vol. 49, no 1, 1-9 p.Article 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.

Keyword
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:nbn:se:lnu:diva-13816 (URN)10.1007/s10773-009-0171-2 (DOI)
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2017-12-08Bibliographically approved
5. Quantum-like representation algorithm for trichotomous observables.
Open this publication in new window or tab >>Quantum-like representation algorithm for trichotomous observables.
2011 (English)In: International journal of theoretical physics, ISSN 0020-7748, E-ISSN 1572-9575, Vol. 50, no 12, 3864-3881 p.Article in journal (Refereed) Published
Abstract [en]

We study the problem of representing statistical data (of any origin) by a complex probability amplitude. This paper is devoted to representation of data collected from measurements of two trichotomous observables. The complexity of the problem eventually increases compared to the case of dichotomous observables. We see that only special statistical data (satisfying a number of nonlinear constraints) have the quantum–like representation.

Keyword
Born’s rule, Probabilistic data, Quantum-like, Trichotomous observables
National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:lnu:diva-13823 (URN)10.1007/s10773-011-0934-4 (DOI)2-s2.0-81155130798 (Scopus ID)
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2017-12-08Bibliographically approved
6. On hyperbolic interferences in the quantum-like representation algorithm for the case of triple–valued observables
Open this publication in new window or tab >>On hyperbolic interferences in the quantum-like representation algorithm for the case of triple–valued observables
(English)Manuscript (preprint) (Other academic)
Abstract [en]

The quantum–like representation algorithm (QLRA) was introduced by A. Khrennikov 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 will introduce the formula of total probability with an additional term of trigonometric, hyperbolic or hyper-trigonometric interference 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 datas are collected from measurements of two trichotomous observables and the complexity of the problem increased eventually compared to the case of dichotomous observables.We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum–like representation. In this paper we will present a class of statistical data which satisfy these nonlinear constraints and have a quantum–like representation. This quantum–like representation induces trigonometric-, hyperbolic- and hyper–trigonometric interferences representation.

Keyword
Hyperbolic interferences · Quantum–like representation algorithm · Clifford algebra · Born’s rule · Hyperbolic Hilbert space
National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:lnu:diva-13825 (URN)
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2012-01-03Bibliographically approved
7. On the consistency of the quantum-like representation algorithm for hyperbolic interference.
Open this publication in new window or tab >>On the consistency of the quantum-like representation algorithm for hyperbolic interference.
2011 (English)In: Advances in Applied Clifford Algebras, ISSN 1661-4909, Vol. 21, no 4, 799-811 p.Article in journal (Refereed) Published
Abstract [en]

Recently quantum-like representation algorithm (QLRA) wasintroduced by A. Khrennikov [20]–[28] to solve the so-called “inverseBorn’s rule problem”: to construct a representation of probabilistic databy a complex or hyperbolic probability amplitude or more general complextogether with hyperbolic which matches Born’s rule or its generalizations.The outcome from QLRA is coupled to the formula of totalprobability with an additional term corresponding to trigonometric, hyperbolicor hyper-trigonometric interference. The consistency of QLRAfor probabilistic data corresponding to trigonometric interference was recentlyproved [29].We complete the proof of the consistency of QLRA tocover hyperbolic interference as well. We will also discuss hyper trigonometricinterference. The problem of consistency of QLRA arises, becauseformally the output of QLRA depends on the order of conditioning. Fortwo observables (e.g., physical or biological) a and b, b|a- and a|b- conditionalprobabilities produce two representations, say in Hilbert spacesHb|a and Ha|b (in this paper over the hyperbolic algebra). We provethat under “natural assumptions” these two representations are unitaryequivalent (in the sense of hyperbolic Hilbert space).

Keyword
Born’s rule problem, hyperbolic interference, hyper trigonometric interference, inverse order of conditioning, quantum-like representation algorithm.
National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:lnu:diva-13820 (URN)10.1007/s00006-011-0287-3 (DOI)2-s2.0-80455173631 (Scopus ID)
Note
Online First™, 16 March 2011Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2012-01-13Bibliographically approved
8. A compact program code for simulations of quantum algorithms in classical computers.
Open this publication in new window or tab >>A compact program code for simulations of quantum algorithms in classical computers.
2009 (English)In: Laser Physics / [ed] Igor V. Yevseyev, 2009Conference paper, Published paper (Other academic)
Abstract [en]

A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.

National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:lnu:diva-13827 (URN)
Conference
the Seventeenth International Laser Physics Workshop (LPHYS’08)
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2011-08-24Bibliographically approved
9. Simulation of quantum error correcting code.
Open this publication in new window or tab >>Simulation of quantum error correcting code.
(English)Manuscript (preprint) (Other academic)
Abstract [en]

This study considers implementations of error correction in a simulation language on a classical computer. Error correction will be necessarily in quantum computing and quantum information. We will give some examples of the implementations of some error correction codes. These implementations will be made in a more general quantum simulation language on a classical computer in the language Mathematica.The intention of this research is to develop a programming language that is able to make simulations of all quantum algorithms and error corrections in the same framework. The program code implemented on a classical computer will provide a connection between the mathematical formulation of quantum mechanics and computational methods. This gives us a clear uncomplicated language for the implementations of algorithms.

National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:lnu:diva-13829 (URN)
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2012-01-03Bibliographically approved
10. Representation of probabilistic data by complex probability amplitudes: the case of triple-valued observables.
Open this publication in new window or tab >>Representation of probabilistic data by complex probability amplitudes: the case of triple-valued observables.
2010 (English)In: AIP Conference Proceedings, ISSN 0094-243X, E-ISSN 1551-7616, Vol. 1327, 439-449 p.Article in journal (Refereed) Published
Abstract [en]

The problem of inter-relation between classical and quantum probabilistic data wasdiscussed in numerous papers (from various points of view), see, e.g., [1, 2, 3, 4, 6, 5, 7,8, 14, 15]. We are interested in the problem of representation of probabilistic data of anyorigin 1 by complex probability amplitude, so to say a “wave function”. This problemwas discussed in very detail in [17]. A general QL-representation algorithm (QLRA)was presented in [17]. This algorithm is based on the formula of total probability withinterference term – a disturbance of the standard formula of total probability. Startingwith experimental probabilistic data, QLRA produces a complex probability amplitudesuch that probability can be reconstructed by using Born’s rule.Although the formal scheme of QLRA works for multi-valued observables of anarbitrary dimension, the description of the class of probabilistic data which can betransfered into QL-amplitudes (the domain of application of QLRA) depends very muchon the dimension. In [19] the simplest case of data generated by dichotomous observableswas studied. In this paper we study trichotomous observables. The complexity of theproblem increases incredibly comparing with the two dimensional case.Finally, we remark that our study is closely related to the triple slit interferenceexperiment and Sorkin’s equality [16]. This experiment provides an important test offoundations of QM.The scheme of presentation is the following one. We start with observables given byQM and derive constraints on phases which are necessary and sufficient for the QLrepresentation.Then we use these constraints to produce complex amplitudes from data(of any origin); some examples, including numerical, are given.

Place, publisher, year, edition, pages
American Institute of Physics (AIP), 2010
National Category
Mathematics
Research subject
Natural Science, Mathematics
Identifiers
urn:nbn:se:lnu:diva-13821 (URN)978-0-7354-0882-1 (ISBN)
Conference
International Conference Advances in Quantum Theory Location: Vaxjo, SWEDEN Date: JUN 14-17, 2010
Available from: 2011-08-18 Created: 2011-08-18 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

fulltext(1900 kB)515 downloads
File information
File name FULLTEXT01.pdfFile size 1900 kBChecksum SHA-512
0d75ce99cbc62a644e8fa1f013c0f4884949eae161fa231274e3858a721002b650d0b03a3af6c69c1802921f0386616de05bd3753d47b1c482256dd1f198361c
Type fulltextMimetype application/pdf

Authority records BETA

Nyman, Peter

Search in DiVA

By author/editor
Nyman, Peter
By organisation
School of Computer Science, Physics and Mathematics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 515 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 359 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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