東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Quantum games as quantum types.

Delbecque, Yannick.

FindBook

Google Book

Amazon

博客來

Quantum games as quantum types.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Quantum games as quantum types./
作者:	Delbecque, Yannick.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2009,
面頁冊數:	189 p.
附註:	Source: Dissertations Abstracts International, Volume: 71-09, Section: B.
Contained By:	Dissertations Abstracts International71-09B.
標題:	Quantum physics. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR56905
ISBN:	9780494569054

Quantum games as quantum types.
Delbecque, Yannick.

Quantum games as quantum types. - Ann Arbor : ProQuest Dissertations & Theses, 2009 - 189 p.

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

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

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.

ISBN: 9780494569054Subjects--Topical Terms:

726746
Quantum physics.
Subjects--Index Terms:

Denotational semantics

Quantum games as quantum types.
LDR:03174nmm a2200349 4500 001 2403829
005 20241125080230.5
006 m o d
007 cr#unu||||||||
008 251215s2009 ||||||||||||||||| ||eng d
020 $a 9780494569054
035 $a (MiAaPQ)AAINR56905
035 $a AAINR56905
040 $a MiAaPQ $c MiAaPQ
100 1 $a Delbecque, Yannick. $3 3774110
245 1 0 $a Quantum games as quantum types.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2009
300 $a 189 p.
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.
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.
590 $a School code: 0781.
650 4 $a Quantum physics. $3 726746
650 4 $a Computer science. $3 523869
653 $a Denotational semantics
653 $a Quantum games
653 $a Quantum programming
690 $a 0599
690 $a 0984
710 2 $a McGill University (Canada). $3 1018122
773 0 $t Dissertations Abstracts International $g 71-09B.
790 $a 0781
791 $a Ph.D.
792 $a 2009
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR56905