Muutke küpsiste eelistusi

Mathematics of Quantum Computation [Pehme köide]

3.00/5 (1 hinnangut Goodreads-ist)
Edited by (Pennsylvania State University, Pennsylvania, USA), Edited by (Texas A&M University, College Station, USA)
  • Formaat: Paperback / softback, 448 pages, kõrgus x laius: 234x156 mm, kaal: 861 g, 28 Illustrations, black and white
  • Ilmumisaeg: 19-Jun-2019
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 0367396351
  • ISBN-13: 9780367396350
Teised raamatud teemal:
Mathematics of Quantum ComputationSuurem pilt
  • Formaat: Paperback / softback, 448 pages, kõrgus x laius: 234x156 mm, kaal: 861 g, 28 Illustrations, black and white
  • Ilmumisaeg: 19-Jun-2019
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 0367396351
  • ISBN-13: 9780367396350
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9780367396350.html
Among the most exciting developments in science today is the design and construction of the quantum computer. Its realization will be the result of multidisciplinary efforts, but ultimately, it is mathematics that lies at the heart of theoretical quantum computer science.

Mathematics of Quantum Computation brings together leading computer scientists, mathematicians, and physicists to provide the first interdisciplinary but mathematically focused exploration of the field's foundations and state of the art. Each section of the book addresses an area of major research, and does so with introductory material that brings newcomers quickly up to speed. Chapters that are more advanced include recent developments not yet published in the open literature.

Information technology will inevitably enter into the realm of quantum mechanics, and, more than all the atomic, molecular, optical, and nanotechnology advances, it is the device-independent mathematics that is the foundation of quantum computer and information science. Mathematics of Quantum Computation offers the first up-to-date coverage that has the technical depth and breadth needed by those interested in the challenges being confronted at the frontiers of research.

Mathematics of Quantum Computation brings together some of the world's leading computer scientists, chemists, mathematicians, and physicists to provide the first interdisciplinary but mathematically focused exploration of the field's foundations and state of the art. Each section of the book addresses an area of major research interest, and does so with introductory material that brings newcomers quickly up to speed. Advanced chapters present recent developments not yet published in the open literature. This is the first treatment of the subject that has the technical depth and breadth needed by those interested in the challenges being confronted at the frontiers of research.
Preface v
Quantum Entanglement 1(2)
1 Algebraic measures of entanglement
3(22)
Jean-Luc Brylinski
1.1 Introduction
3(1)
1.2 Rank of a tensor
4(4)
1.3 Tensors in (C2)⊗2
8(1)
1.4 Tensors in (C2) ⊗3
8(10)
1.5 Tensors in (C2) ⊗4
18(7)
2 Kinematics of qubit pairs
25(52)
Berthold-Georg Englert
Nasser Metwally
2.1 Introduction
25(3)
2.2 Preliminaries
28(6)
2.3 Basic classification of states
34(2)
2.4 Projectors and subspaces
36(7)
2.4.1 Rank 1
36(3)
2.4.2 Rank 2
39(2)
2.4.3 Rank 3
41(2)
2.4.4 Rank 4
43(1)
2.5 Positivity and separability
43(4)
2.6 Lewenstein-Sanpera decompositions
47(13)
2.6.1 Basic properties of optimal LSDs
51(3)
2.6.2 Optimal LSDs of truly positive states
54(6)
2.7 Examples
60(12)
2.7.1 Self-transposed states
60(3)
2.7.2 Generalized Werner states
63(3)
2.7.3 States of rank 2
66(6)
2.8 Acknowledgments
72(5)
3 Invariants for multiple qubits: the case of 3 qubits
77(24)
David A. Meyer
Noland Wallach
3.1 Introduction
77(2)
3.2 Invariants for compact Lie groups
79(3)
3.3 The simplest cases
82(3)
3.4 The case of 3 qubits
85(3)
3.5 A basic set of invariants for 3 qubits
88(7)
3.6 Some implications for other representations
95(4)
Universality of Quantum Gates
99(2)
4 Universal quantum gates
101(18)
Jean-Luc Brylinski
Ranee Brylinski
4.1 Statements of main results
101(3)
4.2 Examples and relations to works of other authors
104(2)
4.3 Proof of theorem 4.1 (outline)
106(1)
4.4 First step: from universality to exact universality
107(1)
4.5 Second step: reduction to n = 2
108(1)
4.6 Fourth Step: analyzing the Lie algebra g
109(1)
4.7 Fifth Step: the normalizer of H
110(2)
4.8 Proof of theorem 4.2
112(1)
4.9 A variant of theorem 4.1
113(4)
Quantum Search Algorithms
117(2)
5 From coupled pendulums to quantum search
119(16)
Lov K. Grover
Anirvan M. Sengupta
5.1 Introduction
120(1)
5.2 Classical analogy
120(1)
5.3 N Coupled pendulums
121(4)
5.4 The algorithm
125(2)
5.4.1 Rules of the game
125(1)
5.4.2 Algorithm
126(1)
5.5 Towards quantum searching
127(1)
5.6 The quantum search algorithm
128(2)
5.7 Why does it take O(√N) cycles?
130(1)
5.8 Applications and extensions
131(4)
5.8.1 Counting
131(1)
5.8.2 Mechanical applications
132(1)
5.8.3 Quantum mechanical applications
133(2)
6 Generalization of Grover's algorithm to multiobject search in quantum computing, Part I: continuous time and discrete time
135(26)
Goong Chen
Stephen A. Fulling
Jeesen Chen
6.1 Introduction
135(2)
6.2 Continuous time quantum computing algorithm for multiobject search
137(10)
6.3 Discrete time case: straightforward generalization of Grover's algorithm to multiobject search
147(14)
7 Generalization of Grover's algorithm to multiobject search in quantum computing, Part II: general unitary transformations
161(10)
Goong Chen
Shunhua Sun
7.1 Introduction
162(1)
7.2 Multiobject search algorithm using a general unitary transformation
163(6)
Quantum Computational Complexity
169(2)
8 Counting complexity and quantum computation
171(52)
Stephen A. Fenner
8.1 Introduction
171(2)
8.2 Preliminaries
173(22)
8.2.1 Qubits, quantum gates, and quantum circuits
175(3)
8.2.2 Classical complexity
178(14)
8.2.3 Classical computations on a quantum circuit
192(2)
8.2.4 Relativizing quantum computation
194(1)
8.3 Equivalence of FQP and GapP
195(5)
8.4 Strengths of the quantum model
200(7)
8.4.1 Oracle results
202(5)
8.5 Limitations of the quantum model
207(7)
8.6 Conclusions
214(7)
Quantum Error-Correcting Codes
221(2)
9 Algorithmic aspects of quantum error-correcting codes
223(30)
Markus Grassl
9.1 Introduction
223(1)
9.2 General quantum error-correcting codes
224(9)
9.2.1 General errors
224(5)
9.2.2 Local errors
229(4)
9.3 Binary quantum codes
233(8)
9.3.1 Construction
233(6)
9.3.2 Example: binary Hamming code
239(2)
9.4 Additive quantum codes
241(9)
9.4.1 Construction
241(5)
9.4.2 Example: quantum Hamming code
246(4)
9.5 Conclusions
250(3)
10 Clifford codes
253(24)
Andreas Klappenecker
Martin Rotteler
10.1 Introduction
253(2)
10.2 Motivation
255(1)
10.3 Quantum error control codes
256(3)
10.4 Nice error bases
259(3)
10.5 Stabilizer codes
262(2)
10.6 Clifford codes
264(1)
10.7 Clifford codes that are stabilizer codes
265(4)
10.8 A remarkable error group
269(1)
10.9 A weird error group
269(1)
10.10 Conclusions
270(5)
Quantum Computing Algebraic and Geometric Structures
275(2)
11 Invariant polynomial functions on k qudits
277(10)
Jean-Luc Brylinski
Ranee Brylinski
11.1 Introduction
277(2)
11.2 Polynomial invariants of tensor states
279(2)
11.3 The generalized determinant function
281(1)
11.4 Asymptotics as k → ∞
282(1)
11.5 Quartic invariants of k qudits
283(4)
12 Z2-systolic freedom and quantum codes
287(36)
Michael H. Freedman
David A. Meyer
Feng Luo
12.0 Preliminaries and statement of results
287(7)
12.1 Mapping torus constructions
294(7)
12.2 Verification of freedom and curvature estimates
301(7)
12.3 Quantum codes from Riemannian manifolds
308(13)
Quantum Teleportation
321(2)
13 Quantum teleportation
323(36)
Kishore T. Kapale
M. Suhail Zubairy
13.1 Introduction
323(3)
13.2 Teleportation of a two-state system
326(11)
13.2.1 The formal scheme
327(3)
13.2.2 Cavity QED implementation
330(7)
13.3 Discrete N-state quantum systems
337(3)
13.4 Entangled state teleportation
340(6)
13.4.1 Two-qubit entangled state
341(3)
13.4.2 N-qubit entangled state
344(2)
13.5 Continuous quantum variable states
346(5)
13.5.1 Nonlocal measurements
346(2)
13.5.2 Wigner functions
348(3)
13.6 Concluding remarks
351(6)
Quantum Secure Communication and Quantum Cryptography
357(2)
14 Communicating with qubit pairs
359(46)
Almut Beige
Berthold-Georg Englert
Christian Kurtsiefer
Harald Weinfurter
14.1 Introduction
360(1)
14.2 The mean king's problem
361(10)
14.2.1 The Vaidman-Aharonov- Albert puzzle
361(1)
14.2.2 The stranded physicist's solution
362(5)
14.2.3 The mean king's second challenge
367(2)
14.2.4 A different perspective
369(2)
14.3 BB84: cryptography with single qubits
371(6)
14.3.1 Description of the scheme
372(1)
14.3.2 Eavesdropping: minimizing the error probability
373(2)
14.3.3 Eavesdropping: maximizing the raw information
375(2)
14.4 Cryptography with qubit pairs
377(8)
14.4.1 Description of the scheme
377(3)
14.4.2 Eavesdropping: minimizing the error probability
380(4)
14.4.3 Eavesdropping: maximizing the raw information
384(1)
14.5 Idealized single-photon schemes
385(7)
14.5.1 BB84 scheme with two state pairs
385(3)
14.5.2 Qubit-pair scheme with four state pairs
388(4)
14.6 Direct communication with qubit pairs
392(6)
14.6.1 Description of the scheme
392(3)
14.6.2 Minimal error probability
395(3)
14.7 Acknowledgments
398(5)
Commentary on Quantum Computing
403(2)
15 Transgressing the boundaries of quantum computation: a contribution to the hermeneutics of the NMR paradigm
405(16)
Stephen A. Fulling
15.1 Review of NMR quantum computing
406(1)
15.2 Review of modular arithmetic
407(2)
15.3 A proposed "quantum" implementation
409(3)
15.4 Aftermath
412(9)
Index 421
Goong Chen, Ranee K. Brylinski