{"id":3952,"date":"2024-09-19T12:08:19","date_gmt":"2024-09-19T12:08:19","guid":{"rendered":"https:\/\/workhouse.sweetdishy.com\/?p=3952"},"modified":"2024-09-19T12:08:20","modified_gmt":"2024-09-19T12:08:20","slug":"introduction-36","status":"publish","type":"post","link":"https:\/\/workhouse.sweetdishy.com\/index.php\/2024\/09\/19\/introduction-36\/","title":{"rendered":"Introduction"},"content":{"rendered":"\n<p>Information as accessed by the human mind, and the myriad ways of process-<\/p>\n\n\n\n<p>ing it, is what has set humankind apart in the animal world. The ability to use<\/p>\n\n\n\n<p>the physical systems around us to encode and then to process information has<\/p>\n\n\n\n<p>been evolving in leaps and bounds ever since the dawn of our race! The earliest<\/p>\n\n\n\n<p>form of computation was probably in the form of account-keeping by counting<\/p>\n\n\n\n<p>pebbles or on the \ufb01ngers. This developed into the abacus, writing symbols,<\/p>\n\n\n\n<p>the computing machine, and now, a laptop or a supercomputer: everywhere<\/p>\n\n\n\n<p>we represent information by means of a physical system, and perform ma-<\/p>\n\n\n\n<p>nipulations on that system to process the information in many desired ways,<\/p>\n\n\n\n<p>including communication. The stress here is on the realization that the basis<\/p>\n\n\n\n<p>of information is a physical system. The more advanced that system is and<\/p>\n\n\n\n<p>the set of rules it functions on, the more capable our means of information<\/p>\n\n\n\n<p>processing and communication. When the underlying physical system used for<\/p>\n\n\n\n<p>encoding and processing information is a quantum system, we have quantum<\/p>\n\n\n\n<p>information processing.<\/p>\n\n\n\n<p>While technological advances have made it possible to reach astounding<\/p>\n\n\n\n<p>speeds and processing power, the basic paradigm of current day information<\/p>\n\n\n\n<p>processing is binary logic with currents or voltages in the semiconductor cir-<\/p>\n\n\n\n<p>cuitry at the heart of the modern computer processors. However, it is impor-<\/p>\n\n\n\n<p>tant to realize that the behavior of these high and low states of the circuit<\/p>\n\n\n\n<p>is based on laws of classical physics. We know now that at the most funda-<\/p>\n\n\n\n<p>mental level, physical systems obey the laws of quantum mechanics. These<\/p>\n\n\n\n<p>laws are fundamentally di\ufb00erent in many ways from classical laws of physics.<\/p>\n\n\n\n<p>Therefore, the basic paradigm of information processing is di\ufb00erent when we<\/p>\n\n\n\n<p>come to quantum information processing. Not only are the algorithms and<\/p>\n\n\n\n<p>the processing mechanism di\ufb00erent, but there are distinct advantages of the<\/p>\n\n\n\n<p>quantum over the classical.<\/p>\n\n\n\n<p>According to recent data, the fastest current day supercomputer is capable<\/p>\n\n\n\n<p>of performing at a speed of hundreds of G\ufb02op\/s.<\/p>\n\n\n\n<p>1<\/p>\n\n\n\n<p>The quantum paradigm<\/p>\n\n\n\n<p>a\ufb00ords a speedup to many algorithms that are very slow to perform even on<\/p>\n\n\n\n<p>this computer! Much of modern-day information security, for instance secure<\/p>\n\n\n\n<p>online cash transactions, is based on classical cryptography. This has been<\/p>\n\n\n\n<p>proved to be vulnerable if a quantum computer is used to crack the code!<\/p>\n\n\n\n<p>I\u2019ve been trying to motivate the need to study quantum information. But<\/p>\n\n\n\n<p>1<\/p>\n\n\n\n<p>Giga\ufb02op per second, Giga = 10<\/p>\n\n\n\n<p>12<\/p>\n\n\n\n<p>, FLOP = \ufb02oating point operation.<\/p>\n\n\n\n<p>3<\/p>\n\n\n\n<p>4 Introduction to Quantum Physics and Information Processing<\/p>\n\n\n\n<p>the inquisitive scienti\ufb01c mind will no doubt want to grasp the basics of the<\/p>\n\n\n\n<p>physical laws that make complex information processing possible: the laws of<\/p>\n\n\n\n<p>quantum mechanics. Professor Richard Feynman of Caltech was supposed to<\/p>\n\n\n\n<p>have famously said that no one understands quantum mechanics! How then are<\/p>\n\n\n\n<p>we basing modern technology on it? With this book I\u2019d like to show you that<\/p>\n\n\n\n<p>despite its \u201cweirdness\u201d, by which I mean its distance from our common sense<\/p>\n\n\n\n<p>understanding which appears wired to classical physics, the laws of quantum<\/p>\n\n\n\n<p>mechanics can be apprehended by an undergraduate student, to be used as a<\/p>\n\n\n\n<p>set of rules by which the game is played. The more philosophically inclined will<\/p>\n\n\n\n<p>be drawn to ponder meaning and interpretation of these rules. And this latter<\/p>\n\n\n\n<p>exercise is also rewarding, in bringing out fascinating new facets of quantum<\/p>\n\n\n\n<p>theory, to be exploited in our ever-expanding game of information processing.<\/p>\n\n\n\n<p>Several considerations make the transition to the quantum inevitable while<\/p>\n\n\n\n<p>exploring e\ufb03cient information processing. One is from the perspective of hard-<\/p>\n\n\n\n<p>ware engineering, where miniaturization and the need to pack more structure<\/p>\n\n\n\n<p>in less space must eventually lead to the limit set by the structure of matter:<\/p>\n\n\n\n<p>the atomic or even electronic level. At this level, classical laws of physics are<\/p>\n\n\n\n<p>no longer valid and we have to consider the essentially quantum nature of the<\/p>\n\n\n\n<p>physical system used to store and manipulate information.<\/p>\n\n\n\n<p>However, from the angle of the basic physical laws of quantum mechanics,<\/p>\n\n\n\n<p>more complex ways of processing information should be possible. The manner<\/p>\n\n\n\n<p>in which a quantum system evolves, transforms information and conveys it<\/p>\n\n\n\n<p>in an experiment via a measurement, is fundamentally di\ufb00erent from classi-<\/p>\n\n\n\n<p>cal information. This was realized \ufb01rst by Feynman [33] in the 1980s when<\/p>\n\n\n\n<p>he pointed out that a quantum process cannot be e\ufb03ciently simulated on a<\/p>\n\n\n\n<p>classical computer. He showed, however, that such a system may be e\ufb03ciently<\/p>\n\n\n\n<p>simulated on a quantum computer.<\/p>\n\n\n\n<p>In the process of studying how this is possible, we are led into a deeper<\/p>\n\n\n\n<p>probing of the foundations of quantum physics. In implementing a quantum<\/p>\n\n\n\n<p>computer, physicists need to access and control individual quantum states,<\/p>\n\n\n\n<p>prepare them, manipulate them and \ufb01nally, measure them. The question also<\/p>\n\n\n\n<p>arises of how to deal with practical systems that are not ideal and isolated from<\/p>\n\n\n\n<p>their environments, but are subject to noise or errors due to inadvertent en-<\/p>\n\n\n\n<p>vironmental e\ufb00ects. These considerations lead us into an experimental regime<\/p>\n\n\n\n<p>of testing our ideas of quantum reality, and into discovering new quantum<\/p>\n\n\n\n<p>phenomena.<\/p>\n\n\n\n<p>The third perspective is from the theory of computation. The foundations<\/p>\n\n\n\n<p>of modern computer science may be said to have been laid by the work of Alan<\/p>\n\n\n\n<p>Turing in the 1930s [69], on abstract models of computing embodied in what<\/p>\n\n\n\n<p>is now known as the Turing Machine. The Universal Turing Machine (UTM)<\/p>\n\n\n\n<p>is an idealization of a model of computation that can execute any computable<\/p>\n\n\n\n<p>algorithm, in short, any task that can be run on a modern programmable<\/p>\n\n\n\n<p>computer. Notions of computability of problems and e\ufb03ciency of algorithms<\/p>\n\n\n\n<p>were developed. In rough terms, an algorithm is said to be e\ufb03cient if it takes<\/p>\n\n\n\n<p>polynomial time for execution. This means that the time required to run it<\/p>\n\n\n\n<p><img loading=\"lazy\" decoding=\"async\" alt=\"\" src=\"https:\/\/learning.oreilly.com\/api\/v2\/epubs\/urn:orm:book:9781482238129\/files\/bg1e.png\" width=\"672\" height=\"452\"><\/p>\n\n\n\n<p>Introduction 5<\/p>\n\n\n\n<p>grows as a polynomial in the number n of input bits, i.e., at most as a power<\/p>\n\n\n\n<p>of n. A computationally hard problem is one for which the best algorithm is<\/p>\n\n\n\n<p>exponential in the number of input bits, i.e., grows as a<\/p>\n\n\n\n<p>n<\/p>\n\n\n\n<p>where a is some<\/p>\n\n\n\n<p>constant.<\/p>\n\n\n\n<p>As Feynman pointed out, the evolution of a quantum system is one prime<\/p>\n\n\n\n<p>example of a problem that cannot be simulated e\ufb03ciently on a Turing machine,<\/p>\n\n\n\n<p>while a quantum computer could quite naturally do so! This was a challenge<\/p>\n\n\n\n<p>to the Church\u2013Turing thesis that any computation can be e\ufb03ciently simulated<\/p>\n\n\n\n<p>on a Turing Machine. This thesis had been modi\ufb01ed to include probabilistic<\/p>\n\n\n\n<p>machines (based on fuzzy logic) but now has been extended to a quantum<\/p>\n\n\n\n<p>version.<\/p>\n\n\n\n<p>Problems in computational complexity have now been extended to include<\/p>\n\n\n\n<p>the quantum Turing machine and the possibilities are exciting. While the<\/p>\n\n\n\n<p>basic notion of computability of a given problem does not change when quan-<\/p>\n\n\n\n<p>tum machines are included, problems that were hard classically may become<\/p>\n\n\n\n<p>easy. Quantum computation may also resolve other questions in the area of<\/p>\n\n\n\n<p>computational complexity.<\/p>\n\n\n\n<p>FIGURE 1.1: Three approaches to the quantum.<\/p>\n\n\n\n<p>These three approaches (Figure (1.1) have historically motivated the study<\/p>\n\n\n\n<p>of this \ufb01eld, which at present however, is rapidly blooming in several di\ufb00erent<\/p>\n\n\n\n<p>directions unforeseen in the last century.<\/p>\n\n\n\n<p>6 Introduction to Quantum Physics and Information Processing<\/p>\n\n\n\n<p>1.1 Bits and Qubits<\/p>\n\n\n\n<p>So what is the fundamental di\ufb00erence between classical and quantum com-<\/p>\n\n\n\n<p>puting?<\/p>\n\n\n\n<p>Computation and information processing as we know it today is built upon<\/p>\n\n\n\n<p>Boolean logic and algebra. Boolean algebra is binary, requiring two logical<\/p>\n\n\n\n<p>units called bits. You can think of them as the possible answers to a decision<\/p>\n\n\n\n<p>question: yes or no. The idea is that almost any problem can be reformulated<\/p>\n\n\n\n<p>as a series of decision questions, and therefore can be encoded in bits. A<\/p>\n\n\n\n<p>bit, or binary digit, is a physical system that can take on two logical states<\/p>\n\n\n\n<p>represented by 0 and 1. In a typical digital computer these states are the low<\/p>\n\n\n\n<p>and high voltage states in the microcircuitry.<\/p>\n\n\n\n<p>To extend the capabilities of the computational system, probabilistic al-<\/p>\n\n\n\n<p>gorithms are based on the notion of fuzzy bits, that can take the value 0 with<\/p>\n\n\n\n<p>a probability p or 1 with probability 1 \u2212 p. This is the basis of probabilistic<\/p>\n\n\n\n<p>computation, or so-called fuzzy logic.<\/p>\n\n\n\n<p>When the logic is extended to binary states of a quantum system, we ar-<\/p>\n\n\n\n<p>rive at the qubit, a quantum bit. A qubit can take values 0 or 1 but with<\/p>\n\n\n\n<p>probabilities given by the mod-squared of complex numbers! A physical qubit<\/p>\n\n\n\n<p>is a quantum system that will represent our Boolean units. The system can<\/p>\n\n\n\n<p>therefore take on two quantum states that we will now represent in the nota-<\/p>\n\n\n\n<p>tion |0i and |1i, to distinguish them from the states 0 and 1 of the classical<\/p>\n\n\n\n<p>bit. This angular bracket notation is due to physicist Paul Dirac [29]. This<\/p>\n\n\n\n<p>notation is very versatile and by itself a useful calculational tool.<\/p>\n\n\n\n<p>A qubit is generically represented as a linear superposition of the basis<\/p>\n\n\n\n<p>states:<\/p>\n\n\n\n<p>|\u03c8i = \u03b1|0i + \u03b2|1i. (1.1)<\/p>\n\n\n\n<p>The coe\ufb03cients \u03b1 and \u03b2 are called probability amplitudes, and satisfy such<\/p>\n\n\n\n<p>that |\u03b1|<\/p>\n\n\n\n<p>2<\/p>\n\n\n\n<p>+ |\u03b2|<\/p>\n\n\n\n<p>2<\/p>\n\n\n\n<p>= 1.<\/p>\n\n\n\n<p>The way to understand this statement is that upon measurement, the<\/p>\n\n\n\n<p>generic qubit takes on one of the de\ufb01nite states |0i or |1i with a probability |\u03b1|<\/p>\n\n\n\n<p>2<\/p>\n\n\n\n<p>or |\u03b2|<\/p>\n\n\n\n<p>2<\/p>\n\n\n\n<p>. In this sense, a qubit is similar to a classical bit in that measurement<\/p>\n\n\n\n<p>only gives one of two values. It is sometimes useful to think of these values,<\/p>\n\n\n\n<p>or the basis states of the qubit, as classical bits.<\/p>\n\n\n\n<p>Though the qubit is probabilistic, it di\ufb00ers from the fuzzy bit because<\/p>\n\n\n\n<p>of the possibility of interference. This is characteristic that is captured by<\/p>\n\n\n\n<p>the complex amplitudes. A complex number has a magnitude and well as a<\/p>\n\n\n\n<p>phase. While composing two or more such numbers, the phases could result<\/p>\n\n\n\n<p>in reinforcement or reduction in the strength of the resultant. The physical<\/p>\n\n\n\n<p>implications of this is familiar to us through the phenomenon of interference<\/p>\n\n\n\n<p>in optics. When two beams of light, described by electric \ufb01elds having de\ufb01-<\/p>\n\n\n\n<p>nite phase relationships to each other, are combined, then there are regions<\/p>\n\n\n\n<figure class=\"wp-block-image is-resized\"><img decoding=\"async\" src=\"https:\/\/learning.oreilly.com\/api\/v2\/epubs\/urn:orm:book:9781482238129\/files\/bg20.png\" alt=\"\" style=\"width:192px;height:auto\"\/><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Information as accessed by the human mind, and the myriad ways of process- ing it, is what has set humankind apart in the animal world. The ability to use the physical systems around us to encode and then to process information has been evolving in leaps and bounds ever since the dawn of our race! [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":3939,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[486],"tags":[],"class_list":["post-3952","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-1-introduction"],"jetpack_featured_media_url":"https:\/\/workhouse.sweetdishy.com\/wp-content\/uploads\/2024\/09\/quantum-computing.png","_links":{"self":[{"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/posts\/3952","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/comments?post=3952"}],"version-history":[{"count":1,"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/posts\/3952\/revisions"}],"predecessor-version":[{"id":3953,"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/posts\/3952\/revisions\/3953"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/media\/3939"}],"wp:attachment":[{"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/media?parent=3952"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/categories?post=3952"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/workhouse.sweetdishy.com\/index.php\/wp-json\/wp\/v2\/tags?post=3952"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}