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

Applied Physics Letters

Quantum waveguide array generator for performing Fourier transforms: Alternate route to quantum computing

Richard Akis, David K. Ferry

Published Oct 22, 2001• 13 citations
Publisher

Abstract

Recently, quantum computing has gained attention as a possible means of greatly increasing the speed of certain calculations when compared with traditional, binary computing. A key part of many quantum computing algorithms is the performance of a Fourier transform. In this letter, we propose a quantum waveguide array device that can perform such operations quickly with a parallel approach that uses the analog properties of waves and rather than the qubit concept.

DOI
10.1063/1.1413500

Related papers

Comment on “Quantum waveguide array generator for performing Fourier transforms: Alternate route to quantum computing” [Appl. Phys. Lett. 79, 2823 (2001)]

Daniel A. Lidar

A Comment on the paper "Quantum waveguide array generator for performing Fourier transforms: Alternate route to quantum computing" by R. Akis and D.K. Ferry, Appl. Phys. Lett. 79, 2823 (2001). The authors reply in Appl. Phys. Lett. 80, 2420 (2002).

arXiv:quant-ph/0308124•Applied Physics Letters•Apr 1, 2002•3 citations

Response to “Comment on ‘Quantum waveguide array generator for performing Fourier transforms: Alternate route to quantum computing’ ” [Appl. Phys. Lett. 80, 2419 (2002)]

Richard Akis, David K. Ferry

Comment on "Quantum waveguide array generator for performing Fourier transforms: Alternate route to quantum computing" [Appl.

Applied Physics Letters•Apr 1, 2002•0 citations

A Quantum Waveguide Array Generator For Performing Fourier Transforms

Richard Akis, David K. Ferry

•Feb 23, 2003•0 citations

Quantum computers, principles and latest development

Eduard Ješko

The main goal of this thesis is to give information on quantum computer principles and its latest development. In the first part we introduce quantum bits, quantum registers and quantum gates. We show basic operations acting on one and more qubits. On an example we present, how it is possible to construct an arbitrary gate using only elementary quantum gates. We describe a behaviour of quantum computers called quantum parallelism and show its application in Deutsch's algorithm. We define the quantum Fourier transform and its applications. In the last chapter we explain on what principle the D-Wave quantum computer works. In this thesis we compare classical and quantum computers in terms of algorithms and computational speed.

•Jun 17, 2014•0 citations

Do we need quantum for quantum computing?

David K. Ferry, Richard Akis, Matthew J. Gilbert +1 more

The concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. There also has been considerable discussion about physical implementations of the qubit. This has led, in recent years, to a situation in which quantum computing and quantum information theory are being rapidly developed. In general, the specific advantages offered by quantum computing have been somewhat nebulous. On the one hand, faster computing was promised, but we now know that no speedup of most algorithms exists relative the speed that can be obtained with massive parallel processing. Then, we are promised that the use of entanglement will make quantum computing possible with a much smaller use of resources. Yet, entanglement must be viewed as a hidden variable, which is not accessible in experiment. How does this provide the speedup? We have suggested that analog processing may provide a suitable alternative, and may be the basis which provides the speedup in quantum computing, but this is a controversial assertion. In this talk, we will discuss these particular viewpoints, along with several approaches to a wave basis for (quantum) computing.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 9, 2003•6 citations

Energetics of Rydberg-atom Quantum Computing

Óscar Alves, Marco Pezzutto, Yasser Omar

While extensive research over the past decades has been dedicated to developing scalable quantum computers, the question of their energetic performance has only gained attention more recently, but its importance is now recognized. In fact, quantum computers can only be a viable alternative if their energy cost scales favorably, and some research has shown that there is even a potential quantum energy advantage. In parallel, Rydberg atoms have recently emerged as one of the most promising platforms to implement a large-scale quantum computer. This work aims at contributing first steps to understand the energy efficiency of this platform, by investigating the energy consumption of the different elements of a Rydberg atom quantum computer. First, an experimental implementation of the Quantum Phase Estimation algorithm is analyzed, and an estimation of the energetic cost of executing it is calculated. Then, we derive an estimate of how the energy cost of performing the Quantum Fourier Transform scales with the number of qubits in the Rydberg platform. This analysis facilitates a comparison of the energy consumption of different elements within a Rydberg atom quantum computer, from the preparation of the atoms to the execution of the algorithm, and the measurement of the final state, enabling the evaluation of the energy expenditure of the Rydberg platform and the identification of potential improvements. Finally, we use the Quantum Fourier Transform as an energetic benchmark, comparing the scaling we obtained to that of the execution of the Discrete Fourier Transform in two state-of-the-art classical supercomputers. This comparison indicates that, in an ideal error-free scenario, a quantum energy advantage is achieved in the Rydberg platform for the Fourier Transform, in a regime where classical algorithms are still faster.

quant-pharXiv:2601.03141•Jan 7, 2026•3 citations
Recently, quantum computing has gained attention as a possible means of greatly increasing the speed of certain calculations when compared with traditional, binary computing. A key part of many quantum computing algorithms is the performance of a Fourier transform. In this letter, we propose a quantum waveguide array device that can perform such operations quickly with a parallel approach that uses the analog properties of waves and rather than the qubit concept.
The main goal of this thesis is to give information on quantum computer principles and its latest development. In the first part we introduce quantum bits, quantum registers and quantum gates. We show basic operations acting on one and more qubits. On an example we present, how it is possible to construct an arbitrary gate using only elementary quantum gates. We describe a behaviour of quantum computers called quantum parallelism and show its application in Deutsch's algorithm. We define the quantum Fourier transform and its applications. In the last chapter we explain on what principle the D-Wave quantum computer works. In this thesis we compare classical and quantum computers in terms of algorithms and computational speed.
The concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. There also has been considerable discussion about physical implementations of the qubit. This has led, in recent years, to a situation in which quantum computing and quantum information theory are being rapidly developed. In general, the specific advantages offered by quantum computing have been somewhat nebulous. On the one hand, faster computing was promised, but we now know that no speedup of most algorithms exists relative the speed that can be obtained with massive parallel processing. Then, we are promised that the use of entanglement will make quantum computing possible with a much smaller use of resources. Yet, entanglement must be viewed as a hidden variable, which is not accessible in experiment. How does this provide the speedup? We have suggested that analog processing may provide a suitable alternative, and may be the basis which provides the speedup in quantum computing, but this is a controversial assertion. In this talk, we will discuss these particular viewpoints, along with several approaches to a wave basis for (quantum) computing.
While extensive research over the past decades has been dedicated to developing scalable quantum computers, the question of their energetic performance has only gained attention more recently, but its importance is now recognized. In fact, quantum computers can only be a viable alternative if their energy cost scales favorably, and some research has shown that there is even a potential quantum energy advantage. In parallel, Rydberg atoms have recently emerged as one of the most promising platforms to implement a large-scale quantum computer. This work aims at contributing first steps to understand the energy efficiency of this platform, by investigating the energy consumption of the different elements of a Rydberg atom quantum computer. First, an experimental implementation of the Quantum Phase Estimation algorithm is analyzed, and an estimation of the energetic cost of executing it is calculated. Then, we derive an estimate of how the energy cost of performing the Quantum Fourier Transform scales with the number of qubits in the Rydberg platform. This analysis facilitates a comparison of the energy consumption of different elements within a Rydberg atom quantum computer, from the preparation of the atoms to the execution of the algorithm, and the measurement of the final state, enabling the evaluation of the energy expenditure of the Rydberg platform and the identification of potential improvements. Finally, we use the Quantum Fourier Transform as an energetic benchmark, comparing the scaling we obtained to that of the execution of the Discrete Fourier Transform in two state-of-the-art classical supercomputers. This comparison indicates that, in an ideal error-free scenario, a quantum energy advantage is achieved in the Rydberg platform for the Fourier Transform, in a regime where classical algorithms are still faster.