In the hypothetical quantum computing one replaces the classical twostate bit by a quantum element (qubit) with two basic states, ↑ and ↓.Its arbitrary state is described by the wave function ψ = a↑+ b↓, where a and b are complex amplitudes, satisfying the normalization condition.Unlike the classical bit, that can be only in one of the two states, ↑ or ↓, the qubit can be in a continuum of states defined by the quantum amplitudes a and b.The qubit is a continuous object.At a given moment, the state of a quantum computer with N qubits is characterized by 2 N quantum amplitudes, which are continuous variables restricted by the normalization condition only.Thus, the hypothetical quantum computer is an analog machine characterized by a super-astronomical number of continuous variables (even for N~100÷1000).Their values cannot be arbitrary, they must be under our control.Thus the answer to the question in title is: When physicists and engineers will learn to keep under control this number of continuous parameters, which means -never.
In the hypothetical quantum computing one replaces the classical twostate bit by a quantum element (qubit) with two basic states, ↑ and ↓.Its arbitrary state is described by the wave function ψ = a↑+ b↓, where a and b are complex amplitudes, satisfying the normalization condition.Unlike the classical bit, that can be only in one of the two states, ↑ or ↓, the qubit can be in a continuum of states defined by the quantum amplitudes a and b.The qubit is a continuous object.At a given moment, the state of a quantum computer with N qubits is characterized by 2 N quantum amplitudes, which are continuous variables restricted by the normalization condition only.Thus, the hypothetical quantum computer is an analog machine characterized by a super-astronomical number of continuous variables (even for N~100÷1000).Their values cannot be arbitrary, they must be under our control.Thus the answer to the question in title is: When physicists and engineers will learn to keep under control this number of continuous parameters, which means -never.
The quantum computer is supposed to process information by applying unitary transformations to 2 N complex amplitudes defining the state of N qubits. A useful machine needing N~10 3 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is at least 2 1000 ~10 300 which is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proved via the “threshold theorem”. Like for any theorem, the proof is based on a number of assumptions considered as axioms. However, in the physical world none of these assumptions can be fulfilled exactly. Any assumption can be only approached with some limited precision. So, the rather meaningless “error per qubit per gate” threshold must be supplemented by a list of the precisions with which all assumptions behind the threshold theorem should hold. Such a list still does not exist. The theory also seems to ignore the undesired free evolution of the quantum computer caused by the energy differences of quantum states entering any given superposition. Another important point is that the hypothetical quantum computer will be a system of 10 3 –10 6 qubits PLUS an extremely complex and monstrously sophisticated classical apparatus. This huge and strongly nonlinear system will generally exhibit instabilities and chaotic behavior.
In general, all forms of information processing can be considered in a quantum mechanical context, including for example communication, channel capacities, and the quantum limits to information extraction. In this chapter we introduce the basic features of quantum information processing. We first present qubits as abstractions of two-level addressable quantum systems, before generalizing this concept to higher-dimensional qudit systems, and continuous variables. We introduce the stabilizer formalism towards the beginning of our discussion as a convenient way to track quantum information. In Section 2.2 we derive the no-cloning theorem, which leads us to cryptography, teleportation, and quantum repeaters. Section 2.3 describes quantum computing with qubits. We start with a brief description of the circuit model, and use it to define cluster states and the one-way model. We study the properties of cluster states and discuss error correction. In the last section we introduce quantum computing over continuous variables. Quantum information Classically, information is carried by ‘bits’, which are physical systems that have two (macroscopic) states denoted by 0 and 1. These bits are described classically, which immediately raises the question of how we should extend this information-theoretic description to the quantum mechanical case. This will lead to the quantum unit of information, the quantum bit or ‘qubit’. 2.1.1 Classical and quantum bits We can define the qubit as a two-dimensional quantum system, which means that the state space of the system is a two-dimensional complex Hilbert space ℋ.
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.
The first computer originated as an ordinary calculator in 19th century. Subsequently, the rapid evolution of computers began. The massive amount of processing power generated by computer manufacturers has always failed to quench the thirst for speed and computing capacity. If, as Moore's Law states, the number of transistors on a microprocessor continues to double every 18 months, then soon we will find the circuits on a microprocessor being measured on an atomic scale. Today's advanced lithographic techniques can squeeze fraction of micron wide logic gates and wires onto the surface of silicon chips. Thus it can be seen that very soon we will be facing the need to create quantum computers which can harness the power of atoms and molecules to perform memory and processing tasks. Quantum computers have the potential to perform calculations a billion times faster than any silicon-based computer. Also, theories suggest that every physical object, even the universe, is in some sense a quantum computer. If this is the case, then according to Turing's work which says that all computers are functionally equivalent; computers should be able to model every physical process. Scientists have already built basic quantum computers that can perform certain calculations; but a practical quantum computer is still years away. In this paper, we will be discussing about the history, development and the future scope of quantum computing. The pros and cons of this future technology have also been compared and our analysis has been put forth.
We propose a model for computing of a certain set of analytical functions based on estimating the output distribution of multiphoton outcomes in an optical scheme with an initial single-mode squeezed vacuum (SMSV) state and photonic states measuring the number of photons in one of the output modes of the beam splitter (BS) by photon number resolving (PNR) detector. The set of considered analytical functions is polynomial expressions including arbitrary derivatives of certain functions which can take on very large values even on small interval in their argument and small values of the parameter indicating the number of the subtracted photons. The large values that the analytic functions can take are offset by a very small term including the factorial of the number of subtracted photons, which guarantees an output normalized distribution of multiphoton measurement outcomes. The quantum computing algorithm makes it possible to find the values of the analytical functions for each number of extracted photons after a sufficiently large number of trials that would allow replacing the measurement repetition rate of multiphoton events by their probabilities. Changing the initial parameters (squeezing amplitude of the SMSV state and BS parameter) makes it possible to implement calculations of the functions over the entire (or, at least, significant) continuous interval of alteration in their argument. The potential of optical quantum computing based on nonclassical states of a certain parity can be expanded both by adding new optical elements such as BSs, and by using other continuous variable (CV) states of definite parity.