Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Mirco A. Mannucci is active.

Publication


Featured researches published by Mirco A. Mannucci.


Archive | 2008

Quantum Computing for Computer Scientists: Theoretical Computer Science

Noson S. Yanofsky; Mirco A. Mannucci

The meaning of the world is the separation of wish and fact. Kurt Godel, quoted in Hao Wangs A Logical Journey: From Godel to Philosophy , page 309 In a sense, theoretical computer science is uniquely qualified to study quantum computing. After all, Alan Turing and the other founders of theoretical computer science studied formal computation long before engineers actually produced a real-life computer. At present, large-scale quantum computers are not a reality yet. Nevertheless, the theoretical analysis of quantum computability and complexity is well on its way. In Section 8.1, we start with a quick review of some of the basics of deterministic and nondeterministic Turing machines and the complexity classes that they engender. However, we shall discuss them in a way that is easily generalizable for our purposes. Section 8.2 moves on to probabilistic Turing machines and their zoo of complexity classes. Our main objective is found in Section 8.3, where we meet quantum Turing machines and their complexity classes. We shall also state some basic theorems and ideas about quantum computation. DETERMINISTIC AND NONDETERMINISTIC COMPUTATIONS Theoretical computer science deals with the question, “What is computable?” We must immediately qualify the question: “computable according to which model of computation?” It turns out that if we omit the question of efficiency, all sufficiently complicated formal models of computation can simulate each other. However, in order to fix our ideas and notation, we have to stick with one and work with it.


Archive | 2008

Quantum Computing for Computer Scientists: Basic Quantum Theory

Noson S. Yanofsky; Mirco A. Mannucci

Reality is that which, when you stop believing in it, does not go away. Philip K. Dick In Chapters 1 and 2 we developed the necessary mathematical apparatus and terminology that will be used throughout this book. Chapter 3 has provided some heuristics and gently led us to the threshold of quantum mechanics. It is now time to open the door, introduce the basic concepts and tools of the trade, and continue our journey to quantum computing. In Section 4.1 we spend a few words on the motivations behind quantum mechanics. We then introduce quantum states and how they are distinguishable from one another through observations. Section 4.2 describes observable physical quantities within the quantum framework. How observable quantities are measured is the topic of Section 4.3. The dynamics of quantum systems, i.e., their evolution in time, is the focus of Section 4.4. Finally, in Section 4.5, we revisit the tensor product and show how it describes the way in which larger quantum systems are assembled from smaller ones. In the process, we meet the crucial notion of entanglement, a feature of the quantum world that pops up again in the chapters ahead. QUANTUM STATES Why quantum mechanics? To answer this question, we have to hearken back in time to the dawn of the twentieth century. Classical mechanics still dominated the scene, with its double-pronged approach: particles and waves .


Archive | 2008

Quantum Computing for Computer Scientists: Complex Vector Spaces

Noson S. Yanofsky; Mirco A. Mannucci

Philosophy is written in that great book which continually lies open before us (I mean the Universe). But one cannot understand this book until one has learned to understand the language and to know the letters in which it is written. It is written in the language of mathematics, and the letters are triangles, circles and other geometric figures. Without these means it is impossible for mankind to understand a single word; without these means there is only vain stumbling in a dark labyrinth. Galileo Galilei Quantum theory is cast in the language of complex vector spaces. These are mathematical structures that are based on complex numbers. We learned all that we need about such numbers in Chapter 1. Armed with this knowledge, we can now tackle complex vector spaces themselves. Section 2.1 goes through the main example of a (finite-dimensional) complex vector space at tutorial pace. Section 2.2 provides formal definitions, basic properties, and more examples. Each of Section 2.3 through Section 2.7 discusses an advanced topic. Reader Tip . The reader might find some of this chapter to be “just boring math.” If you are eager to leap into the quantum world, we suggest reading the first two or three sections before moving on to Chapter 3. Return to Chapter 2 as a reference when needed (using the index and the table of contents of find specific topics).


Archive | 2008

Quantum Computing for Computer Scientists

Noson S. Yanofsky; Mirco A. Mannucci


Archive | 2008

Quantum Computing for Computer Scientists: The Leap from Classical to Quantum

Noson S. Yanofsky; Mirco A. Mannucci


Archive | 2008

Quantum Computing for Computer Scientists: Programming Languages

Noson S. Yanofsky; Mirco A. Mannucci


Archive | 2008

Quantum Computing for Computer Scientists: Complex Numbers

Noson S. Yanofsky; Mirco A. Mannucci


Archive | 2008

Quantum Computing for Computer Scientists: Answers to Selected Exercises

Noson S. Yanofsky; Mirco A. Mannucci


Archive | 2008

Quantum Computing for Computer Scientists: Algorithms

Noson S. Yanofsky; Mirco A. Mannucci


Archive | 2008

Quantum Computing for Computer Scientists: Cryptography

Noson S. Yanofsky; Mirco A. Mannucci

Collaboration


Dive into the Mirco A. Mannucci's collaboration.

Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge