|
Organizers |
Continuous t-norm as quantum gates: a probabilistic approach
by
Hector Freytes
University of Cagliari
Coauthors: Antonio Ledda, Giuseppe Sergioli
A quantum system in a pure state is described by a unit vector in a Hilbert space. In the Dirac notation a pure state is denoted by |j〉. A quantum bit or qbit, the fundamental concept of quantum computation is a pure state in the Hilbert space C2. The standard orthonormal base { |0〉, |1 〉} of C2 is called the logical basis. Thus a qbit |j〉 may be written as a linear superposition of the basis vectors with complex coefficients |y〉 = c0|0 〉+ c1 |1 〉 with |c0 |2 + |c1 |2 = 1. Quantum mechanics reads out the information content of a pure state via the Born rule. By these means, we consider the probability value assigned to a qbit as follows: p(|y〉) = |c1 |2.
The quantum states of interest for quantum computation lie in the tensor product ⊗n C2 = C2⊗C2 ⊗...⊗C2. The space ⊗n C is a 2n-dimensional complex space. We choose a special basis for ⊗n C which is called the 2n-computational basis. More precisely, it consists of the 2n orthogonal states |i〉, 0 ≤ i ≤ 2n where i is in binary representation and i can be seen as tensor product of states |i〉 = |i1 〉⊗|i2 〉⊗...⊗|in 〉 where ij ∈ {0, 1}. A pure state |y〉 ∈ ⊗n C is generally a superposition of the basis vectors |y〉 = ∑i = 12nci|i〉 with ∑i = 12n |ci |2 = 1.
In general, a quantum system is not in a pure state. This may be attributed to the fact that the systems are not isolated from the rest of the universe, so it does not have a well defined pure state. We say that the system is in a mixed state which is described by a density operator. A density operator is a Hermitian (i.e rf = r) positive trace class operator on a 2n-dimensional complex Hilbert space with trace trr = 1. A pure state |y〉 can be represented by the operator r = |y〉〈y|, where 〈y| = (|y〉)f. As a particular case, with each vector of the logical base of C2 we consider the very important density operators P0 = |0 〉〈0 | and P1 = |1〉〈1 | that represent, the truth-property and the falsity-property respectively.
One can represent an arbitrary density operator r for n-qbits in terms of tensor products of the Pauli matrices:
|
in the following way: r = [1/(2n)] ∑m1...mn Pm1 ...mn (sm1⊗...⊗smn) where mi ∈ {0, x, y, z} for each i=1...n and |Pm1 ...mn | ≤ 1 . We denote by D(⊗n C2) the set of all density operators of ⊗n C2. Moreover, we can identify, in each space D(⊗n C2), two special operators P0(n) = [1/(2n)] In-1⊗P0 and P1(n) = [1/(2n)] In-1⊗P1 that represent, in this framework, the truth-property and the falsity-property. By applying the Born rule, we obtain the probability value corresponding to the fact that the physical system in the state r ∈ D(⊗n C2) satisfies the truth-property P1(n) as follows: p(r) = Tr(P1(n) r). In the particular case that r = |y〉〈y|, where |y〉 = c0|0 〉+ c1 |1 〉 we obtain that p(r) = |c1 |2.
In the simplest representation of the work of a quantum computer, the state of the system is a pure state and the operations are represented by unitary operators. These operations are identified with the quantum gates. But when the system is open because it is either coupled to an environment or is being subject to a measurement, in general its time evolution is irreversible. A general model of quantum computation which takes into account this situation is captured mathematically by means of quantum operations as quantum gates [5], acting on density operators.
In general, let M be a finite dimensional complex Hilbert space and L(M) be the vectorial space of all linear operators on M. A quantum operation is a linear operator E: L(N)→ L(M) representable as
|
In the present work we provide a probabilistic version of the well known Stone Weierstrass theorem applied to quantum operations, which will allow us to regard any continuous t-norm on [0, 1] as a quantum operation. More precisely, let f be a continuous t-norm. Then, for each e > 0, there exists M > 0 and a quantum operation E such that, for any pair of density operators s1, s2,
|
[1] B. Gerla, Conditioning a state by a \L ukasiewicz event: a probabilistic approach to Ulam games, Theoretical Computer Science 230, (2000), pp. 149-166.
[2] D. Mundici, Averaging the truth value in \L ukasiewicz sentential logic, Studia Logica 55, (1995), pp. 113-127.
[3] D. Mundici, B. Riecan Probability on MV-algebras, In: Handbook of Measure Theory, E. Pap, Ed., North-Holland, Amsterdam, (2002), pp. 869-909.
[4] Paoli F., Ledda A., Giuntini R., Freytes H.: On some properties of QMV algebras and √' QMV-algebras, Reports on Mathematical Logic, 44, (2008), pp. 53-85.
[5] Tarasov V. Quantum computer with Mixed States and Four-Valued Logic, Journal of Physics A 35 (2002), 5207-5235.
Date received: February 27, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cavs-23.