Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Quantum interference enables constant-time quantum information processing

Published

Author(s)

Thomas Gerrits, Sae Woo Nam, Adriana E. Lita, M. Stobinska, A. Buraczewski, M. Moore, W.R. Clements, J.J. Renema, W.S. Kolthammer, A. Eckstein, I.A. Walmsley

Abstract

It is an open question how fast information processing can be performed and whether quantum effects can speed up the best existing solutions. Signal extraction, analysis, and compression in diagnostics, astronomy, chemistry, and broadcasting build on the discrete Fourier transform. It is implemented with the fast Fourier transform (FFT) algorithm that assumes a periodic input of specific lengths, which rarely holds true. A lesser-known transform, the Kravchuk-Fourier (KT), allows one to operate on finite strings of arbitrary length. It is of high demand in digital image processing and computer vision but features a prohibitive runtime. Here, we report a one-step computation of a fractional quantum KT. The quantum d-nary (qudit) architecture we use comprises only one gate and offers processing time independent of the input size. The gate may use a multiphoton Hong-Ou-Mandel effect. Existing quantum technologies may scale it up toward diverse applications.
Citation
Science Advances
Volume
5

Keywords

quantum information processing, large photon number states, Kravchuk-Fourier transform

Citation

Gerrits, T. , Nam, S. , Lita, A. , Stobinska, M. , Buraczewski, A. , Moore, M. , Clements, W. , Renema, J. , Kolthammer, W. , Eckstein, A. and Walmsley, I. (2019), Quantum interference enables constant-time quantum information processing, Science Advances, [online], https://doi.org/10.1126/sciadv.aau9674 (Accessed July 21, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created July 19, 2019, Updated July 30, 2019