Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0312131 · Journal of Physics A Mathematical and General

Quantum computer with mixed states and four-valued logic

Vasily Evgenevich Tarasov

Published Jun 14, 2002• 65 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/0305-4470/35/25/305

Related papers

Open n-Qubit System as a Quantum Computer with Four-Valued Logic

Vasily Evgenevich Tarasov

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.

arXiv:quant-ph/0112023•Dec 4, 2001•3 citations

Quantum Computation by Quantum Operations on Mixed States

Vasily Evgenevich Tarasov

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 $4^{n}$-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.

arXiv:quant-ph/0201033•Jan 9, 2002•6 citations

Representing continuoust-norms in quantum computation with mixed states

Héctor Freytes, Giuseppe Sergioli, Antonino Salvatore Aricò

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.

Journal of Physics A Mathematical and Theoretical•Nov 1, 2010•21 citations

Four-Dimensional Spaces of Complex Numbers and Unitary States of Two-Qubit Quantum Systems

Mars B. Gabbassov, Tolybay Z. Kuanov, Turganbay K. Yermagambetov +1 more

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.

Symmetry•Oct 22, 2025•0 citations

Quantum Gates and Circuits

Kolla Bhanu Prakash

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.

Wiley eBooks•Aug 17, 2026•0 citations

Synthesis of Hybrid and d-valued Quantum Logic Circuits

Faisal Shah Khan, Marek A. Perkowski

Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two or more qudits have different finite dimensions. In both cases, a quantum computation is performed when a unitary evolution operator, acting as a quantum logic gate, transforms the state of qudits in a quantum system. Unitary operators can be represented by unitary matrices, and therefore for a quantum system consists of multiple qudits, a gate may be synthesized by matrix decomposition techniques such as QR factorization and the Cosine-sine Decomposition (CSD). In this article, we present a CSD based synthesis method for n qudit hybrid and d-valued quantum circuits.

IEEE Congress on Evolutionary Computation (CEC)•Sep 22, 2006•0 citations
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.
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 4n4^{n}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.
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 4n4^{n}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.
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.
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.
Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two or more qudits have different finite dimensions. In both cases, a quantum computation is performed when a unitary evolution operator, acting as a quantum logic gate, transforms the state of qudits in a quantum system. Unitary operators can be represented by unitary matrices, and therefore for a quantum system consists of multiple qudits, a gate may be synthesized by matrix decomposition techniques such as QR factorization and the Cosine-sine Decomposition (CSD). In this article, we present a CSD based synthesis method for n qudit hybrid and d-valued quantum circuits.