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/0206134 · Quantum Information Processing

Natural Majorization of the Quantum Fourier Transformation in Phase-Estimation Algorithms

Román Orús, José Ignacio Latorre, Miguel Angel Martin-Delgado

Published Aug 1, 2002• 12 citations
arXivHTMLPDF
DOI
10.1023/a:1022100320138

Related papers

Analysis of Quantum Phase Estimation Algorithm Using Quantum Fourier Transform

Priyanka Sharma, Rukhsar Zafar, Amit Kumar Sharma

Lecture notes in electrical engineering•Jan 1, 2025•0 citations

Approximate Quantum Fourier Transform and Quantum Algorithm for Phase Estimation

Alexander N. Prokopenya

Lecture notes in computer science•Jan 1, 2015•5 citations

Phase Estimation and quantum Fourier Transform (qFT)

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•3 citations

Simulation and analysis of quantum phase estimation algorithm in the presence of incoherent quantum noise channels

Muhammad Faizan, Muhammad Faryad

The quantum phase estimation (QPE) is one of the fundamental algorithms based on the quantum Fourier transform. It has applications in order-finding, factoring, and finding the eigenvalues of unitary operators. The major challenge in running QPE and other quantum algorithms is the noise in quantum computers. In the present work, we study the impact of incoherent noise on QPE, modeled as trace-preserving and completely positive quantum channels. Different noise models such as depolarizing, phase flip, bit flip, and bit-phase flip are taken to understand the performance of the QPE in the presence of noise. The simulation results indicate that the standard deviation of the eigenvalue of the unitary operator has strong exponential dependence upon the error probability of individual qubits. However, the standard deviation increases only linearly with the number of qubits for fixed error probability when that error probability is small.

arXiv:2307.15675•Quantum Computing, Communication, and Simulation•Mar 12, 2024•1 citation

Quantum phase estimation with arbitrary constant-precision phase shift operators

AhmadiHamed, ChiangChen-Fu

While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT)) is highly constrained...

Quantum Information and Computation•Sep 1, 2012•0 citations

1024-Qubits-Quantum Fourier Transform on a Fiber-optics circuit

Akihisa Tomita, Kazuo Torii Nakamura

Quantum Fourier transform (QFT) is an important subroutine in quantum computation. A QFT followed by measurement (MQFT) which appears in the final part of the phase estimation algorithm was demonstrated on a simple circuit based on fiber-optics. The MQFT was shown to be robust against imperfections in the rotation gate. Error probability was estimated to be 0.01 per qubit but could be further reduced by taking the majority of the accumulated results. The reduction of error probability resulted in a successful MQFT of 1024 qubits. The present results not only demonstrate the potential of fiber optics but provide an important clue for quantum computer design.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jun 1, 2005•0 citations
The quantum phase estimation (QPE) is one of the fundamental algorithms based on the quantum Fourier transform. It has applications in order-finding, factoring, and finding the eigenvalues of unitary operators. The major challenge in running QPE and other quantum algorithms is the noise in quantum computers. In the present work, we study the impact of incoherent noise on QPE, modeled as trace-preserving and completely positive quantum channels. Different noise models such as depolarizing, phase flip, bit flip, and bit-phase flip are taken to understand the performance of the QPE in the presence of noise. The simulation results indicate that the standard deviation of the eigenvalue of the unitary operator has strong exponential dependence upon the error probability of individual qubits. However, the standard deviation increases only linearly with the number of qubits for fixed error probability when that error probability is small.
Quantum Fourier transform (QFT) is an important subroutine in quantum computation. A QFT followed by measurement (MQFT) which appears in the final part of the phase estimation algorithm was demonstrated on a simple circuit based on fiber-optics. The MQFT was shown to be robust against imperfections in the rotation gate. Error probability was estimated to be 0.01 per qubit but could be further reduced by taking the majority of the accumulated results. The reduction of error probability resulted in a successful MQFT of 1024 qubits. The present results not only demonstrate the potential of fiber optics but provide an important clue for quantum computer design.