Related papers: Quantum Fourier Transform in Oscillating Modes
Quantum frequency conversion (QFC) of photonic signals preserves quantum information while simultaneously changing the signal wavelength. A common application of QFC is to translate the wavelength of a signal compatible with the current…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
We propose using variational quantum algorithms (VQAs) to simulate established quantum algorithms under realistic noise conditions, aiming to surpass the fidelity of theoretical circuits in noisy environments. Focusing on the Quantum…
Qutrits (i.e., three-level quantum systems) can be used to achieve many quantum information and communication tasks due to their large Hilbert spaces. In this work, we propose a scheme to transfer an unknown quantum state between two flux…
Using the circulant symmetry of a Hamiltonian describing three qubits, we realize the quantum Fourier transform. This symmetry allows us to construct a set of eigenvectors independently on the magnitude of physical parameters involved in…
It is difficult to calculate the energy levels and eigenstates of a large physical system on a classical computer because of the exponentially growing size of the Hilbert space. In this work, we experimentally demonstrate a quantum…
- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…
Quantum frequency conversion (QFC), a critical technology in photonic quantum information science, requires that the quantum characteristics of the frequency-converted photon must be the same as the input photon except for the color. In…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for…
A simple and flexible scheme for high-dimensional linear quantum operations on optical transverse spatial modes is demonstrated. The quantum Fourier transformation (QFT) and quantum state tomography (QST) via symmetric informationally…
Precisely engineered mechanical oscillators keep time, filter signals, and sense motion, making them an indispensable part of today's technological landscape. These unique capabilities motivate bringing mechanical devices into the quantum…
Making use of coherence and entanglement as metrological quantum resources allows to improve the measurement precision from the shot-noise- or quantum limit to the Heisenberg limit. Quantum metrology then relies on the availability of…
For the solution of partial differential equations (PDEs), we show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple, both conceptually and with regard to hardware requirements.…
In quantum information processing (QIP), the quantum Fourier transform (QFT) has a plethora of applications [1] [2] [3]: Shor's algorithm and phase estimation are just a few well-known examples. Shor's quantum factorization algorithm, one…
We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for…
Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose…
The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The…