Quantum Computing, Part 2.

Andrew S. Glassner

T. Venkat Narayana Rao, Shirish Pathania

This paper is written to explicate the working of Quantum Computing and its mechanics. Quantum Computing is basically a minutefield from Nanotechnology. The main purpose of this paper is to explain an inexperienced user about the technology and principles used whiledesigning the architect of a quantum computer.Operational quantum computers would be a reality in forth coming years by the virtue of newmechanisms to explore and implementations.This paper is sectioned into 7 parts. Part 1 is a brief introduction to Quantum Computing i.e. basicworking principle of a Qubit. Part 2 covers Qubit and the architect of the whole system. It also enlightens us about the Qubit in more detail likehow data is represented, principles like superposition and state of composite system. Part 3 narrates how quantum Computing can be built usingQubits and applies the above mentioned principles. Part 4 deals with the basic introduction to Quantum Mechanics and some principles like dualnature of light and Uncertainty Principle. Part 5 depicts about the advantages of Quantum Computer over present computing systems. Part 6discusses the overheads of Quantum Computing. Part 7 describes about implementation of Quantum Computing in today’s world. Finally thispaper offers an insight about how and by when we would be able to design a full time Quantum Computer and what are the probableconsiderations to be taken in to account. Keywords: Hilbert space, Bloch Sphere Qubit, Superposition, Entanglement, Spin, Eigen values, Ket vectors, Wave-particle duality, Uncertaintyprinciple, Quantum mechanics, decoherence

Ge Wang, Yi Zhang, Xiaojing Ye +1 more

Helmut Bez, Tony Croft

Quantum Computation presents the mathematics of quantum computation. The purpose is to introduce the topic of quantum computing to students in computer science, physics and mathematics who have no prior knowledge of this field. The book is written in two parts. The primary mathematical topics required for an initial understanding of quantum computation are dealt with in Part I: sets, functions, complex numbers and other relevant mathematical structures from linear and abstract algebra. Topics are illustrated with examples focussing on the quantum computational aspects which will follow in more detail in Part II. Part II discusses quantum information, quantum measurement and quantum algorithms. These topics provide foundations upon which more advanced topics may be approached with confidence. Features A more accessible approach than most competitor texts, which move into advanced, research-level topics too quickly for today's students. Part I is comprehensive in providing all necessary mathematical underpinning, particularly for those who need more opportunity to develop their mathematical competence. More confident students may move directly to Part II and dip back into Part I as a reference. Ideal for use as an introductory text for courses in quantum computing. Fully worked examples illustrate the application of mathematical techniques. Exercises throughout develop concepts and enhance understanding. End-of-chapter exercises offer more practice in developing a secure foundation.

H. John Caulfield, Lei Qian

Rajendra Kumar Bera

In Part I we laid the foundation on which quantum algorithms are built. In part II we harnessed such exotic aspects of quantum mechanics as superposition, entanglement and collapse of quantum states to show how powerful quantum algorithms can be constructed for efficient computation. In Part III (the concluding part) we discuss two aspects of quantum computation: (1) the problem of correcting errors that inevitably plague physical quantum computers during computations, by algorithmic means; and (2) a possible underlying mechanism for the collapse of the wave function during measurement.