Quantum Process Algebra
- Publisher's listprice EUR 232.99
-
96 632 Ft (92 031 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 19 326 Ft off)
- Discounted price 77 306 Ft (73 625 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
96 632 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Elsevier Science
- Date of Publication 1 April 2025
- ISBN 9780443275135
- Binding Paperback
- No. of pages424 pages
- Size 276x216 mm
- Weight 1190 g
- Language English 650
Categories
Long 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.
MoreTable of Contents:
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
