Related papers: Programmable coherent linear quantum operations wi…
We present an architecture-algorithm co-design study of the Optimistic Quantum Fourier Transform (OQFT) under a surface-code fault-tolerant execution model for reconfigurable neutral-atom hardware. Analyzing the OQFT structure, particularly…
Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than…
Quantum state tomography (QST) remains the gold standard for benchmarking and verification of near-term quantum devices. While QST for a generic quantum many-body state requires an exponentially large amount of resources, most physical…
We report an optical detector with tunable positive operator-valued measures (POVMs). The device is based on a combination of weak-field homodyne techniques and photon-number-resolving detection. The resulting POVMs can be continuously…
We suggest a new method for quantum optical control with nanoscale resolution. Our method allows for coherent far-field manipulation of individual quantum systems with spatial selectivity that is not limited by the wavelength of radiation…
We present an economical dynamical control scheme to perform quantum computation on a one dimensional optical lattice, where each atom encodes one qubit. The model is based on atom tunneling transitions between neighboring sites of the…
Efficient scaling and flexible control are key aspects of useful quantum computing hardware. Spins in semiconductors combine quantum information processing with electrons, holes or nuclei, control with electric or magnetic fields, and…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
Although Fourier series approximation is ubiquitous in computational physics owing to the Fast Fourier Transform (FFT) algorithm, efficient techniques for the fast evaluation of a three-dimensional truncated Fourier series at a set of…
The Quantum Fourier Transform (QFT) is a key component of many important quantum algorithms, most famously as being the essential ingredient in Shor's algorithm for factoring products of primes. Given its remarkable capability, one would…
All-quantum signal processing techniques are at the core of the successful advancement of most information-based quantum technologies. This paper develops coherent and comprehensive methodologies and mathematical models to describe Fourier…
Spatial qudit states can be realized by using multi-slits to discretize the transverse momentum of a photon. The merit of this kind of spatial qudit states is that the implementation of higher dimensional qudits is relatively easy. As we…
One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an…
Using coherent states in optical quantum process tomography is a practically-relevant approach. Here, we develop a framework for complete characterization of quantum-optical processes in terms of normally-ordered moments by using coherent…
To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper presents a resource-saving method, namely t-bit semiclassical QFT over (Z_(2^n)), which could realize large-scale QFT…
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…
Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
Ultracold atoms can be used to perform quantum simulations of a variety of condensed matter systems, including spin systems. These progresses point to the implementation of the manipulation of quantum states and to observe and exploit the…
Many problems in linear algebra -- such as those arising from non-Hermitian physics and differential equations -- can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. However, the existing Quantum…