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/0206158 · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

Dynamical fidelity of a solid-state quantum computation

G. P. Berman, F. Borgonovi, G. L. Celardo, Felix M. Izrailev, D. I. Kamenev

Published Nov 25, 2002• 11 citations
arXivHTMLPDF

Abstract

In this paper we analyze the dynamics in a spin model of quantum computer. Main attention is paid to the dynamical fidelity (associated with dynamical errors) of an algorithm that allows to create an entangled state for remote qubits. We show that in the regime of selective resonant excitations of qubits there is no danger of quantum chaos. Moreover, in this regime a modified perturbation theory gives an adequate description of the dynamics of the system. Our approach allows us to explicitly describe all peculiarities of the evolution of the system under time-dependent pulses corresponding to a quantum protocol. Specifically, we analyze, both analytically and numerically, how the fidelity decreases in dependence on the model parameters.

DOI
10.1103/physreve.66.056206

Related papers

Perturbation Approach for a Solid-State Quantum Computation

G. P. Berman, D. I. Kamenev, V. I. Tsifrinovich

The dynamics of the nuclear-spin quantum computer with large number (L=1000) of qubits is considered using a perturbation approach, based on approximate diagonalization of exponentially large sparse matrices. Small parameters are introduced and used to compute the error in implementation of entanglement between remote qubits, by applying a sequence of resonant radio-frequency pulses. The results of the perturbation theory are tested using exact numerical solutions for small number of qubits.

arXiv:quant-ph/0110069•Oct 10, 2001•0 citations

Classical versus quantum errors in quantum computation of dynamical systems

Davide Rossini, Giuliano Benenti, Giulio Casati

We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum motion when the system's parameters are perturbed or when there are unitary errors in the quantum gates implementing the quantum algorithm. While the first kind of errors has a classical limit, the second one has no classical analog. It is shown that, whereas in the first case ("classical errors") the decay of fidelity is very sensitive to the dynamical regime, in the second case ("quantum errors") it is almost independent of the dynamical behavior of the simulated system. Therefore, the rich variety of behaviors found in the study of the stability of quantum motion under "classical" perturbations has no correspondence in the fidelity of quantum computation under its natural perturbations. In particular, in this latter case it is not possible to recover the semiclassical regime in which the fidelity decays with a rate given by the classical Lyapunov exponent.

arXiv:quant-ph/0405189•Physical Review E•Nov 22, 2004•10 citations

Perturbation approach for nuclear magnetic resonance solid‐state quantum computation

G. P. Berman, D. I. Kamenev, V. I. Tsifrinovich

A dynamics of a nuclear‐spin quantum computer with a large number (L = 1000) of qubits is considered using a perturbation approach. Small parameters are introduced and used to compute the error in an implementation of an entanglement between remote qubits, using a sequence of radio‐frequency pulses. The error is computed up to the different orders of the perturbation theory and tested using exact numerical solution.

Journal of Applied Mathematics•Jan 1, 2003•2 citations

Creation of entanglement in a scalable spin quantum computer with long-range dipole-dipole interaction between qubits

D. I. Kamenev, G. P. Berman, V. I. Tsifrinovich

Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal choice of the parameters of radio-frequency pulses implementing the protocol. The errors caused by (i) the influence of the environment, (ii) nonselective excitations, (iii) influence of different spin chains on each other, (iv) displacements of qubits from their perfect locations, and (v) fluctuations of the external magnetic field are estimated analytically and calculated numerically. For the perfectly entangled state the $z$ component $M$ of the magnetization of the whole system is equal to zero. The errors lead to a finite value of $M$. If the number of qubits in the system is large, $M$ can be detected experimentally. Using the fact that $M$ depends differently on the parameters of the system for each kind of error, varying these parameters would allow one to experimentally determine the most significant source of errors and to optimize correspondingly the quantum computer design in order to decrease the errors and $\ensuremath{\mid}M\ensuremath{\mid}$. Using our approach one can benchmark the quantum computer, decrease the errors, and prepare the quantum computer for implementation of more complex quantum algorithms.

arXiv:quant-ph/0603227•Physical Review A•Jun 29, 2006•5 citations

Effects of Imperfections and Residual Inter-Qubit Interaction on Quantum Computing

Dima L. Shepelyansky, Bertrand Georgeot

We study the effects of static interqubit interactions on the accuracy of various quantum algorithms. Extensive numerical simulations show that their effect is stronger compared to external decoherence. Analytical approach based on Random Matrix Theory is developed. It gives universal law for fidelity decay induced by interqubit static interactions. This determines the time scale for reliable quantum computation in presence of realistic static imperfections and external decoherence. New polynomial algorithms are developed for simulation of complex dynamics in the regime of classical and quantum chaos, and Anderson metal- insulator transition. A generic quantum error correction method is developed; it allows to eliminate coherent effect of static errors. The theoretical results are confirmed by numerical computations with up to 28 qubits.

•Sep 15, 2004•0 citations

Perturbation Theory and Numerical Modeling of Quantum Logic Operations with a Large Number of Qubits

G. P. Berman, G. D. Doolen, D. I. Kamenev +2 more

The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain is considered in which selective excitations of spins are provided by having a uniform gradient of the external magnetic field. Quantum logic operations are utilized by applying resonant electromagnetic pulses. The spins interact with their nearest neighbors. We simulate the creation of the long-distance entanglement between remote qubits in the spin chain. Our method enables us to minimize unwanted non-resonant effects in a controlled way. The method we use cannot simulate complicated quantum logic (a quantum computer is required to do this), but it can be useful to test the experimental performance of simple quantum logic operations. We show that: (a) the probability distribution of unwanted states has a ``band'' structure, (b) the directions of spins in typical unwanted states are highly correlated, and (c) many of the unwanted states are high-energy states of a quantum computer (a spin chain). Our approach can be applied to simple quantum logic gates and fragments of quantum algorithms involving a large number of qubits.

arXiv:quant-ph/0107038•Jul 6, 2001•0 citations
In this paper we analyze the dynamics in a spin model of quantum computer. Main attention is paid to the dynamical fidelity (associated with dynamical errors) of an algorithm that allows to create an entangled state for remote qubits. We show that in the regime of selective resonant excitations of qubits there is no danger of quantum chaos. Moreover, in this regime a modified perturbation theory gives an adequate description of the dynamics of the system. Our approach allows us to explicitly describe all peculiarities of the evolution of the system under time-dependent pulses corresponding to a quantum protocol. Specifically, we analyze, both analytically and numerically, how the fidelity decreases in dependence on the model parameters.
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum motion when the system's parameters are perturbed or when there are unitary errors in the quantum gates implementing the quantum algorithm. While the first kind of errors has a classical limit, the second one has no classical analog. It is shown that, whereas in the first case ("classical errors") the decay of fidelity is very sensitive to the dynamical regime, in the second case ("quantum errors") it is almost independent of the dynamical behavior of the simulated system. Therefore, the rich variety of behaviors found in the study of the stability of quantum motion under "classical" perturbations has no correspondence in the fidelity of quantum computation under its natural perturbations. In particular, in this latter case it is not possible to recover the semiclassical regime in which the fidelity decays with a rate given by the classical Lyapunov exponent.
Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal choice of the parameters of radio-frequency pulses implementing the protocol. The errors caused by (i) the influence of the environment, (ii) nonselective excitations, (iii) influence of different spin chains on each other, (iv) displacements of qubits from their perfect locations, and (v) fluctuations of the external magnetic field are estimated analytically and calculated numerically. For the perfectly entangled state the zzz component MMM of the magnetization of the whole system is equal to zero. The errors lead to a finite value of MMM. If the number of qubits in the system is large, MMM can be detected experimentally. Using the fact that MMM depends differently on the parameters of the system for each kind of error, varying these parameters would allow one to experimentally determine the most significant source of errors and to optimize correspondingly the quantum computer design in order to decrease the errors and $\ensuremath{\mid}M\ensuremath{\mid}$. Using our approach one can benchmark the quantum computer, decrease the errors, and prepare the quantum computer for implementation of more complex quantum algorithms.
We study the effects of static interqubit interactions on the accuracy of various quantum algorithms. Extensive numerical simulations show that their effect is stronger compared to external decoherence. Analytical approach based on Random Matrix Theory is developed. It gives universal law for fidelity decay induced by interqubit static interactions. This determines the time scale for reliable quantum computation in presence of realistic static imperfections and external decoherence. New polynomial algorithms are developed for simulation of complex dynamics in the regime of classical and quantum chaos, and Anderson metal- insulator transition. A generic quantum error correction method is developed; it allows to eliminate coherent effect of static errors. The theoretical results are confirmed by numerical computations with up to 28 qubits.
The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain is considered in which selective excitations of spins are provided by having a uniform gradient of the external magnetic field. Quantum logic operations are utilized by applying resonant electromagnetic pulses. The spins interact with their nearest neighbors. We simulate the creation of the long-distance entanglement between remote qubits in the spin chain. Our method enables us to minimize unwanted non-resonant effects in a controlled way. The method we use cannot simulate complicated quantum logic (a quantum computer is required to do this), but it can be useful to test the experimental performance of simple quantum logic operations. We show that: (a) the probability distribution of unwanted states has a ``band'' structure, (b) the directions of spins in typical unwanted states are highly correlated, and (c) many of the unwanted states are high-energy states of a quantum computer (a spin chain). Our approach can be applied to simple quantum logic gates and fragments of quantum algorithms involving a large number of qubits.