國立虎尾科技大學 |

Quantum games as quantum types.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Quantum games as quantum types./
Author:	Delbecque, Yannick.
Description:	1 online resource (189 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 71-09, Section: B.
Contained By:	Dissertations Abstracts International71-09B.
Subject:	Quantum physics. -
Online resource:	click for full text (PQDT)
ISBN:	9780494569054

Quantum games as quantum types.
Delbecque, Yannick.

Quantum games as quantum types. - 1 online resource (189 pages)

Source: Dissertations Abstracts International, Volume: 71-09, Section: B.

Thesis (Ph.D.)--McGill University (Canada), 2009.

Includes bibliographical references

In this thesis, we present a new model for higher-order quantum programming languages. The proposed model is an adaptation of the probabilistic game semantics developed by Danos and Harmer [DH02]: we expand it with quantum strategies which enable one to represent quantum states and quantum operations. Some of the basic properties of these strategies are established and then used to construct denotational semantics for three quantum programming languages. The first of these languages is a formalisation of the measurement calculus proposed by Danos et al. [DKP07]. The other two are new: they are higher-order quantum programming languages. Previous attempts to define a denotational semantics for higher-order quantum programming languages have failed. We identify some of the key reasons for this and base the design of our higher-order languages on these observations. The game semantics proposed in this thesis is the first denotational semantics for a λ-calculus equipped with quantum types and with extra operations which allow one to program quantum algorithms. The results presented validate the two different approaches used in the design of these two new higher-order languages: a first one where quantum states are used through references and a second one where they are introduced as constants in the language. The quantum strategies presented in this thesis allow one to understand the constraints that must be imposed on quantum type systems with higher-order types. The most significant constraint is the fact that abstraction over part of the tensor product of many unknown quantum states must not be allowed. Quantum strategies are a new mathematical model which describes the interaction between classical and quantum data using system-environment dialogues. The interactions between the different parts of a quantum system are described using the rich structure generated by composition of strategies. This approach has enough generality to be put in relation with other work in quantum computing. Quantum strategies could thus be useful for other purposes than the study of quantum programming languages.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9780494569054Subjects--Topical Terms:

1179090
Quantum physics.
Subjects--Index Terms:

Denotational semanticsIndex Terms--Genre/Form:

554714
Electronic books.

Quantum games as quantum types.
LDR:03391ntm a22003617 4500 001 1152083
005 20241125080230.5
006 m o d
007 cr mn ---uuuuu
008 250605s2009 xx obm 000 0 eng d
020 $a 9780494569054
035 $a (MiAaPQ)AAINR56905
035 $a AAINR56905
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Delbecque, Yannick. $3 1478966
245 1 0 $a Quantum games as quantum types.
264 0 $c 2009
300 $a 1 online resource (189 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 71-09, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
502 $a Thesis (Ph.D.)--McGill University (Canada), 2009.
504 $a Includes bibliographical references
520 $a In this thesis, we present a new model for higher-order quantum programming languages. The proposed model is an adaptation of the probabilistic game semantics developed by Danos and Harmer [DH02]: we expand it with quantum strategies which enable one to represent quantum states and quantum operations. Some of the basic properties of these strategies are established and then used to construct denotational semantics for three quantum programming languages. The first of these languages is a formalisation of the measurement calculus proposed by Danos et al. [DKP07]. The other two are new: they are higher-order quantum programming languages. Previous attempts to define a denotational semantics for higher-order quantum programming languages have failed. We identify some of the key reasons for this and base the design of our higher-order languages on these observations. The game semantics proposed in this thesis is the first denotational semantics for a λ-calculus equipped with quantum types and with extra operations which allow one to program quantum algorithms. The results presented validate the two different approaches used in the design of these two new higher-order languages: a first one where quantum states are used through references and a second one where they are introduced as constants in the language. The quantum strategies presented in this thesis allow one to understand the constraints that must be imposed on quantum type systems with higher-order types. The most significant constraint is the fact that abstraction over part of the tensor product of many unknown quantum states must not be allowed. Quantum strategies are a new mathematical model which describes the interaction between classical and quantum data using system-environment dialogues. The interactions between the different parts of a quantum system are described using the rich structure generated by composition of strategies. This approach has enough generality to be put in relation with other work in quantum computing. Quantum strategies could thus be useful for other purposes than the study of quantum programming languages.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Quantum physics. $3 1179090
650 4 $a Computer science. $3 573171
653 $a Denotational semantics
653 $a Quantum games
653 $a Quantum programming
655 7 $a Electronic books. $2 local $3 554714
690 $a 0599
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a McGill University (Canada). $3 845629
773 0 $t Dissertations Abstracts International $g 71-09B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR56905 $z click for full text (PQDT)