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

Revista Mexicana de Física

Characterizing errors for Quantum Fourier Transform on IBM Q

Carolina Allende, André Fonseca de Oliveira, Efrain Buksman

Published Apr 5, 2022• 1 citation
Publisher

Abstract

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.

DOI
10.31349/revmexfis.68.031402

Related papers

Performance and error modeling of Deutsch's algorithm in IBM Q

Efrain Buksman, A. L. Fonseca de Oliveira, C. Allende

The performance of quantum computers today can be studied by analyzing theeect of errors in the result of simple quantum algorithms. The modeling and char-acterization of these errors is relevant to correct them, for example, with quantumcorrecting codes. In this article we characterize the error of the ve qubits quantumcomputer ibmqx4 (IBM Q), using a Deutsch algorithm and modeling the error byGeneralized Amplitude Damping (GAD) and a unitary misalignment operation.

arXiv:1912.07486•Revista Mexicana de Física•Mar 1, 2020•3 citations

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

Robert Basili, Wenyang Qian, Shuo Tang +5 more

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor's algorithm, weighted sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM's superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands' superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. We analyze performance trends in our results and speculate on possible future development within this computational paradigm.

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum•May 1, 2022•3 citations

Quantum process tomography of the quantum Fourier transform

Yaakov S. Weinstein, Timothy F. Havel, Joseph Emerson +4 more

The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The quantum operation studied was the quantum Fourier transform, which is important in several quantum algorithms and poses a rigorous test for the precision of our recently developed strongly modulating control fields. The results were analyzed in an attempt to decompose the implementation errors into coherent (overall systematic), incoherent (microscopically deterministic), and decoherent (microscopically random) components. This analysis yielded a superoperator consisting of a unitary part that was strongly correlated with the theoretically expected unitary superoperator of the quantum Fourier transform, an overall attenuation consistent with decoherence, and a residual portion that was not completely positive-although complete positivity is required for any quantum operation. By comparison with the results of computer simulations, the lack of complete positivity was shown to be largely a consequence of the incoherent errors which occurred over the full quantum process tomography procedure. These simulations further showed that coherent, incoherent, and decoherent errors can often be identified by their distinctive effects on the spectrum of the overall superoperator. The gate fidelity of the experimentally determined superoperator was 0.64, while the correlation coefficient between experimentally determined superoperator and the simulated superoperator was 0.79; most of the discrepancies with the simulations could be explained by the cumulative effect of small errors in the single qubit gates.

arXiv:quant-ph/0406239•The Journal of Chemical Physics•Sep 27, 2004•186 citations

STABILITY OF THE QUANTUM FOURIER TRANSFORMATION ON THE ISING QUANTUM COMPUTER

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

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.

arXiv:quant-ph/0310163•International Journal of Quantum Information•Sep 1, 2005•11 citations

EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE

Kavita Dorai, Dieter Suter

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

arXiv:quant-ph/0211030•International Journal of Quantum Information•May 31, 2005•20 citations

Understand Noise on Universal Quantum Adder Circuit

Wiphoo Methachawalit, Prabhas Chongstitvatana

Quantum Fourier Transform (QFT) is an essential algorithm for quantum computers. There are many uses of QFT in the application of quantum computing. In this work, we proposed a generalized adder circuit that was fundamental for QFT. We designed and ran the experiments with the proposed adder circuit on an IBM quantum computer facility. We observed that the number of qubits was one factor in the error rate. We found that our proposed two-qubits adder circuit running on the IBM quantum computer had an error rate of around 25%. The complexity of the adder circuit includes qubit connectivity, physical devices, and error from noise due to the environment. We demonstrated the constraints of the proposed adder circuit.

Current Applied Science and Technology•Dec 14, 2023•0 citations
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.
The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor's algorithm, weighted sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM's superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands' superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. We analyze performance trends in our results and speculate on possible future development within this computational paradigm.
The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The quantum operation studied was the quantum Fourier transform, which is important in several quantum algorithms and poses a rigorous test for the precision of our recently developed strongly modulating control fields. The results were analyzed in an attempt to decompose the implementation errors into coherent (overall systematic), incoherent (microscopically deterministic), and decoherent (microscopically random) components. This analysis yielded a superoperator consisting of a unitary part that was strongly correlated with the theoretically expected unitary superoperator of the quantum Fourier transform, an overall attenuation consistent with decoherence, and a residual portion that was not completely positive-although complete positivity is required for any quantum operation. By comparison with the results of computer simulations, the lack of complete positivity was shown to be largely a consequence of the incoherent errors which occurred over the full quantum process tomography procedure. These simulations further showed that coherent, incoherent, and decoherent errors can often be identified by their distinctive effects on the spectrum of the overall superoperator. The gate fidelity of the experimentally determined superoperator was 0.64, while the correlation coefficient between experimentally determined superoperator and the simulated superoperator was 0.79; most of the discrepancies with the simulations could be explained by the cumulative effect of small errors in the single qubit gates.
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 Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.
Quantum Fourier Transform (QFT) is an essential algorithm for quantum computers. There are many uses of QFT in the application of quantum computing. In this work, we proposed a generalized adder circuit that was fundamental for QFT. We designed and ran the experiments with the proposed adder circuit on an IBM quantum computer facility. We observed that the number of qubits was one factor in the error rate. We found that our proposed two-qubits adder circuit running on the IBM quantum computer had an error rate of around 25%. The complexity of the adder circuit includes qubit connectivity, physical devices, and error from noise due to the environment. We demonstrated the constraints of the proposed adder circuit.