We report on an experiment on Grover's quantum search algorithm showing that {\em classical waves} can search a $N$-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed iteratively as the pulse bounces back and forth between two mirrors. We directly observe the sought item being found in $\sim\sqrt{N}$ iterations, in the form of a growing intensity peak on this profile. Although the lack of quantum entanglement limits the {\em size} of our database, our results show that entanglement is neither necessary for the algorithm itself, nor for its efficiency.
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of the QFT is presented with fidelity measures, and state tomography. Experimentally realizing the QFT is a clear demonstration of NMR's ability to control quantum systems.
We propose a simplified mathematical construction of the quantum Fourier transform which is suited for systems described by Ising-type Hamiltonians. By contrast to the standard Cooley-Tuckey scheme, which prescribes sequences of CPHASE gates, our implementation is based on one-qubit gates and a free evolution process. We also show how to obtain a quadratic speed-up by applying the conditional interactions simultaneously. Thus rather than O($N^2$) our implementation time scales as O($N$). Finally, we show a realization of our method with homogeneous microwave driven ion traps in a magnetic fiel…
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a circuit decomposition of the QFT for hybrid qudits based on generalized Hadamard and generalized controlled-phase gates, which can be implemented using selective rotations in NMR. We experimentally implement the hybrid qudit QFT on an NMR quantum emulator, which uses four qubits to emulate a single qutrit coupled to two qubits.
We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger equations with linear and quadratic potentials by a quantum computer of such type. The method is adaptable to the wide range of interactions of diagonal form between qubits and to the case when different pairs of qubits interact variously.
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the integrated configuration used in our experiments, the order of the transform is mapped onto the longitudinal coordinate, thus opening up the prospect of simultaneously observing all Transformation orders. In the context of classical optics, we implement discrete fractional Fourier transforms, both integer and fractional, of exemplary wave functions and experim…
We consider the problem of time-optimal realization of the quantum Fourier transform gate for a single qudit with number of levels d from 3 to 8. As a qudit the quadrupole nucleus with spin I > 1/2 controlled by NMR is considered. We calculate the dependencies of the gate error on the duration of radio-frequency pulse obtained by numerical optimization using Krotov-based algorithm. It is shown that the dependences of minimum time of QFT gate implementation on qudit dimension are different for integer and half-integer spins.
In this paper, we introduce an optical analogy to quantum Fourier tanformation based on a pseudorandom phase ensemble. The optical analogy also brings about exponential speedup over classical Fourier tanformation. Using the analogy, we demonstrate three classcial fields to realize Fourier transform similar to three quantum particles.
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits $n$. The schemes were implemented on a t…
The light's image is the primary source of information carrier in nature. Indeed, a single photon's image possesses a vast information capacity that can be harnessed for quantum information processing. Our scheme for implementing quantum information processing via universal multiport processors employs a class of quantum Fourier optical systems composed of spatial phase modulators and 4f-processors with phase-only pupils having a characteristic periodicity that reduces the number of optical resources quadratically as compared to other conventional path encoding techniques. In particular, this …
We present one- and two-photon diffraction and interference experiments involving parametric down-converted photon pairs. By controlling the divergence of the pump beam in parametric down-conversion, the diffraction-interference pattern produced by an object changes from a quantum (perfectly correlated) case to a classical (uncorrelated) one. The observed diffraction and interference patterns are accurately reproduced by Fourier-optical analysis taking into account the quantum spatial correlation. We show that the relation between the spatial correlation and the object size plays a crucial rol…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation gate. Error probability was estimated to be 0.01 per qubit, which corresponded to error-free operation on 100 qubits. The error probability can be further reduced by taking the majority of the accumulated results. The reduction of error probability resulted in a successful QFT demonstration on 1024 qubits.
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 optical signal processing in full quantum terms for any input quantum state of light. We begin this paper by introducing a spatially two-dimensional quantum state of a photon, associated with its wavefront and expressible as a two-dimensional creation operator. Then, by breaking down the Fourier optical processing apparatus into its key components, we strive…
We report experimental implementation of discrete Fourier transformation(DFT) on a nuclear magnetic resonance(NMR) quantum computer. Experimental results agree with theoretical results. Using the pulse sequences we introduced, DFT can be realized on any L-bit quantum number in principle.
Experimental realization of quantum information processing in the field of nuclear magnetic resonance (NMR) has been well established. Implementation of conditional phase shift gate has been a significant step, which has lead to realization of important algorithms such as Grover's search algorithm and quantum Fourier transform. This gate has so far been implemented in NMR by using coupling evolution method. We demonstrate here the implementation of the conditional phase shift gate using transition selective pulses. As an application of the gate, we demonstrate Grover's search algorithm and qua…
We found that the actual computational time-cost of the QFT is O(n 2^n) for large n in a quantum computer using nuclear spins. The computational cost of a quantum algorithm has usually been estimated as the sum of the universal gates required in such ideal mathematical models as the Quantum Turing Machine(QTM) and the quantum circuit. This cost is proportional to an actual time-cost in the physical implementation where all quantum operations can be achieved in the same time. However, if the implementation takes a different time for each quantum gate, there is a possibility that the actual time…
We demonstrate the relation between a global phase of the quantum gate and the layout of energy levels of its effective Hamiltonian required for implementing the gate for minimum time. By an example of the quantum Fourier transform gate for a qudit represented by a quadrupole nucleus with the spin I = 1, the effective Hamiltonians and minimum implementation times for different global phases are found. Using numerical optimal control methods, the problem of the global phase in searching for the optimal pulse shape is considered in detail for the quantum Fourier transform gate at I = 1, 3/2, 2, …
We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector spaces. Namely, our FFT is defined as a transformation of the tensor product of quantum states. It is essentially different from the so-called quantum Fourier transform (QFT) defined to be a linear transformation of the amplitudes for the superposition of quantum states. The quantum circuit for the FFT consists of several circuits for elementary arithmetic oper…
Entangled photons, generated by spontaneous parametric down-conversion from a second-order nonlinear crystal, present a rich potential for imaging and image-processing applications. Since this source is an example of a three-wave mixing process, there is more flexibility in the choices of illumination and detection wavelengths and in the placement of object(s) to be imaged. Moreover, this source is entangled, a fact that allows for imaging configurations and capabilities that cannot be achieved using classical sources of light. In this paper we examine a number of imaging and image-processing …
We prove that, under the condition of validity of the Fresnel approximation, diffraction and interference for a wave traveling in the z-direction may be described in terms of the spreading in time of the transverse (x,y)-wave packet. The time required for the evolved wave packet to yield identical patterns as given by standard optics corresponds to the time for the quantum to cross the optical apparatus. This point of view may provide interesting cues in wave mechanics and quantum physics education.
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier transformed integers have appeared in the literature for two level qubits. Here we extend these techniques on multilevel qudits, as they may offer some advantages relative to qubits implementations. The arithmetic circuits presented can be used as basi…
The Fourier transform proves indispensable in the processing of classical information as well as in the quantum domain, where it finds many applications ranging from state reconstruction to prime factoring. An implementation scheme of the $d$-dimensional Fourier transform acting on single photons is known that uses the path encoding and requires $O(d \log d)$ optical elements. In this paper we present an alternative design that uses the orbital angular momentum as a carrier of information and needs only $O(\sqrt{d}\log d)$ elements, rendering the path-encoded design inefficient. The advantageo…
Quantum Optical Coherence Tomography (Q-OCT) is a non-classical equivalent of Optical Coherence Tomography and is able to provide a twofold axial resolution increase and immunity to resolution-degrading dispersion. The main drawback of Q-OCT are artefacts which are additional elements that clutter an A-scan and lead to a complete loss of structural information for multilayered objects. Whereas there are successful methods for artefact removal in Time-domain Q-OCT, no such scheme has been devised for Fourier-domain Q-OCT (Fd-Q-OCT), although the latter modality - through joint spectrum detectio…
Temporal Fourier Optics Reveals Hidden Hybridized Light-Matter States
Singapore University of Technology and Design（新加坡科技设计大学）；Henan University（河南大学）；Henan Academy of Sciences（河南省科学院）；Harbin Institute of Technology（哈尔滨工业大学）；National University of Singapore（新加坡国立大学）
