We study effects of static inter-qubit interactions on the stability of the Grover quantum search algorithm. Our numerical and analytical results show existence of regular and chaotic phases depending on the 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 $ε\gtrsim 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed.
We study the effects of dissipation or leakage on the time evolution of Grover's algorithm for a quantum computer. We introduce an effective two-level model with dissipation and randomness (imperfections), which is based upon the idea that ideal Grover's algorithm operates in a 2-dimensional Hilbert space. The simulation results of this model and Grover's algorithm with imperfections 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 basi…
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 $…
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 fidelity. We find either an exponential or a Gaussian decay for the fidelity as a function of the strength of the noise, depending on the type of n…
Grover's quantum search algorithm, involving a large number of qubits, is highly sensitive to errors in the physical implementation of the unitary operators. This poses an intrinsic limitation to the size of the database that can be practically searched. The lack of robustness of Grover's algorithm for a large number of qubits is due to quite stringent "phase-matching" condition. To overcome this limitation, Tulsi suggested a modified search algorithm [PRA 78, 022332] which succeeds as long as the errors are reproducible and reversible while Grover's algorithm fails. Such systematic errors ari…
We propose an ion trap implementation of Grover's quantum search algorithm for an unstructured database of arbitrary length N. The experimental implementation is appealingly simple because the linear ion trap allows for a straightforward construction, in a single interaction step and without a multitude of Hadamard transforms, of the reflection operator, which is the engine of the Grover algorithm. Consequently, a dramatic reduction in the number of the required physical steps takes place, to just O(\sqrt{N}), the same as the number of the mathematical steps. The proposed setup allows for demo…
Even in the absence of external influences the operability of a quantum computer (QC) is not guaranteed because of the effects of residual one- and two-body imperfections. Here we investigate how these internal flaws affect the performance of a quantum controlled-NOT (CNOT) gate in an isolated flawed QC. First we find that the performance of the CNOT gate is considerably better when the two-body imperfections are strong. Secondly, we find that the largest source of error is due to a coherent shift rather than decoherence or dissipation. Our results suggest that the problem of internal imperfec…
The inevitable existence of static internal imperfections and residual interactions in some quantum computer architectures result in internal decoherence, dissipation, and destructive unitary shifts of active algorithms. By exact numerical simulations we determine the relative importance and origin of these errors for a Josephson charge qubit quantum computer. In particular we determine that the dynamics of a CNOT gate interacting with its idle neighboring qubits via native residual coupling behaves much like a perturbed kicked top in the exponential decay regime, where fidelity decay is only …
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We consider systematic unitary errors, random unitary errors, and decoherence processes. We show that unitary errors which destroy the interference destroy the efficiency of the algorithm, too. However, unitary errors may also create useless additional interference. In such a case the total amount of interference can increase, while the efficiency of the quantum…
We study numerically the effects of static imperfections and residual couplings between qubits for the quantum phase estimation algorithm with two qubits. We show that the success probability of the algorithm is affected significantly more by static imperfections than by random noise errors in quantum gates. An improvement of the algorithm accuracy can be reached by application of the Pauli-random-error-correction method (PAREC).
We study the effects of dynamical imperfections in quantum computers. By considering an explicit example, we identify different regimes ranging from the low-frequency case, where the imperfections can be considered as static but with renormalized parameters, to the high frequency fluctuations, where the effects of imperfections are completely wiped out. We generalize our results by proving a theorem on the dynamical evolution of a system in the presence of dynamical perturbations.
We investigate the transition to quantum chaos, induced by static imperfections, for an operating quantum computer that simulates efficiently a dynamical quantum system, the sawtooth map. For the different dynamical regimes of the map, we discuss the quantum chaos border induced by static imperfections by analyzing the statistical properties of the quantum computer eigenvalues. For small imperfection strengths the level spacing statistics is close to the case of quasi-integrable systems while above the border it is described by the random matrix theory. We have found that the border drops expo…
We study the properties of eigenstates of an operating quantum computer which simulates the dynamical evolution in the regime of quantum chaos. Even if the quantum algorithm is polynomial in number of qubits $n_q$, it is shown that the ideal eigenstates become mixed and strongly modified by static imperfections above a certain threshold which drops exponentially with $n_q$. Above this threshold the quantum eigenstate entropy grows linearly with $n_q$ but the computation remains reliable during a time scale which is polynomial in the imperfection strength and in $n_q$.
As the matching condition in Grover search algorithm is transgressed due to inevitable errors in phase inversions, it gives a reduction in maximum probability of success. With a given degree of maximum success, we have derive the generalized and imroved criterion for tolerated error and corresponding size of quantum database under the inevitable gate imperfections. The vanished inaccurancy to this condition has also been shown. Besides, a concise formula for evaluating minimum number of iterations is also presented in this work.
We determine the universal law for fidelity decayin quantum computations of complex dynamics in presenceof internal static imperfections in a quantum computer. Our approach is based on random matrix theory applied toquantum computations in presence of imperfections.The theoretical predictions are tested and confirmed in extensive numerical simulations of a quantum algorithm for quantum chaos in the dynamical tent map with up to 18 qubits. The theory developed determines the time scales forreliable quantum computations in absence of the quantum error correction codes. These time scales are rela…
A general error correction method is presented which is capable of correcting coherent errors originating from static residual inter-qubit couplings in a quantum computer. It is based on a randomization of static imperfections in a many-qubit system by the repeated application of Pauli operators which change the computational basis. This Pauli-Random-Error-Correction (PAREC)-method eliminates coherent errors produced by static imperfections and increases significantly the maximum time over which realistic quantum computations can be performed reliably. Furthermore, it does not require redundan…
In the recent years, we have seen that Grover search algorithm (Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996) by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparisons to classical systems. In this work, we explore the idea of extending Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with a dynamic selection function in contrast to the static selection function used in the original work (Grover in Proceeding…
I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a non-orthogonal basis. If the basis slowly evolves then there is a strong analogy to adiabatic quantum computing, although the approach is entirely circuit-based. To solve a 3-SAT problem of n variables requires a quantum register of $n$ qubits, or more precisely rebits i.e. qubits whose phase need only be real. For cases of up to n=26 qubits numerical simulations indica…
The dynamics of the pairwise entanglement in a qubit lattice in the presence of static imperfections exhibits different regimes. We show that there is a transition from a perturbative region, where the entanglement is stable against imperfections, to the ergodic regime, in which a pair of qubits becomes entangled with the rest of the lattice and the pairwise entanglement drops to zero. The transition is almost independent of the size of the quantum computer. We consider both the case of an initial maximally entangled and separable state. In this last case there is a broad crossover region in w…
We study transfer of a quantum state through XX spin chains with static imperfections. We combine the two standard approaches for state transfer based on (i) modulated couplings between neighboring spins throughout the spin chain and (ii) weak coupling of the outermost spins to an unmodulated spin chain. The combined approach allows us to design spin chains with modulated couplings and localized boundary states, permitting high-fidelity state transfer in the presence of random static imperfections of the couplings. The modulated couplings are explicitly obtained from an exact algorithm using t…
We study analytically and numerically the effects of various imperfections in a quantum computation of a simple dynamical model based on the Quantum Wavelet Transform (QWT). The results for fidelity timescales, obtained for a large range of error amplitudes and number of qubits, imply that for static imperfections the threshold for fault-tolerant quantum computation is decreased by a few orders of magnitude compared to the case of random errors.
Scalable Quantum Reinforcement Learning on NISQ Devices with Dynamic-Circuit Qubit Reuse and Grover Optimization
Graduate School of Science and Technology, Keio University（Keio大学科学技术研究生院）；Graduate School of Information Science and Electrical Engineering, Kyushu University（九州大学信息科学与电气工程研究生院）；RIKEN Center for Computational Science（理化学研究所计算科学中心）
We propose a quantum algorithm for simulation of the Anderson transition in disordered lattices and study numerically its sensitivity to static imperfections in a quantum computer. In the vicinity of the critical point the algorithm gives a quadratic speedup in computation of diffusion rate and localization length, comparing to the known classical algorithms. We show that the Anderson transition can be detected on quantum computers with $7 - 10$ qubits.
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these imperfections using numerical simulations of realistic quantum computations with up to $n_q=18$ computational qubits allowing to factor numbers up to N=205193. We confirm that the algorithm remains operational up to a critical coupling strength $ε_c$ which drops only polynomially with $\log_2 N$. The obtained numerical dependence of $ε_c$ on $\log_2 N$ is in…
In this paper, we examine disorder (i.e. static imperfections in manufacture) for the fixed-Hamiltonian evolution protocol of quantum state transfer. We improve the performance by optimising the choice of Hamiltonian, and by implementing an encoding/decoding procedure on small regions at either end of the chain. We find that encoding in only the single excitation subspace is optimal, and provides substantial enhancement to the operating regime of these systems.
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics described by the quantum sawtooth map. The numerical study of the effect of static imperfections in the quantum computer hardware shows that the main elements of the phase space structures are accurately reproduced up to a time scale which is polynomial in the number of qubits. The errors generated by these imperfections are more dangerous than the errors of random noise in gate operations.
We show that a quantum computer operating with a small number of qubits can simulate the dynamical localization of classical chaos in a system described by the quantum sawtooth map model. The dynamics of the system is computed efficiently up to a time $t\geq \ell$, and then the localization length $\ell$ can be obtained with accuracy $ν$ by means of order $1/ν^2$ computer runs, followed by coarse grained projective measurements on the computational basis. We also show that in the presence of static imperfections a reliable computation of the localization length is possible without error correc…
Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, quantum ergodic regime and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It is shown that the fidelity of quantum computation decays exponentially with time and that the decay rate is proportional to the number of qubits, number of quantum gates and per gate dissipation rate induced b…
We show that the state of a flying qubit may be transferred to a chain of identical, (near) ferromagnetically polarised, but non-interacting, static spin-1/2 particles in a passive way. During this process the flying qubit is coherently polarised, emerging in the direction of the majority static spins. We also show that this process is reversible for at least two flying qubits injected sequentially and thus has the potential to be exploited as a passive quantum memory to encode the flying qubits without the necessity of resetting between successive encoding operations. We show that the quantum…
Periodic driving has the longstanding reputation for generating exotic phases of matter with no static counterparts. This work explores the interplay among periodic driving, interaction effects, and $\mathbb{Z}_2$ symmetry that leads to the emergence of Floquet symmetry protected second-order topological phases in a simple but insightful two-dimensional spin-1/2 lattice. Through a combination of analytical and numerical treatments, we verify the formation of 0 and $π$ modes, i.e., corner localized $\mathbb{Z}_2$ symmetry broken operators that respectively commute and anticommute with the one-p…
