Multipartite Entanglement and its Role in

Quantum Algorithms

Kaushik Chakraborty
1
, Ankan Mullick
2


Computer Science & Engineering Department,
Jadavpur University
1,2
{Kaushik.chakraborty9@gmail.com
1
,ankml3@gm
ail.com
2
}

Abstract-- Quantum algorithmsthe algorithms that
have been developed exploiting quantum mechanical
properties like superposition and entanglement of
quantum systems are provably more powerful than
classical algorithms in solving wide classes of
problems like discrete log and factoring and many
more ([1],[2],[3]). Most of the cases quantum
algorithm gives exponential speed up than classical
algorithms. The reason behind giving this exponential
speed up is not totally understood by the scientists.
Though in [5] it has been shown that multipartite
entanglement plays an important role in achieving
exponential computational speed up, but the role of
the role of genuine multipartite entanglement has not
been elucidated thoroughly. In this paper we have
studied the role of quantum entanglement a
quantum mechanical feature of quantum many-body
systems in quantum algorithms, especially in Doetsch-
Jozsa algorithm.

Keywords: Entanglement, Quantum algorithm,
Doetsch-Jozsa algorithm, Grover Algorithm,
Multipartite Entanglement.


I. Introduction

Quantum entanglement is a phenomenon like
quantum superposition, but it is a superposition
with more than one particle. It is some kind of
correlation between particles such that manipulation
of one particle instantaneously and non-locally
influences the other one. Two particles A and B are
entangled if their quantum state |
(AB)
> cannot be
written as a product of two separate quantum states
|
A
>|
B
>. Any quantum algorithm can be
efficiently simulated on a classical computer if it
does not create entanglement.
The model of quantum computation is given in
Cleve, Ekert, Macchiavello and Mosca[5].
According to that model each of the qubits, initially
in the |0> state, is first transformed according to
Hadamard transformation. This is shown in the
equation (i) by the giant Hadamard transformation
acting on all the qubits and converters the total state



of the qubits to where n is the total number of
qubits and the index j labels the 2
n
possible states of
type |j
1
j
2
j
n
> in which each j
i
= 0 or 1.



|(f) >
1
2
n
(1)
](x) 2
n
-1
x=0
|x > (1)


|>
1,2,.,n
is a disentangled state. A function operator
applied to the state | >, can compute all possible
values of the function, as shown in (ii).
|(u) >
1
2
n
1
2
n
-1
x=0
|x > (2)


This speed up is possible only because of the
superposition & this superposition may lead to
quantum entanglement. Though it has shown in [5]
quantum entanglement is necessary in achieving the
exponential speed up but in absence of quantum
entanglement quantum algorithms can give better
performance than classical algorithms [6]. At [6] Eli
Biham et al. has concluded two points one is
entanglement is not essential for quantum
computing and another is some advantage of
quantum algorithms over classical algorithms
persists even when the quantum state contains an
arbitrary small amount of information. So, the role
of quantum entanglement in quantum should be
studied thoroughly.
Doetsch-Jozsa algorithm is a quantum algorithm
which is used to say whether a function f(x) is
constant or balanced, where x {0,1}
n
and f: {0,1}
n
-
->{0,1}. Any classical algorithm will have to make
at least n/2 queries to give the correct answer with a
probability greater than or equals to . This
quantum algorithm gives the output within only one
query.
Grovers algorithm is also another quantum
algorithm which can search an element from an
IEMCON 2011 ORGANISED IN COLLABORATION WITH IEEE,INDIA 562
unsorted database within O(N) complexity, no
classical algorithm can search an unsorted database
so fast.
In this paper we have studied both of the
algorithms and also study the role of many body
entanglement in Doetsch-Jozsa algorithm.

II. Doetsch-Jozsa Algorithm

It is the first discovered quantum algorithm.
Consider a Boolean function f: {0,1}
n
{0,1}. If
the function f has the property that it is either
constant or balanced then for a given function f the
Doetsch-Jozsa algorithm will find out whether f is
constant or balanced using only one quantum
oracle call. Whereas any known classical algorithm
will have to make at least 2
(n-1)
queries to say
that f is constant or balanced with greater than 50%
probability. So, Doetsch-Jozsa algorithm gives an
exponential speed up over known classical
algorithms.

In Deutschs algorithm for distinguishing between
constant and balanced function we are using a
quantum black box that computes f(x) where
f: { 0 , 1 } { 0 , 1 }
The quantum circuit is

H denotes Hadamard Transformation
H : |x> 1/2 (-1)
xy
|y>
We measure the first qubit and find the outcome |0>
with probability 1 if f(0) = f(1) [constant function ]
and the outcome |1> with probability 1 if f(0) f(1).
The generalization of the Deutschs problem,
Deutsch- Jozsa Problem where we have a family of
black boxes with variable input size that computes a
function taking n bits to 0 or 1,
f : {0 , 1}
n
{0 , 1} where we aware of the fact that
either
1. f(x) = constant for all x { 0 , 1 }
n

or
2. f(x) = 0 for exactly half of the possible input
values [i.e. f is balanced] for all x { 0 , 1 }
n
.
Our aim is to solve f is constant or balanced?
We are using black box only once applying n
Hadamard gates in parallel to n qubits :
H
(n)
= H H H i.e. the n qubit
state transformation is

or


Where x,y represent n bit string and x.y represents
bitwise AND operation (or mod 2 scalar product)

or we may write it :
x . y = (x
1
^

y
1
) (x
2
^

y
2
) (x
n
^

y
n
).
Acting on the input (|0>)
n
(|1>) the resulting state is
the :

Which simplifies to :

IEMCON 2011 ORGANISED IN COLLABORATION WITH IEEE,INDIA 563
Now if f is a constant function then
(-1)
f(x)
(1/2
n
(-1)
x.y
) = (-1)
f(x)

y,0

It vanishes unless y=0. So we measure the n bit
register and obtain the result |y=0> (|0>)
n
with
probability one.
Now when the function is balanced then for y=0, the
sum becomes 0 because of of the terms are +1 and
rest are -1. Therefore probability of obtaining the
measurement outcome |y=0> is 0.


So one query of quantum oracle suffices to
distinguish the constant and balanced function with
100 % probability.
In Doetsch-Jozsa algorithm the n qubit state |
f
> may
or may not be entangled. This will depend upon the
value of the function f(x).

III. Multipartite Entanglement in Doetsch-Jozsa
Algorithm
In The following we will denote by S
q
the set of pure
q-separable states, i.e. states that can be written as
tensor products of pure states of q subsystems. So far
we have evaluated the fraction of fully separable
states (i.e. Sn). We can also evaluate the fraction of
states that are not fully separable but contain
entanglement only between two qubits (i.e. Sn-1\ Sn
). Actually, this kind of states are of the form |
sep,n-
2
> |
ent,2
> . There are 2(2
n-2
-1)*8 distinct
balanced function which correspond to states of this
form : the factor 2(2
n-2
-1) is the number of balanced
function corresponding to fully separable states of n-
2 qubits , while 8 is the entangled real equally
weighted states of 2 qubits.
States of this type can occur for B(n,2) different
partitions of the n qubits , therefore the total number
of balanced function corresponding to states in Sn-1\
Sn is 2(2
n-2
-1)*8* B(n,2). By taking the limit of
large n we can see that the fraction of these functions
over the total number N
bal
is still exponentially small.
Rather than evaluating all possible classes of states
we will answer the question whether most states in
the Deutsch-Jozsa algorithm (in the limit n-> ) are
genuinely multipartite entangled. To this end, we
count the number of biseparable balanced states, i.e.
states in S2 corresponding to balanced functions that
are of the form

and their fraction within all balanced states. Here, it
does not matter whether the constituting states are
entangled or separable, because any pure state that
cannot be written in a biseparable form is fully
entangled. Before counting the number of
biseparable balanced states, we will establish when a
biseparable state is balanced.
Lemma: For a pure real equally weighted state of n
qubits which is q-separable, i.e.



where each |
ki
> is real equally weighted, the state
|
qsep
> is balanced if and only if at least one |
ki
>
is balanced.

Proof: Denote by N
+()
(k)
the number of plus (minus)
signs of a real equally weighted state with k qubits.
=>: For a balanced n-qubit state we have N
+
(n)
=
N
-
(n)
.
For each partition with k
i
qubits in one subsystem,
and n-k
i
in the other subsystem, we thus have N
+
(ki)
.
N
+
(n-ki)
+ N
-
(ki)
. N
-
(n-ki)
= N
+
(ki)
. N
-
(n-ki)
+ N
-
(ki)
. N
+
(n-ki)

or
N
+
(n-ki)
( N
-
(ki)
- N
+
(ki)
) = N
-
(n-ki)
(N
-
(ki)
- N
+
(ki)
). The
solution of the equation is either N
+
(n-ki)
= N
-
(n-ki)
or
N
+
(ki)
= N
-
(ki)
, i.e. at least one of the two subsystems is
in a balanced state. This argument holds for all
possible partitions.
<=: Assume without loss of generality that |
k
> is
balanced, i.e. N
+
(k1)
= N
-
(k1)
. The number of plus signs
in the n-qubit state is N
+
(n)
=N
+
(k1)
. N
+
(n-k1)
+ N
-
(k1)
. N
-
(n-k1)
, and the number of total minus signs is
N
-
(k1)
= N
+
(k1)
. N
-
(n-k1)
+ N
-
(k1)
. N
+
(n-k1)
. Due to N
+
(k1)
=
N
-
(k1)
we find N
+
(n)
= N
-
(n)
.

To count all biseparable balanced states we first fix k,
and also fix the partition. The number of real equally
weighted states where at least one of the two sub
systems is balanced is
IEMCON 2011 ORGANISED IN COLLABORATION WITH IEEE,INDIA 564
Nbisep(k) = B(2
k
, 2
k1
) 2^(2
nk
)+ B(2
nk
, 2
nk1
)
2^2
k
B(2
k
, 2
k1
) B(2
nk
, 2
nk1
). This expression is
derived by counting the number of balanced
functions in the left term times the number of all
functions in the right, plus vice versa, minus the
terms where both parts are balanced and we have
already included it before. Next, we have to sum over
all possible bipartitions for fixed k (which leads to
the binomial B(n, k) as factor) and then have to sum
over all k. The only partition where this argument
does not hold is the case of k = n/2 for even n. Here
the factor 1/2 is needed to ensure that the partitions
are not counted twice. Thus, the number of
biseparable balanced states is given by




We now want to find limn N
bisep
DJ
/ N
bal .
To this
end ,it is convenient to write the above expression in
the following form


For n-> the largest term in the above equation is
the one with k = 1, and therefore we find that

(5)

Using this upper bound, we arrive at



Thus, in the limit of n-> the number of biseparable
states among the balanced ones goes to zero, and we
conclude that for large n the Deutsch-Jozsa algorithm
typically employs genuine multipartite entanglement.


iv. Conclusion

In this paper we have studied the role of multipartite
entanglement in Doetsch-Jozsa algorithm. In future
we will study the role of multipartite entanglement in
the resently discovered quantum algorithms like
quantum walks.


Reference:

[1] David Deutsch and Richard Josza. Rapid
solution of problems by quantum computation.
Proceedings of the Royal Society of London
Series A, 493:553-558, 1992.

[2] Lov K. Grover. Quantum mechanics helps in
searching for a needle in a haystack. Physical
Review
Letters, 79(2):325-328, 1997.

[3] Peter W. Shor. Polynomial-time algorithms for
prime factorization and discrete logarithms on a
quantum computer. SIAM Journal on Computing,
26(5):1484-1509, 2005.

[4] R. Jozsa and N. Linden, Proc. R. Soc. Lond. A
459, 2011 (2003).

[5] R. Cleve, A. Ekert, C. Macchiavello and M.
Mosca, Proc. R. Soc. Lond. A 454, 339, (1998).

[6] Eli Biham, Gilles Brassard, Dan Kenigsberg and
Tal Mor, Quantum Computing Without
Entanglement, arXiv:quant-ph/0306182v1 26 Jun
2003

IEMCON 2011 ORGANISED IN COLLABORATION WITH IEEE,INDIA 565