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:0902.0471 · Journal of Physics B Atomic Molecular and Optical Physics

Simulation of static and random errors on Grover's search algorithm implemented in an Ising nuclear spin chain quantum computer with a few qubits

T. Gorin, Lorena Lara, Gustavo V. López

Published Apr 6, 2010• 3 citations
arXivHTMLPDF

Abstract

We consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first- and second-neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations of the external fields. By averaging over many repetitions of the algorithm, the output state becomes effectively a mixed state. We study its overlap with the nominal output state of the algorithm, which is called the fidelity. We analyse the behaviour of the fidelity as a function of the noise intensity for static and random noise on either the Larmor frequencies or the Rabi frequency, and we compare our results to theoretical predictions and numerical simulations which are based on more abstract quantum computer models.

DOI
10.1088/0953-4075/43/8/085508

Related papers

Simulation of Grover's quantum search algorithm in an Ising-nuclear-spin-chain quantum computer with first- and second-nearest-neighbour couplings

Gustavo V. López, T. Gorin, Lorena Lara

We implement Grover's quantum search algorithm on a nuclear spin-chain quantum computer, taking Ising-type interactions between nearest and second-nearest neighbours into account. The performance of this implementation is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity as a function of the Rabi frequency. For the latter, we obtain pronounced maxima at frequencies which fulfil the condition of the 2π k -method with respect to the second-nearest- neighbour interactions.

arXiv:0710.3196•Journal of Physics B Atomic Molecular and Optical Physics•Feb 26, 2008•9 citations

Simulation of Grover's algorithm with position-variation of the ancilla qubit

Neris Ilano, Ronald S. Banzon, Cristine Dlr. Villagonzalo

We simulate Grover’s quantum search algorithm in an Ising spin chain quantum computer with nearest and second-nearest neighbour interactions. We determine the optimum Rabi frequency that satisfies the 2πk method by selecting a high fidelity value in the frequency scan for each database size. Also, we vary the position of the ancilla qubit and investigate the effect on the fidelity for different sizes of the database. The behavior of the fidelity as a function of the number of Grover iterations during the algorithm is considered. For a fixed location of the ancilla qubit, the overall fidelity decreases as we increase the size of the database.

Proceedings of the Samahang Pisika ng Pilipinas•Jun 3, 2015•0 citations

Simulation of the statical and dynamical noise on Grover's search algorithm implemented in a Ising nuclear spin chain quantum computer

T. Gorin, Lorena Lara, Gustavo V. López

•Feb 3, 2009•0 citations

Effects of decoherence and imperfections for quantum algorithms

A. A. Pomeransky, O. V. Zhirov, Dima L. Shepelyansky

We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $ε_c / ε$ for $ε> 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.

arXiv:quant-ph/0407264•Jul 30, 2004•4 citations

Simulation of quantum algorithm using modified qubit rotation

Neris I. Sombillo

We study the implementation of Grover’s algorithm in an Ising spin chain quantum computer. In our scheme, we removed the application of time delay whenever a qubit operation is performed. Instead, we introduced a set of modified pulses that utilizes the interaction of the neighboring qubit. In principle, the absence of time delay pulses allows the overall rotation pulses to be applied simultaneously to execute a gate. We show that the fidelity remains high after continuous application of π/2 pulses. The error arising from the unitary evolution is minimized by using soft pulses. Finally, the probability of finding the target state remain bounded through the application of fixed-point quantum search scheme.

AIP conference proceedings•Jan 1, 2023•0 citations

Quantum computing under real-world constraints: efficiency of an ensemble quantum algorithm and fighting decoherence by gate design

Y. Yamamoto, Cyrus P. Master

Quantum algorithms for problems such as integer factorization and database search have spurred great interest in quantum computation. However, the construction of scalable quantum computers has proved to be extremely difficult. Among the challenging requirements that must be fulfilled in the “standard model” of quantum computation, one must be able to initialize qubits into known pure states. In addition, quantum computers must be protected from noise due to unwanted interactions with their environment. This work is concerned with two theoretical issues motivated by these difficulties. First, I analyze the efficiency of an algorithm for an alternate model for quantum computation that is motivated by bulk nuclear magnetic resonance. In such ensemble systems, the initial state is not a fiducial pure state, but is instead a maximally-mixed density operator. The algorithm that I consider allows one to estimate the free energy of arbitrary spin-1/2 lattice models. To determine the efficiency of this algorithm, I calculate the computation time required to estimate the free energy to bounded error as a function of the lattice size. In the absence of stochastic fluctuations in the measurement output, it is found that the algorithm is efficient. However, evidence is presented that suggests that the algorithm becomes exponentially sensitive to fluctuations as the lattice size increases. While techniques such as quantum error-correcting codes and decoherence-free subsystem encodings have been devised to mitigate errors due to unwanted environmental couplings, these methods require many additional qubits or complicated encodings. Here, I investigate a simple approach to reduce errors in the quantum search algorithm due to a collective decoherence model. This method takes advantage of the freedom inherent in compiling the search algorithm into fundamental gates. Transition rate calculations and more rigorous quantum master equation simulations are carried out for small-qubit instances to contrast the performance of the original and modified algorithm. It is shown that the expected computational effort can be reduced by 22% for selected five-bit instances of the quantum search algorithm. While this approach does not constitute a general strategy for quantum error-correction, it illustrates the importance of judicious gate design in mitigating decoherence.

•Jan 1, 2005•4 citations
We consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first- and second-neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations of the external fields. By averaging over many repetitions of the algorithm, the output state becomes effectively a mixed state. We study its overlap with the nominal output state of the algorithm, which is called the fidelity. We analyse the behaviour of the fidelity as a function of the noise intensity for static and random noise on either the Larmor frequencies or the Rabi frequency, and we compare our results to theoretical predictions and numerical simulations which are based on more abstract quantum computer models.
We implement Grover's quantum search algorithm on a nuclear spin-chain quantum computer, taking Ising-type interactions between nearest and second-nearest neighbours into account. The performance of this implementation is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity as a function of the Rabi frequency. For the latter, we obtain pronounced maxima at frequencies which fulfil the condition of the 2π k -method with respect to the second-nearest- neighbour interactions.
We simulate Grover’s quantum search algorithm in an Ising spin chain quantum computer with nearest and second-nearest neighbour interactions. We determine the optimum Rabi frequency that satisfies the 2πk method by selecting a high fidelity value in the frequency scan for each database size. Also, we vary the position of the ancilla qubit and investigate the effect on the fidelity for different sizes of the database. The behavior of the fidelity as a function of the number of Grover iterations during the algorithm is considered. For a fixed location of the ancilla qubit, the overall fidelity decreases as we increase the size of the database.
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength εεε. The critical border εcε_cεc​ between two phases drops polynomially with the number of qubits nqn_qnq​ as εc∼nq−3/2ε_c \sim n_q^{-3/2}εc​∼nq−3/2​. In the regular phase (ε<εc)(ε< ε_c)(ε<εc​) the algorithm remains robust against imperfections showing the efficiency gain εc/εε_c / εεc​/ε for ε>2−nq/2ε> 2^{-n_q/2}ε>2−nq​/2. In the chaotic phase (ε>εc)(ε> ε_c)(ε>εc​) the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.
We study the implementation of Grover’s algorithm in an Ising spin chain quantum computer. In our scheme, we removed the application of time delay whenever a qubit operation is performed. Instead, we introduced a set of modified pulses that utilizes the interaction of the neighboring qubit. In principle, the absence of time delay pulses allows the overall rotation pulses to be applied simultaneously to execute a gate. We show that the fidelity remains high after continuous application of π/2 pulses. The error arising from the unitary evolution is minimized by using soft pulses. Finally, the probability of finding the target state remain bounded through the application of fixed-point quantum search scheme.
Quantum algorithms for problems such as integer factorization and database search have spurred great interest in quantum computation. However, the construction of scalable quantum computers has proved to be extremely difficult. Among the challenging requirements that must be fulfilled in the “standard model” of quantum computation, one must be able to initialize qubits into known pure states. In addition, quantum computers must be protected from noise due to unwanted interactions with their environment. This work is concerned with two theoretical issues motivated by these difficulties. First, I analyze the efficiency of an algorithm for an alternate model for quantum computation that is motivated by bulk nuclear magnetic resonance. In such ensemble systems, the initial state is not a fiducial pure state, but is instead a maximally-mixed density operator. The algorithm that I consider allows one to estimate the free energy of arbitrary spin-1/2 lattice models. To determine the efficiency of this algorithm, I calculate the computation time required to estimate the free energy to bounded error as a function of the lattice size. In the absence of stochastic fluctuations in the measurement output, it is found that the algorithm is efficient. However, evidence is presented that suggests that the algorithm becomes exponentially sensitive to fluctuations as the lattice size increases. While techniques such as quantum error-correcting codes and decoherence-free subsystem encodings have been devised to mitigate errors due to unwanted environmental couplings, these methods require many additional qubits or complicated encodings. Here, I investigate a simple approach to reduce errors in the quantum search algorithm due to a collective decoherence model. This method takes advantage of the freedom inherent in compiling the search algorithm into fundamental gates. Transition rate calculations and more rigorous quantum master equation simulations are carried out for small-qubit instances to contrast the performance of the original and modified algorithm. It is shown that the expected computational effort can be reduced by 22% for selected five-bit instances of the quantum search algorithm. While this approach does not constitute a general strategy for quantum error-correction, it illustrates the importance of judicious gate design in mitigating decoherence.