Quantum Process Algebra

個数：

Quantum Process Algebra

Wang, Yong

ウェブストア価格 ¥52,448（本体¥47,680）
Morgan Kaufmann Publishers In（2025/04発売）
外貨定価 US$ 250.00
ポイント 476pt

提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
【重要ご説明事項】
1. 納期遅延や、ご入手不能となる場合が若干ございます。
2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
3. 美品のご指定は承りかねます。

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 424 p.
言語 ENG
商品コード 9780443275135
DDC分類 006.3843

Full Description

Quantum Process Algebra introduces readers to the algebraic properties and laws for quantum computing. The book provides readers with all aspects of algebraic theory for quantum computing, including the basis of semantics and axiomatization for quantum computing. With the assumption of a quantum system, readers will learn to solve the modeling of the three main components in a quantum system: the unitary operator, quantum measurement, and quantum entanglement, with full support of quantum and classical computing in closed systems. Next, the book establishes the relationship between probabilistic quantum bisimilarity and classical probabilistic bisimilarity, including strong probabilistic bisimilarity and weak probabilistic bisimilarity, which makes an axiomatization of quantum processes possible. With this framework, quantum and classical computing mixed processes are unified with the same structured operational semantics. Finally, the book establishes a series of axiomatizations of quantum process algebras. These process algebras support nearly all the main computation properties. Quantum and classical computing in closed quantum systems are unified with the same equational logic and the same structured operational semantics under the framework of ACP-like probabilistic process algebra. This unification means that the mathematics in the book can be used widely for verification of quantum and classical computing mixed systems, for example, most quantum communication protocols. ACP-like axiomatization also inherits the advantages of ACP, for example, and modularity means that it can be extended in an elegant way.

1. Introduction
2. Backgrounds
3. APTC for Open Quantum Systems
4. APPTC for Closed Quantum Systems
5. APTCG for Open Quantum Systems
6. APPTCG for Closed Quantum Systems
7. APTC with Localities for Open Quantum Systems
8. APPTC with Localities for Closed Quantum Systems
9. APRTC for Open Quantum Systems
10. Algebra for Parallelism in Reversible Probabilistic True Concurrency
11. APRPTC for Closed Quantum Systems
12. APRTC with Guards
13. APRTCG for Open Quantum Systems
14. APRPTC with Guards
15. APRPTCG for Closed Quantum Systems
16. Applications of Algebras for Open Quantum Systems
17. Applications of Algebras for Close Quantum Systems