Characterizing errors for Quantum Fourier Transform on IBM Q
Carolina Allende, André Fonseca de Oliveira, Efrain Buksman
Abstract
Open-access reader
Carolina Allende, André Fonseca de Oliveira, Efrain Buksman
Abstract
Open-access reader
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Quantum Fourier transform, Quantum phase estimation algorithm, Quantum error correction, Quantum algorithm, Quantum computer, Quantum decoherence, Algorithm, Qubit