14
Toward a Dependable Quantum Computing Architecture 1

Toward a Dependable Quantum Computing Architecture

Embed Size (px)

Citation preview

Page 1: Toward a Dependable Quantum Computing Architecture

Toward a Dependable Quantum Computing Architecture

1

Page 2: Toward a Dependable Quantum Computing Architecture

Contents

• Introduction• Technology• System design• Challenges• Advantages and Disadvantages• Applications

2

Page 3: Toward a Dependable Quantum Computing Architecture

INTRODUCTION

• Energy consumption• Speed• Data transportation• Power of QC• Qubit• 0&1• Superposition state

3

Page 4: Toward a Dependable Quantum Computing Architecture

How to encode quantum information ?• Electrons are preferred (decoherence)• Three ways • Spin angle of photons & electrons• Polarization of photons• Reverse spin angle

4

Page 5: Toward a Dependable Quantum Computing Architecture

TECHNOLOGY• QC & Qubits• 0&1• Superposition state• Quantum dots

• a|0 + ⟩ b|1 ⟩• |a|2 + |b|2 = 1

5

Page 6: Toward a Dependable Quantum Computing Architecture

• Parallelism

• Microscopic reversibility• Vertical polarization _ or ↔ • Electron spin ↑ or ↓ ]

• Consider an operation g• c0|g(00) + c1|g(01) + c2|g(10) + c3|g(11)⟩ ⟩ ⟩ ⟩• Qubit dots vs. parallelism• quantum portioning

6

Page 7: Toward a Dependable Quantum Computing Architecture

• Quantum teleportation• Process of sending quibts• Using disintegration • And reintegration(DISRE)

• qubits jbi and jci are distributed • jai is combined with jbi• produce two classical bits of information • After transport, these bits are used to manipulate jci to regenerate state jai and jbi at

the destination. 7

Page 8: Toward a Dependable Quantum Computing Architecture

SYSTEM DESIGN• A N qubit =2^N superpostions• Logical qubit• Multitasking• Parallelism• Reversible

8

Page 9: Toward a Dependable Quantum Computing Architecture

CHALLENGES

• Decoherence: This property states that if a coherent state (state with superposition) interacts with the environment, it will fall into a classical physics state without superposition

• Zeno effect: States that an unstable particle, if constantly observed, will never decay into a superpositioned state

• Entanglement: two or more particles can be linked, and if linked, you can change properties of one particle changing the linked one.• E.g.: polerization of single electrons can cause change in enture system

9

Page 10: Toward a Dependable Quantum Computing Architecture

ADVANTAGES AND DISADAVTAGES

• Advantages• Faster computation• Exponential Speed-up • Used as classical computer

• Disadvantages• Availability• Zero interaction with environment is impossible• Availability of advanced algorithms

10

Page 11: Toward a Dependable Quantum Computing Architecture

Applications

• Ultra-Precise Clocks• Uncrackable Codes• Improved Microscopes

11

Page 12: Toward a Dependable Quantum Computing Architecture

CONCLUSION

12

Page 13: Toward a Dependable Quantum Computing Architecture

REFERENCES

1. International Technology Roadmap for Semi-conductors, Semiconductor Industry Assoc., San Jose, Calif., 1999. 2. M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge Press, Cambridge, UK, 2000. 3. C.H. Bennett and D.P. DiVincenzo, “Quan-tum Information and Computation,” Nature, vol. 404, no. 6775, 2000, pp. 247-254. 4. N. Gershenfeld and I.L. Chuang, “Bulk Spin-Resonance Quantum Computing,” Science, vol. 275, 1997, pp. 350-356. 5. D.G. Cory, A.F. Fahmy, and T.F. Havel, “Nuclear Magnetic Resonance Spec-troscopy: An Experimentally Accessible Par-adigm for Quantum Computing,” Proc. , vol. 94, Nat’l Academy of Sciences, Washington, D.C., 1997, pp. 1634-1639. 6. L.M.K. Vandersypen et al., “Experimental Realization of an Order-Finding Algorithm with an NMR Quantum Computer” Physical Review Letters, vol. 85, no. 25, 2000, pp. 5452-5455. 7. P. Shor, “Algorithms for Quantum Compu-tation: Discrete Logarithms and Factoring,” Proc. 35th Ann. Symp. Foundations of Com-puter Science, IEEE Computer Soc. Press, Los Alamitos, Calif., 1999, pp. 124-134. 8. A. Ekert and R. Jozsa, “Quantum Computa-tion and Shor’s Factoring Algorithm,” Reviews of Modern Physics, vol. 68, no. 3, 1996, pp. 733-753.

13

Page 14: Toward a Dependable Quantum Computing Architecture

THANK YOU

14