In this paper we generalize the usual model of quantum computer to a model in which the state is an operator of density matrix and the gates are general superoperators (quantum operations), not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum system (open or closed n-qubit system) is considered as an element of $4^{n}$-dimensional operator Hilbert space (Liouville space). It allows to use quantum computer (circuit) model with 4-valued logic. The gates of this model are general superoperators which act on n-ququats state. Ququat is quantum state in a 4-dimensional (operator) Hilbert space. Unitary two-valued logic gates and quantum operations for n-qubit open system are considered as four-valued logic gates acting on n-ququats. We discuss properties of quantum 4-valued logic gates. In the paper we study universality for quantum four-valued logic gates.
In this paper we generalize the usual model of quantum computer to a model in which the state is an operator of density matrix and the gates are general superoperators (quantum operations), not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum system (open or closed n-qubit system) is considered as an element of 4n-dimensional operator Hilbert space (Liouville space). It allows to use quantum computer (circuit) model with 4-valued logic. The gates of this model are general superoperators which act on n-ququats state. Ququat is quantum state in a 4-dimensional (operator) Hilbert space. Unitary two-valued logic gates and quantum operations for n-qubit open system are considered as four-valued logic gates acting on n-ququats. We discuss properties of quantum 4-valued logic gates. In the paper we study universality for quantum four-valued logic gates.
In this paper we discuss a model of quantum computer in which a state is an operator of density matrix and gates are general quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum systems is considered as an element of 4 n -dimensional operator Hilbert space (Liouville space). It allows us to use a quantum computer model with four-valued logic. The gates of this model are general superoperators which act on n -ququat state. Ququat is a quantum state in a four-dimensional (operator) Hilbert space. Unitary two-valued logic gates and quantum operations for an n -qubit open system are considered as four-valued logic gates acting on n -ququats. We discuss properties of quantum four-valued logic gates. In the paper we study universality for quantum four-valued logic gates.
Usually models for quantum computations deal with unitary gates on pure states. In this paper we generalize the usual model. We consider a model of quantum computations in which the state is an operator of density matrix and the gates are quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum systems is considered as an element of 4n-dimensional operator Hilbert space. Unitary quantum gates and nonunitary quantum operations for n-qubit system are considered as generalized quantum gates acting on mixed state. In this paper we study universality for quantum computations by quantum operations on mixed states.
The pure states of two-qubit quantum systems are described by a four-dimensional vector of complex numbers, and unitary operators transferring a two-qubit quantum system from one state to another have the form of a 4×4 matrix with complex elements. This fact brings to mind the idea of studying the spaces of four-dimensional numbers with complex components. Moreover, the results obtained by the authors for four-dimensional numbers with real components inspire some optimism. In this paper we construct four-dimensional spaces of complex numbers by analogy with four-dimensional spaces of real numbers. Each four-dimensional number is mapped to a matrix formed from its components and it is proved that the constructed mapping is a bijection and a homomorphism. In the space of four-dimensional numbers of the eight basis elements, half are real and half are imaginary. The presence of such symmetry distinguishes these spaces from the space of quaternions, in which one basis element is real and the rest are imaginary. The symmetry of the basis numbers makes these spaces a natural generalization of one-dimensional and two-dimensional (complex) algebra. The conditions under which the corresponding matrices are gates for two-qubit quantum systems are defined. The notion of a unitary state of a two-qubit quantum system is introduced, to which various gates from commutative groups of gates correspond. It is shown that any gate of a unitary state transforms a unitary state into a unitary state and a non-unitary state into a non-unitary state. Almost all gates used in the construction of quantum circuits, in particular H, SWAP, CX, CY, and CZ, have the same properties. The problem of searching for a gate that transfers a quantum system from one unitary state to another unitary state has been solved. Thus, with the help of four-dimensional spaces of complex numbers it was possible to construct whole classes of two-qubit gates, which opens new possibilities for the construction of quantum algorithms. The results obtained have important theoretical and practical implications for quantum computing.
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.
A model of quantum computation is discussed in (Aharanov et al 1997 Proc. 13th Annual ACM Symp. on Theory of Computation, STOC pp 20–30) and ( Tarasov 2002 J. Phys. A: Math. Gen. 35 5207–35 ) in which quantum gates are represented by quantum operations acting on mixed states. It allows one to use a quantum computational model in which connectives of a four-valued logic can be realized as quantum gates. In this model, we give a representation of certain functions, known as t -norms (Menger 1942 Proc. Natl Acad. Sci. USA 37 57–60), that generalize the triangle inequality for the probability distribution-valued metrics. As a consequence an interpretation of the standard operations associated with the basic fuzzy logic (Hájek 1998 Metamathematics of Fuzzy Logic ( Trends in Logic vol 4) (Dordrecht: Kluwer)) is provided in the frame of quantum computation.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers. The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected. This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate. Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.