Approximate Quantum Fourier Transform
Approximate Quantum Fourier Transform is a quantum algorithmic technique that belongs to the class of quantum Fourier transforms, distinguished by its truncation of small-angle rotational gates to reduce circuit complexity while preserving sufficient fidelity for specific applications such as Shor's algorithm and quantum phase estimation.
9
Publications
987
Citations
20
Authors
14
Institutions
Publications per year
2017–2026
1
Parents
9
Approximate quantum Fourier transform and decoherence
Adriano Barenco, Artur Ekert, Kalle‐Antti Suominen et al. · Physical Review A · 1996 · 181 citations · Full text
Computing, Computer Science, Physics +12
An improved quantum Fourier transform algorithm and applications
Lisa Hales, Sean Hallgren · 2002 · 168 citations
Approximate quantum Fourier transform with O(n log(n)) T gates
Yunseong Nam, Yuan Su, Dmitri Maslov · npj Quantum Information · 2020 · 90 citations · Full text
Computing, Computer Science, Physics +17
1–5 of 9
20
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 20
14

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
130 citations
Joint Center for Quantum Information and Computer Science
College Park, United States
1 h-index
1 publications
90 citations

University of Bristol
Bristol, United Kingdom
1 h-index
2 publications
116 citations

St. Jerome's University
Waterloo, Canada
1 h-index
1 publications
59 citations

University of Helsinki
Helsinki, Finland
1 h-index
2 publications
362 citations
University of Maryland, College Park
College Park, United States
1 h-index
1 publications
90 citations
University of Oxford
Oxford, United Kingdom
1 h-index
4 publications
724 citations

University of Electro-Communications
Tokyo, Japan
1 h-index
3 publications
111 citations
1–8 of 14
PRA · 2 publications · 239 citations
2
h-index
1 publications · 36 citations
1
h-index
1 publications · 90 citations
1
h-index
QIC · 1 publications · 37 citations
1
h-index
Repository · 1 publications · 346 citations
1
h-index
1–5