Approximate quantum Fourier transform and decoherence.

We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyze quantum networks performing AQFT in the presence of decoherence and show that extensive approximations can be made before the accuracy of AQFT (as compa...

Full description

Bibliographic Details
Main Authors: Barenco, A, Ekert, A, Suominen, K, Törmä, P
Format: Journal article
Language:English
Published: 1996
_version_ 1826274245078941696
author Barenco, A
Ekert, A
Suominen, K
Törmä, P
author_facet Barenco, A
Ekert, A
Suominen, K
Törmä, P
author_sort Barenco, A
collection OXFORD
description We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyze quantum networks performing AQFT in the presence of decoherence and show that extensive approximations can be made before the accuracy of AQFT (as compared with regular quantum Fourier transform) is compromised. We show that for some computations an approximation may imply a better performance.
first_indexed 2024-03-06T22:40:31Z
format Journal article
id oxford-uuid:5b61ce71-3b23-4dfc-9cd2-c645086f8bfe
institution University of Oxford
language English
last_indexed 2024-03-06T22:40:31Z
publishDate 1996
record_format dspace
spelling oxford-uuid:5b61ce71-3b23-4dfc-9cd2-c645086f8bfe2022-03-26T17:21:45ZApproximate quantum Fourier transform and decoherence.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:5b61ce71-3b23-4dfc-9cd2-c645086f8bfeEnglishSymplectic Elements at Oxford1996Barenco, AEkert, ASuominen, KTörmä, PWe discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyze quantum networks performing AQFT in the presence of decoherence and show that extensive approximations can be made before the accuracy of AQFT (as compared with regular quantum Fourier transform) is compromised. We show that for some computations an approximation may imply a better performance.
spellingShingle Barenco, A
Ekert, A
Suominen, K
Törmä, P
Approximate quantum Fourier transform and decoherence.
title Approximate quantum Fourier transform and decoherence.
title_full Approximate quantum Fourier transform and decoherence.
title_fullStr Approximate quantum Fourier transform and decoherence.
title_full_unstemmed Approximate quantum Fourier transform and decoherence.
title_short Approximate quantum Fourier transform and decoherence.
title_sort approximate quantum fourier transform and decoherence
work_keys_str_mv AT barencoa approximatequantumfouriertransformanddecoherence
AT ekerta approximatequantumfouriertransformanddecoherence
AT suominenk approximatequantumfouriertransformanddecoherence
AT tormap approximatequantumfouriertransformanddecoherence