As device structures get smaller quantum mechanical effects predominate. About twenty years ago it was shown that it was possible to redesign devices so that they could still carry out the same functions. Recently it has been shown that the processing speed of computers based on quantum mechanics is indeed far superior to their classical counterparts for some important applications. This paper introduces quantum mechanics and shows how this can be used for computation.
As device structures get smaller quantum mechanical effects predominate. About twenty years ago it was shown that it was possible to redesign devices so that they could still carry out the same functions. Recently it has been shown that the processing speed of computers based on quantum mechanics is indeed far superior to their classical counterparts for some important applications. This paper introduces quantum mechanics and shows how this can be used for computation.
In Part II of this book we show how computations can be implemented using quantum systems. As we will see, the differences between bits and qubits, briefly outlined in Part I, lead to some important consequences for quantum computing. We begin with a brief introduction to the fundamental principles underlying quantum computing: specific implementations will be considered in later chapters. Reversible computing While quantum computation in its modern form is still a relatively young discipline, researchers have been interested in the relationship between quantum mechanics and computing for a long time. Early workers were not interested in the ideas of quantum parallelism , which will be explored in the next section, but rather in the question of whether explicitly quantum mechanical systems could be used to implement classical computations. In addition to its intrinsic interest, there are two technological reasons why this might be considered an important question. The first reason is a direct consequence of Moore's laws. After the development of integrated circuits, computing technology began its headlong dash down the twin roads of ever-faster and ever-smaller devices. These two phenomena are closely related: as computing devices must communicate within themselves, and as the speed of information transfer cannot exceed the speed of light, faster computers must indeed be smaller. There is, however, a limit to this process, defined by the atomic scale: once the size of individual transistors becomes comparable with that of atoms, the old-fashioned approach of micro-electronics becomes completely untenable.
Quantum theory is vital for the next generation data processing devices. As computers become faster they must become smaller because of the finiteness of the speed of light. The history of computer technology has involved a sequence of changes from one type of physical realisation to another - from gears to relays to valves to transistors to integrated circuits and so on. The step to the molecular scale - the quantum level - will be next. Quantum theory is already important in the design of microelectronic components. Soon it will be necessary to harness quantum theory, rather than simply take it into account, to give data processing devices new functionality.
A classical simulation of quantum systems demands enormous computational resources. The dimension of underlying Hilbert space scales exponentially with the number of participating elements ( N ), requiring a 2 2N size of calculation matrix for a unitary operation, for example, 2 100 ≈ 10 30 for only N = 50. With the increase of N , the first obstacle to encounter is in fact the deficiency of computer memories. A straightforward resolution is to use a quantum computer, a calculating device that operates with the principle of quantum mechanics. During the last twenty years, quantum computing once considered as theoretical exercise has become an important field of research in modern physics. At the forefront of quantum information technology, quantum computing has emerged as a new engineering field with broad interest not only in physics but also in computer science, electronics engineering, and mathematics.
Computers today become faster by becoming smaller. By reducing the size of transistors, engineers are able to fit more of them on a given size microprocessor, thus increasing the processor's computational power. This process cannot continue forever. It has been estimated that sometime within the next two decades, at the current rate, engineers will be faced with the problem of building something that is smaller than an atom. This is as far as our current "classical" computing paradigm will take us. Quantum computing is a potential solution to this problem. This paradigm of computing seeks to directly exploit quantum mechanical phenomena to perform calculations or in some way boost computational efficiency. Some problems can theoretically be solved on a quantum computer exponentially faster than on a classical computer. An overview of the subject is provided here with emphasis on quantum information processing and physical realizations of a quantum computer. Included is a brief history of the subject, a discussion of quantum computing notions such as parallelism and entanglement and their use in quantum algorithms, and conjecture on the prospects and pitfalls of this theory.
The recent biotechnological progress has allowed life scientists and physicians to access an unprecedented, massive amount of data at all levels (molecular, supramolecular, cellular and so on) of biological complexity. So far, mostly classical computational efforts have been dedicated to the simulation, prediction or de novo design of biomolecules, in order to improve the understanding of their function or to develop novel therapeutics. At a higher level of complexity, the progress of omics disciplines (genomics, transcriptomics, proteomics and metabolomics) has prompted researchers to develop informatics means to describe and annotate new biomolecules identified with a resolution down to the single cell, but also with a high-throughput speed. Machine learning approaches have been implemented to both the modelling studies and the handling of biomedical data. Quantum computing (QC) approaches hold the promise to resolve, speed up or refine the analysis of a wide range of these computational problems. Here, we review and comment on recently developed QC algorithms for biocomputing, with a particular focus on multi-scale modelling and genomic analyses. Indeed, differently from other computational approaches such as protein structure prediction, these problems have been shown to be adequately mapped onto quantum architectures, the main limit for their immediate use being the number of qubits and decoherence effects in the available quantum machines. Possible advantages over the classical counterparts are highlighted, along with a description of some hybrid classical/quantum approaches, which could be the closest to be realistically applied in biocomputation.