Higher order perturbation theory for decoherence in Grover's algorithm

Details Higher order perturbation theory for decoherence in Grover's algorithm Higher order perturbation theory for decoherence in Grover's algorithm

2005-04-06

arxiv.org/abs/quant-ph/0504033v3

Phys. Rev. A 72, 042305 (2005); Phys. Rev. A 72, 049902(E) (2005)

Physics

Quantum Physics

18 pages, Latex2e, 5 eps figures; v2: comments about precision of approximation with higher order polynomials added; v3: minor

Scientific paper

10.1103/PhysRevA.72.042305 10.11

In this paper, we study decoherence in Grover's quantum search algorithm using a perturbative method. We assume that each two-state system (qubit) that belongs to a register suffers a phase flip error (\sigma_{z} error) with probability p independently at every step in the algorithm, where $0\leq p\leq 1$. Considering an n-qubit density operator to which Grover's iterative operation is applied M times, we expand it in powers of 2Mnp and derive its matrix element order by order under the large-n limit. [In this large-n limit, we assume p is small enough, so that 2Mnp can take any real positive value or zero. We regard $x\equiv 2Mnp(\geq 0)$ as a perturbative parameter.] We obtain recurrence relations between terms in the perturbative expansion. By these relations, we compute higher orders of the perturbation efficiently, so that we extend the range of the perturbative parameter that provides a reliable analysis. Calculating the matrix element numerically by this method, we derive the maximum value of the perturbative parameter x at which the algorithm finds a correct item with a given threshold of probability P_{th} or more. (We refer to this maximum value of x as x_{c}, a critical point of x.) We obtain a curve of x_{c} as a function of P_{th} by repeating this numerical calculation for many points of P_{th} and find the following facts: a tangent of the obtained curve at P_{th}=1 is given by x=(8/5)(1-P_{th}), and we have x_{c}>-(8/5)\log_{e}P_{th} near P_{th}=0.

Affiliated with

Also associated with

No associations

Rating

Higher order perturbation theory for decoherence in Grover's algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Higher order perturbation theory for decoherence in Grover's algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Higher order perturbation theory for decoherence in Grover's algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38252