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/0511010 · The European Physical Journal D

Dissipative decoherence in the Grover algorithm

O. V. Zhirov, Dima L. Shepelyansky

Published Mar 6, 2006• 17 citations
arXivHTMLPDF
DOI
10.1140/epjd/e2006-00046-x

Related papers

Decoherence in Grover search algorithm

Yuan Sun

Quantum Information Processing•May 13, 2024•12 citations

Robustness of quantum Grover algorithm against decoherence

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

AIP conference proceedings•Jan 1, 2007•7 citations

Grover search with pairs of trapped ions

Mang Feng

The desired interference required for quantum computing may be modified by wave-function oscillations for the implementation of quantum algorithms [Phys. Rev. Lett. 84, 1615 (2000)]. To diminish such a detrimental effect, we propose a scheme with trapped ion pairs as qubits and apply the scheme to the Grover search. It will be shown that our scheme cannot only carry out a full Grover search, but can also meet the requirement for scalable hot-ion quantum computing. Moreover, the ion-pair qubits in our scheme are more robust against decoherence and the dissipation caused by the environment than single-particle qubits proposed before.

arXiv:quant-ph/0102122•Physical Review A•Apr 17, 2001•69 citations

Multi-Qubit Dynamical Quantum Search Algorithm with Dissipation

Ali H. Homid, Mahmoud Abdel‐Aty, A.‐S. F. Obada

We invoke an efficient search algorithms as a key challenge in multi-qubit quantum systems. An original algorithm called dynamical quantum search algorithm from which Grover algorithm is obtained at a specified time is presented. This algorithm is distinguished by accuracy in obtaining high probability of finding any marked state in a shorter time than Grover algorithm time. The algorithm performance can be improved with respect to the different values of the controlled phase. A new technique is used to generate the dynamical quantum gates in the presence of dissipation effect that helps in implementing the current algorithm.

arXiv:1509.04858•Sep 16, 2015•0 citations

Decoherence without dissipation

G.W. Ford, R.F. O'Connell

arXiv:quant-ph/0301054•Physics Letters A•Jul 1, 2001•71 citations

Time evolution of Grover's algorithm with imperfections

Pil Hun Song

We study imperfection effects on time evolution of Grover's algorithm on quantum computer. We introduce an effective two-level model with dissipation and stochasty, which is based upon the idea that ideal Grover's algorithm operates in 2 dimensional Hilbert space. The simulation results of both are compared and it is found that they are in good agreement for appropriately tuned parameters. It turns out that the main features of Grover's algorithm with imperfections can be understood in terms of two basic mechanisms, i.e., a diffusion of probability density into full Hilbert space and a stochastic rotation within the original 2 dimensional Hilbert space.

•Oct 21, 2000•0 citations
The desired interference required for quantum computing may be modified by wave-function oscillations for the implementation of quantum algorithms [Phys. Rev. Lett. 84, 1615 (2000)]. To diminish such a detrimental effect, we propose a scheme with trapped ion pairs as qubits and apply the scheme to the Grover search. It will be shown that our scheme cannot only carry out a full Grover search, but can also meet the requirement for scalable hot-ion quantum computing. Moreover, the ion-pair qubits in our scheme are more robust against decoherence and the dissipation caused by the environment than single-particle qubits proposed before.
We invoke an efficient search algorithms as a key challenge in multi-qubit quantum systems. An original algorithm called dynamical quantum search algorithm from which Grover algorithm is obtained at a specified time is presented. This algorithm is distinguished by accuracy in obtaining high probability of finding any marked state in a shorter time than Grover algorithm time. The algorithm performance can be improved with respect to the different values of the controlled phase. A new technique is used to generate the dynamical quantum gates in the presence of dissipation effect that helps in implementing the current algorithm.
We study imperfection effects on time evolution of Grover's algorithm on quantum computer. We introduce an effective two-level model with dissipation and stochasty, which is based upon the idea that ideal Grover's algorithm operates in 2 dimensional Hilbert space. The simulation results of both are compared and it is found that they are in good agreement for appropriately tuned parameters. It turns out that the main features of Grover's algorithm with imperfections can be understood in terms of two basic mechanisms, i.e., a diffusion of probability density into full Hilbert space and a stochastic rotation within the original 2 dimensional Hilbert space.