Related papers: Implementation of the Quantum Fourier Transform

This is a short introduction to Quantum Computing intended for physicists. The basic idea of a quantum computer is introduced. Then we concentrate on Shor's integer factoring algorithm.

This paper describes recent progress using nuclear magnetic resonance (NMR) as a platform for implementing quantum information processing (QIP) tasks. The basic ideas of NMR QIP are detailed, examining the successes and limitations of…

We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transform of order $2^n$ is needed, and this can be done exactly.…

We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact $N$-point Quantum Fourier Transform (QFT) for arbitrary $N$. Our construction factors the $N$-dimensional QFT unitary into three diagonal quadratic-phase…

We report an experimental demonstration of a complied version of Shor's algorithm using four photonic qubits. We choose the simplest instance of this algorithm, that is, factorization of N=15 in the case that the period $r=2$ and exploit a…

Quantum key distribution (QKD) and quantum message encryption protocols promise a secure way to distribute information while detecting eavesdropping. However, current protocols may suffer from significantly reduced eavesdropping protection…

The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of…

The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms…

We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple…

Efficient numerical characterization is a key problem in composite material analysis. To follow accuracy improvement in image tomography, memory efficient methods of numerical characterization have been developed. Among them, an FFT based…

In recent years, advancements in quantum chip technology, such as Willow, have contributed to reducing quantum computation error rates, potentially accelerating the practical adoption of quantum computing. As a result, the design of quantum…

This paper reports on the experimental implementation of the quantum baker's map via a three bit nuclear magnetic resonance (NMR) quantum information processor. The experiments tested the sensitivity of the quantum chaotic map to…

Quantum computing is emerging as an alternative computing technology, which is built on the principles of subatomic physics. In spite of continuing progress in developing increasingly more sophisticated hardware and software, access to…

The quantum Fourier transform (QFT) has emerged as the primary tool in quantum algorithms which achieve exponential advantage over classical computation and lies at the heart of the solution to the abelian hidden subgroup problem, of which…

A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also…

We demonstrate the first implementation of a quantum algorithm on a liquid state nuclear magnetic resonance (NMR) quantum computer using almost pure states. This was achieved using a two qubit device where the initial state is an almost…

In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful…

Nuclear Magnetic Resonance (NMR) forms a natural test-bed to perform quantum information processing (QIP) and has so far proven to be one of the most successful quantum information processors. The nuclear spins in a molecule treated as…

Phase estimation algorithms are key protocols in quantum information processing. Besides applications in quantum computing, they can also be employed in metrology as they allow for fast extraction of information stored in the quantum state…

Shor's factoring algorithm illustrates the potential power of quantum computation. Here we present and numerically investigate a proposal for a compiled version of such an algorithm based on a quantum-wire network exploiting the…