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

Physical Review A

Higher-order perturbation theory for decoherence in Grover's algorithm (9 pages)

Hiroo Azuma

Published Jan 1, 2005• 1 citation
OpenAlex

Related papers

Dissipative decoherence in the Grover algorithm

O. V. Zhirov, Dima L. Shepelyansky

arXiv:quant-ph/0511010•The European Physical Journal D•Mar 6, 2006•16 citations

Robustness of quantum Grover algorithm against decoherence

Pedro J. Salas, A. Gómez-González

AIP conference proceedings•Jan 1, 2007•7 citations

Decoherence in Grover search algorithm

Yuan Sun

Quantum Information Processing•May 13, 2024•11 citations

Quantum-kinetic equations for time correlation functions in higher-order perturbation theory

M.C.J. Leermakers, L.G. Suttorp

Physica A Statistical Mechanics and its Applications•Sep 1, 1981•0 citations

Higher-order perturbation theory for decoherence in Grover’s algorithm

Hiroo Azuma

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 (${\ensuremath{\sigma}}_{z}$ error) with probability $p$ independently at every step in the algorithm, where $0\ensuremath{\leqslant}p\ensuremath{\leqslant}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\ensuremath{\equiv}2Mnp$ $(\ensuremath{\geqslant}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}_{\mathrm{th}}$ or more. (We refer to this maximum value of $x$ as ${x}_{\mathrm{c}}$, a critical point of $x$.) We obtain a curve of ${x}_{\mathrm{c}}$ as a function of ${P}_{\mathrm{th}}$ by repeating this numerical calculation for many points of ${P}_{\mathrm{th}}$ and find the following facts: a tangent of the obtained curve at ${P}_{\mathrm{th}}=1$ is given by $x=(8∕5)(1\ensuremath{-}{P}_{\mathrm{th}})$, and we have ${x}_{\mathrm{c}}>\ensuremath{-}(8∕5){\mathrm{log}}_{e}\phantom{\rule{0.2em}{0ex}}{P}_{\mathrm{th}}$ near ${P}_{\mathrm{th}}=0$.

arXiv:quant-ph/0504033•Physical Review A•Oct 4, 2005•6 citations

Publisher's Note: Higher-order perturbation theory for decoherence in Grover’s algorithm [Phys. Rev. A72, 042305 (2005)]

Hiroo Azuma

with a formatting error in Eq. 15. The equation was incorrectly broken such that the functions and their arguments were separated and placed on different lines.

Physical Review A•Oct 14, 2005•0 citations
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 (${\ensuremath{\sigma}}_{z}$ error) with probability ppp independently at every step in the algorithm, where $0\ensuremath{\leqslant}p\ensuremath{\leqslant}1$. Considering an nnn-qubit density operator to which Grover's iterative operation is applied MMM times, we expand it in powers of 2Mnp2Mnp2Mnp and derive its matrix element order by order under the large-nnn limit. [In this large-nnn limit, we assume ppp is small enough, so that 2Mnp2Mnp2Mnp can take any real positive value or zero. We regard $x\ensuremath{\equiv}2Mnp$ $(\ensuremath{\geqslant}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 xxx at which the algorithm finds a correct item with a given threshold of probability Pth{P}_{\mathrm{th}}Pth​ or more. (We refer to this maximum value of xxx as xc{x}_{\mathrm{c}}xc​, a critical point of xxx.) We obtain a curve of xc{x}_{\mathrm{c}}xc​ as a function of Pth{P}_{\mathrm{th}}Pth​ by repeating this numerical calculation for many points of Pth{P}_{\mathrm{th}}Pth​ and find the following facts: a tangent of the obtained curve at Pth=1{P}_{\mathrm{th}}=1Pth​=1 is given by $x=(8∕5)(1\ensuremath{-}{P}_{\mathrm{th}})$, and we have ${x}_{\mathrm{c}}>\ensuremath{-}(8∕5){\mathrm{log}}_{e}\phantom{\rule{0.2em}{0ex}}{P}_{\mathrm{th}}$ near Pth=0{P}_{\mathrm{th}}=0Pth​=0.