Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
We have seen how information can be encoded onto a quantum system by selecting the state in which it is prepared. Retrieving the information is achieved by performing a measurement, and the optimal measurement in any given situation is usually a generalized measurement. In between preparation and measurement, the information resides in the quantum state of the system, which evolves in a manner determined by the Hamiltonian. The associated unitary transformation may usefully be viewed as quantum information processing; if we can engineer an appropriate Hamiltonian then we can use the quantum evolution to assist in performing computational tasks. Our objective in quantum information processing is to implement a desired unitary transformation. Typically this will mean coupling together a number, perhaps a large number, of qubits and thereby generating highly entangled states. It is fortunate, although by no means obvious, that we can realize any desired multiqubit unitary transformation as a product of a small selection of simple transformations and, moreover, that each of these need only act on a single qubit or on a pair of qubits. The situation is reminiscent of digital electronics, in which logic operations are decomposed into actions on a small number of bits. If we can realize and control a very large number of such operations in a single device then we have a computer. Similar control of a large number of qubits will constitute a quantum computer. It is the revolutionary potential of quantum computers, more than any other single factor, that has fuelled the recent explosion of interest in our subject. We shall examine the remarkable properties of quantum computers in the next chapter. In digital electronics, we represent bit values by voltages: the logical value 1 is a high voltage (typically +5 V) and 0 is the ground voltage (0 V). The voltage bits are coupled and manipulated by transistor-based devices, or gates. The simplest gates act on only one bit or combine two bits to generate a single new bit, the value of which is determined by the two input bits. For a single bit, with value 0 or 1, the only possible operations are the identity (which does not require a gate) and the bit flip.
Digital systems that are most familiar are based on binary digits, or “bits.” Quantum computing is different from classical computing in a number of significant ways. The fundamental unit of information in quantum computing is the qubit (pronounced “KEW-bit”), short for quantum bit. The capabilities and behavior of qubits are quite different than bits, and the authors begin by pointing out and discussing the key differences as a launching point for their study of quantum computing. It is also possible to have gates with multiple qubits as inputs. However, unlike classical multi-bit gates, the fact that quantum gates are reversible requires that there must be the same number of output qubits as input qubits. The authors explore some common two-qubit gates. With a better understanding of quantum states and operations, they are now ready to construct a proof of the no-cloning theorem.
In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.
In everyday life, practically all the information which is processed, exchanged or stored is coded in the form of discrete entities called bits , which take two values only, by convention 0 and 1. With the present technology for computers and optical fibers, bits are carried by electrical currents and electromagnetic waves corresponding to macroscopic fluxes of electrons and photons, and they are stored in memories of various kinds, for example, magnetic memories. Although quantum physics is the basic physics which underlies the operation of a transistor (Chapter 6) or of a laser (Chapter 4), each exchanged or processed bit corresponds to a large number of elementary quantum systems, and its behavior can be described classically due to the strong interaction with the environment (Chapter 9). For about thirty years, physicists have learned to manipulate with great accuracy individual quantum systems: photons, electrons, neutrons, atoms, and so forth, which opens the way to using two-state quantum systems, such as the polarization states of a photon (Chapter 2) or the two energy levels of an atom or an ion (Chapter 4) in order to process, exchange or store information. In § 2.3.2, we used the two polarization states of a photon, vertical ( V ) and horizontal ( H ), to represent the values 0 and 1 of a bit and to exchange information. In what follows, it will be convenient to use Dirac’s notation (see Appendix A.2.2 for more details), where a vertical polarization state is denoted by | V 〉 or |0〉 and a horizontal one by | H 〉 or |1〉, while a state with arbitrary polarization will be denoted by |ψ〉. The polarization states of a photon give one possible realization of a quantum bit , or for short a qubit . Thanks to the properties of quantum physics, quantum computers using qubits, if they ever exist, would outperform classical computers for some specific, but very important, problems. In Sections 8.1 and 8.2, we describe some typical quantum algorithms and, in order to do so, we shall not be able to avoid some technical developments. However, these two sections may be skipped in a first reading, as they are not necessary for understanding the more general considerations of Sections 8.3 and 8.4.
Abstract As discussed in Chap. 10.1007/978-3-030-61601-4_2 , information in classical computers is represented by bits. However, if the bits did not change, then the computer would remain the same forever and would not be very useful! Therefore, it is necessary to change the values of bits depending on what you want the computer to do. For example, if you want a computer to multiply the number 2 and the number 3 together to produce the number 6, then you need to put each of the numbers 2 and 3 into an 8-bit binary representation, and then have a computational operation to multiply the two 8-bit values together to produce 6. The operation of changing bits in a classical computer is performed by classical logic gates.
Classical computers — the devices on which this article was written and on which you are reading it — operate on a binary logic of 0s and 1s. Every calculation, every image, every piece of music and every financial transaction is ultimately reducible to combinations of these two states. Quantum computers operate on a fundamentally different principle, exploiting quantum mechanical phenomena — superposition, entanglement, and quantum interference — to process information in ways that classical computing cannot replicate at any scale. This is not simply a matter of being faster. Quantum computers are architecturally different from classical computers in a way that makes them uniquely suited to solving specific categories of problems — drug discovery molecular simulation, cryptographic analysis, optimisation problems with millions of variables, and the simulation of quantum systems — that are practically intractable for classical machines. This article provides a scientifically accurate and conceptually accessible explanation of quantum computing, examining the six core concepts that distinguish it: superposition (qubits existing in multiple states simultaneously), entanglement (the correlation of quantum states across physical distance), quantum interference (the amplification of correct answers and cancellation of errors), decoherence (the primary engineering challenge), quantum gates (the operations that replace classical logic gates), and quantum advantage (the specific domains where quantum computing genuinely outperforms classical systems). Drawing on research from IBM Quantum, Google AI's quantum supremacy claims, and the philosophical parallels between quantum non-locality and the Vedantic concept of Akasha (the fifth element of interconnected space), the article makes quantum computing genuinely comprehensible without sacrificing scientific accuracy.