It is shown how a classical system can possess such quantum properties as indeterminism, interference of probabilities, unitary transformations, wave functions, and noncommuting operators, and be used in quantumlike computations.
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.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
We consider an application of the mathematical formalism of quantum mechanics outside physics, namely, to game theory. We present a simple game between macroscopic players, say, Alice and Bob (or in a more complex form—Alice, Bob, and Cecilia), which can be represented in the quantumlike (QL) way—by using a complex probability amplitude (game’s “wave function”) and noncommutative operators. The crucial point is that games under consideration are so-called extensive form games. Here the order of actions of players is important; such a game can be represented by the tree of actions. The QL probabilistic behavior of players is a consequence of incomplete information (which is available to, e.g., Bob) about the previous action of Alice. In general one could not construct a classical probability space underlying a QL game. This can happen even in a QL game with two players. In a QL game with three players Bell’s inequality can be violated. The most natural probabilistic description is given by the so-called contextual probability theory completed by the frequency definition of probability.