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/0310163 · International Journal of Quantum Information

STABILITY OF THE QUANTUM FOURIER TRANSFORMATION ON THE ISING QUANTUM COMPUTER

G. L. Celardo, Carlos Pineda, Marko Žnidarič

Published Sep 1, 2005• 11 citations
arXivHTMLPDF

Abstract

We analyze the influence of errors on the implementation of the quantum Fourier transformation. Two kinds of errors are studied: (i) systematic errors due to off-resonant transitions and (ii) errors due to an external perturbation. The scaling of errors with system parameters and the number of qubits is analyzed. To suppress off-resonant transitions, we use correcting pulses while in order to suppress errors due to an external perturbation, we use an improved quantum Fourier transformation algorithm. As a result, the fidelity of quantum computation is increased by several orders of magnitude and is thus stable in a much wider range of physical parameters.

DOI
10.1142/s0219749905001122

Related papers

Characterizing errors for Quantum Fourier Transform on IBM Q

Carolina Allende, André Fonseca de Oliveira, Efrain Buksman

The performance of today's quantum computers are affected by noise. This effect can be analyzed in the result of simple quantum algorithms in real quantum computers. The noise can be characterized as a decoherence error or a systematic error, the last could be corrected by a unitary rotation. In this article we propose two methods to model a systematic error, in the Quantum Fourier Transform algorithm (QFT). The first method uses the isotropic index presented in `` [1] and needs to reconstruct the density matrix of the experimental state, while the second method, although less general, only needs to reconstruct the reduced density matrices for each qubit. In both methods, a unitary transformation is proposed, which approximates the experimental result to the expected theoretical state. As an example, the QFT algorithm is analyzed for two qubit states, in quantum IBM Q computer ibmq\_santiago.

Revista Mexicana de Física•Apr 5, 2022•1 citation

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

Robustness of quantum algorithms against coherent control errors

Julian Berberich, Daniel Fink, Christian Holm

Coherent control errors, for which ideal Hamiltonians are perturbed by unknown multiplicative noise terms, are a major obstacle for reliable quantum computing. In this paper we present a framework for analyzing the robustness of quantum algorithms against coherent control errors using Lipschitz bounds. We derive worst-case fidelity bounds which show that the resilience against coherent control errors is mainly influenced by the norms of the Hamiltonians generating the individual gates. These bounds are explicitly computable even for large circuits and they can be used to guarantee fault tolerance via threshold theorems. Moreover, we apply our theoretical framework to derive a guideline for robust quantum algorithm design and transpilation, which amounts to reducing the norms of the Hamiltonians. Using the three-qubit quantum Fourier transform as an example application, we demonstrate that this guideline targets robustness more effectively than existing ones based on circuit depth or gate count. Furthermore, we apply our framework to study the effect of parameter regularization in variational quantum algorithms. The practicality of the theoretical results is demonstrated via implementations in simulation and on a quantum computer.

arXiv:2303.00618•Physical Review A•Jan 10, 2024•27 citations

Imperfection Effects for Multiple Applications of the Quantum Wavelet Transform

M. Terraneo, Dima L. Shepelyansky

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. The results for fidelity time scales, 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.

arXiv:quant-ph/0303043•Physical Review Letters•Jun 26, 2003•29 citations

Dynamical fidelity of a solid-state quantum computation

G. P. Berman, F. Borgonovi, G. L. Celardo +2 more

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.

arXiv:quant-ph/0206158•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Nov 25, 2002•12 citations

Quantum Codes Do Not Increase Fidelity against Isotropic Errors

Jesús García López de Lacalle, Luis Miguel Pozo Coronado, André Luiz Fonseca de Oliveira +1 more

In this article, we study the ability of error-correcting quantum codes to increase the fidelity of quantum states throughout a quantum computation. We analyze arbitrary quantum codes that encode all qubits involved in the computation, and we study the evolution of n-qubit fidelity from the end of one application of the correcting circuit to the end of the next application. We assume that the correcting circuit does not introduce new errors, that it does not increase the execution time (i.e. its application takes zero seconds) and that quantum errors are isotropic. We show that the quantum code increases the fidelity of the states perturbed by quantum errors but that this improvement is not enough to justify the use of quantum codes. Namely, we prove that, taking into account that the time interval between the application of the two corrections is multiplied (at least) by the number of qubits n (due to the coding), the best option is not to use quantum codes, since the fidelity of the uncoded state over a time interval n times smaller is greater than that of the state resulting from the quantum code correction.

arXiv:2201.08589•Journal of Applied Mathematics and Physics•Jan 1, 2023•3 citations
We analyze the influence of errors on the implementation of the quantum Fourier transformation. Two kinds of errors are studied: (i) systematic errors due to off-resonant transitions and (ii) errors due to an external perturbation. The scaling of errors with system parameters and the number of qubits is analyzed. To suppress off-resonant transitions, we use correcting pulses while in order to suppress errors due to an external perturbation, we use an improved quantum Fourier transformation algorithm. As a result, the fidelity of quantum computation is increased by several orders of magnitude and is thus stable in a much wider range of physical parameters.
The performance of today's quantum computers are affected by noise. This effect can be analyzed in the result of simple quantum algorithms in real quantum computers. The noise can be characterized as a decoherence error or a systematic error, the last could be corrected by a unitary rotation. In this article we propose two methods to model a systematic error, in the Quantum Fourier Transform algorithm (QFT). The first method uses the isotropic index presented in `` [1] and needs to reconstruct the density matrix of the experimental state, while the second method, although less general, only needs to reconstruct the reduced density matrices for each qubit. In both methods, a unitary transformation is proposed, which approximates the experimental result to the expected theoretical state. As an example, the QFT algorithm is analyzed for two qubit states, in quantum IBM Q computer ibmq\_santiago.
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.
Coherent control errors, for which ideal Hamiltonians are perturbed by unknown multiplicative noise terms, are a major obstacle for reliable quantum computing. In this paper we present a framework for analyzing the robustness of quantum algorithms against coherent control errors using Lipschitz bounds. We derive worst-case fidelity bounds which show that the resilience against coherent control errors is mainly influenced by the norms of the Hamiltonians generating the individual gates. These bounds are explicitly computable even for large circuits and they can be used to guarantee fault tolerance via threshold theorems. Moreover, we apply our theoretical framework to derive a guideline for robust quantum algorithm design and transpilation, which amounts to reducing the norms of the Hamiltonians. Using the three-qubit quantum Fourier transform as an example application, we demonstrate that this guideline targets robustness more effectively than existing ones based on circuit depth or gate count. Furthermore, we apply our framework to study the effect of parameter regularization in variational quantum algorithms. The practicality of the theoretical results is demonstrated via implementations in simulation and on a quantum computer.
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.
In this article, we study the ability of error-correcting quantum codes to increase the fidelity of quantum states throughout a quantum computation. We analyze arbitrary quantum codes that encode all qubits involved in the computation, and we study the evolution of n-qubit fidelity from the end of one application of the correcting circuit to the end of the next application. We assume that the correcting circuit does not introduce new errors, that it does not increase the execution time (i.e. its application takes zero seconds) and that quantum errors are isotropic. We show that the quantum code increases the fidelity of the states perturbed by quantum errors but that this improvement is not enough to justify the use of quantum codes. Namely, we prove that, taking into account that the time interval between the application of the two corrections is multiplied (at least) by the number of qubits n (due to the coding), the best option is not to use quantum codes, since the fidelity of the uncoded state over a time interval n times smaller is greater than that of the state resulting from the quantum code correction.