Unitary Fourier transform lies at the core of the multitudinous computational and metrological algorithms. Here we show experimentally how the unitary Fourier transform-based phase estimation protocol, used namely in quantum metrology, can be translated into the classical linear optical framework. The developed setup made of beam splitters, mirrors and phase shifters demonstrates how the classical coherence, similarly to the quantum coherence, poses a resource for obtaining information about the measurable physical quantities. Our study opens route to the reliable implementation of the small-scale unitary algorithms on path-encoded qudits, thus establishing an easily accessible platform for unitary computation.
Unitary Fourier transform lies at the core of the multitudinous computational and metrological algorithms. Here we show experimentally how the unitary Fourier transform-based phase estimation protocol, used namely in quantum metrology, can be translated into the classical linear optical framework. The developed setup made of beam splitters, mirrors and phase shifters demonstrates how the classical coherence, similarly to the quantum coherence, poses a resource for obtaining information about the measurable physical quantities. Our study opens route to the reliable implementation of the small-scale unitary algorithms on path-encoded qudits, thus establishing an easily accessible platform for unitary computation.
A large number of applications in classical and quantum photonics require the capability of implementing arbitrary linear unitary transformations on a set of optical modes. In a seminal work by Reck et al. [Phys. Rev. Lett.73, 58 (1994)10.1103/PhysRevLett.73.58], it was shown how to build such multiport universal interferometers with a mesh of beam splitters and phase shifters, and this design became the basis for most experimental implementations in the last decades. However, the design of Reck et al. is difficult to scale up to a large number of modes, which would be required for many applications. Here we present a deterministic algorithm that can find an exact and efficient implementation of any unitary transformation, using only Fourier transforms and phase masks. Since Fourier transforms and phase masks are routinely implemented in several optical setups and they do not suffer from some of the scalability issues associated with building extensive meshes of beam splitters, we believe that our design can be useful for many applications in photonics.
Summary form only given. Phase estimation represents one of the most notable examples in the context of the quantum metrology. The aim is to improve the capabilities to measure an unknown phase shift between the arms of an interferometer with respect to classical strategies by adopting quantum resources. Applications of the phase estimation task can be found in different contexts, such as imaging, measurements on biological systems, or gravitational wave detection [1]. While the theoretical and experimental frameworks for the single parameter case are well established, several open questions arise when extending the scenario to multiparameter estimation. Indeed, when the number of parameters to be estimated is larger than one, it is not trivial to saturate the ultimate bounds for all parameters simultaneously [2]. Hence, it becomes crucial to identify and implement experimentally a suitable platform to develop appropriate protocols for efficient multiphase estimation protocols. Here, we report [3] the experimental implementation of an interferometric platform to investigate experimentally multiphase estimation protocols. Such platform, shown in Fig. 1, is implemented by adopting the femtosecond laser micromachining technology, that allows to realize integrated photonic circuits including several optical elements. The implemented interferometer (Fig. 1) is composed of a first unitary transformation for state preparation, namely a balanced tritter [4,5], a second stage for internal phases, and a second unitary transformation for measurement of the output state. Reconfigurability in the device is inserted by means of thermo-optic phase shifters, that allow to tune the optical phases by applying a voltage on gold-plated resistors placed on top of the waveguides [6]. Resistors pattern on the device has been realized by using the same laser writing technology employed to implement the interferometric structure. We have then performed a multiphase estimation experiment by injecting two-photon input states within the interferometer for simultaneous measurement of two phases.
Using the quantum fast Fourier transform in linear optics the input mode annihilation operators {â0,â1,...,âs−1} are transformed into output mode annihilation operators {b̂0,b̂1,...,b̂s−1}. We show how to implement experimentally such transformations based on the Cooley-Tukey algorithm, by the use of beam splitters and phase shifters in a linear optical system. Optical systems implementing 1,2, and 3 qubits discrete Fourier transform (DFT) are described, and a general method for implementing the n-qubit DFT is analyzed. These transformations are used on various input radiation states by which phase estimation and order finding can be computed.
The Quantum Fourier Transform (QFT)andQuantumPhaseEstimation (QPE)are twofundamental algorithmic frameworks in quantum computation, and they provide the mathematical basis of many exponential-speedup quan tum algorithms, such as Shor’s factoring algorithm and quantum simulation techniques. In this work we present a detailed theoretical and computational study of the Quantum Fourier Transform and its integration in the Quan tum Phase Estimation. The discussion begins with the linear algebraic structure of the Hilbert spaces, the unitary transformations, and the complex vector representations that enable quantum interference and superposition. The QFT is studied as the unitary transform of computational basis states in the amplitudes in the frequency domain by phase rotations and tensor-product decompositions. The efficient circuit implementation in terms of Hadamard and controlled phase gates of this transform is discussed. The advantage of the transform in terms of polynomial time complexity over the classical discrete Fourier transform in some quantum scenarios is discussed.The QFT is implemented and the Quantum Phase Estimation algorithm is proposed to obtain the eigenphase information of the unitary operators. In the report the mathematical representation of QPE is derived by using the controlled unitary evolution, the inverse Fourier transforms and the measurement theory in finite dimensional Hilbert spaces. We discuss the probabilistic interpretation of phase extraction in detail and the convergence properties of the bi nary phase approximation. We also discuss the relation of QPE to eigenvalue problems in quantum mechanics and its applications to Hamiltonian simulation, quantum chemistry, cryptography, and hidden subgroup prob lems.Implementation aspects of these algorithms are studied using quantum circuit representations and oracle based computation models. We also discuss error sensitivity, qubit precision requirements, decoherence limita tions and practical constraints of Noisy Intermediate-Scale Quantum (NISQ) hardware. The work synthesizes the mathematical foundations, computational complexity analysis and physical realizations of the QFT and the QPE, demonstrating how the Fourier-based quantum transformations provide the essential mechanism underlying modern quantum algorithmic speedups and scalable quantum information processing.
Quantum phase estimation is a core task in quantum technologies ranging from metrology to quantum computing, where it appears as a key subroutine in various algorithms. Here, we quantitatively connect the performance of phase estimation protocols with quantum coherence. To achieve this, we construct and characterize resource theories of quantum networks that cannot generate coherence. Given multiple copies of a unitary encoding an unknown phase and access to a fixed coherent state, we estimate the phase using such networks. For a unified and general approach, we assess the quality of the estimate using a generic cost function that penalizes deviations from the true value. We determine the minimal average cost that can be achieved in this manner and explicitly derive optimal protocols. From this, we construct a family of coherence measures that directly connect a state's coherence with its value for phase estimation, demonstrating that every bit of coherence helps. This establishes coherence as a resource that quantifies the performance of phase estimation, and, thus, of any quantum technology relying on it as a subroutine.
Quantum algorithms solve certain computational problems faster than the best known classical algorithms. Many algorithms, including Shor's for factoring, Grover's for unstructured search, and the HHL for solving linear systems, rely on quantum phase estimation (QPE) as a fundamental subroutine. The QPE protocol proceeds through the initialization of a control register in a uniform superposition, controlled unitary evolution encoding the eigenphase, and a final inverse quantum Fourier transform followed by measurement to extract the phase. Here, we address a special class of unitary operators that frequently appear in quantum Fourier transform-based protocols, cyclic group representations, and periodically evolving quantum systems. We introduce a QPE algorithm that successfully reduces the circuit complexity from O(n2) to O(n) for a special class of unitary operators and implement it on a four-qubit photonic system. The four-qubit system is realised using a photon pair, with two qubits encoded in its polarization degree of freedom and the remaining two in its path modes. In contrast to previous photonic implementations of QPE based on dual-rail encoding and KLM protocol, where controlled operations are inherently probabilistic and thus reduce the overall success probability of phase estimation, our scheme is fully deterministic. Moreover, it is scalable to higher-dimensional unitaries, provided the underlying structure of the unitaries is preserved.