Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPhase estimation algorithm for the multibeam optical metrology
157
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
We consider the phase sensing via weak optical coherent state at quantum limit precision. A new detection scheme for the phase estimation is proposed which is inspired by the suboptimal quantum measurement in coherent optical communication. We theoretically analyze a performance of our detection scheme, which we call the displaced-photon counting, for phase sensing in terms of the Fisher information and show that the displaced-photon counting outperforms the static homodyne and heterodyne detections in wide range of the target phase. The proof-of-principle experiment is performed with linear optics and a superconducting nanowire single photon detector. The result shows that our scheme overcomes the limit of the ideal homodyne measurement even under practical imperfections.
Quantum states of light can enable sensing configurations with sensitivities beyond the shot-noise limit (SNL). In order to better take advantage of available quantum resources and obtain the maximum possible sensitivity, it is necessary to determine fundamental sensitivity limits for different possible configurations for a given sensing system. Here, due to their wide applicability, we focus on optical resonance sensors, which detect a change in a parameter of interest through a resonance shift. We compare their fundamental sensitivity limits set by the quantum Cramer-Rao bound (QCRB) based on the estimation of changes in transmission or phase of a probing bright two-mode squeezed state (bTMSS) of light. We show that the fundamental sensitivity results from an interplay between the QCRB and the transfer function of the system. As a result, for a resonance sensor with a Lorentzian lineshape a phase-based scheme outperforms a transmission-based one for most of the parameter space; however, this is not the case for lineshapes with steeper slopes, such as higher order Butterworth lineshapes. Furthermore, such an interplay results in conditions under which the phase-based scheme provides a higher sensitivity than the transmission-based one but a smaller degree of quantum enhancement. We also study the effect of losses external to the sensor on the degree of quantum enhancement and show that for certain conditions probing with a classical state can provide a higher sensitivity than probing with a bTMSS. Finally, we discuss detection schemes, namely optimized intensity-difference and optimized homodyne detection, that can achieve the fundamental sensitivity limits even in the presence of external losses.
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum algorithm for finding the roots of nth degree polynomials where n is any positive integer. In classical algorithm, the resources required for solving this problem increase drastically when n increases and it would be impossible to practically solve the problem when n is large. It was found that any polynomial can be rearranged into a corresponding companion matrix, whose eigenvalues are roots of the polynomial. This leads to a possibility to perform a quantum algorithm where the number of computational resources increase as a polynomial of n. In this study, we construct a quantum circuit representing the companion matrix and use eigenvalue estimation technique to find roots of polynomial.
We analyze the properties of a pulsed Coherent Population Trapping protocol that uses a controlled decay from the excited state in a $Lambda$-level scheme. We study this problem analytically and numerically and find regimes where narrow transmission, absorption, or fluorescence spectral lines occur. We then look for optimal frequency measurements using these spectral features by computing the Allan deviation in the presence of ground state decoherence and show that the protocol is on a par with Ramsey-CPT. We discuss possible implementations with ensembles of alkali atoms and single ions and demonstrate that typical pulsed-CPT experiments that are realized on femto-second time-scales can be implemented on micro-seconds time-scales using this scheme.
For two unknown quantum states $rho$ and $sigma$ in an $N$-dimensional Hilbert space, computing their fidelity $F(rho,sigma)$ is a basic problem with many important applications in quantum computing and quantum information, for example verification and characterization of the outputs of a quantum computer, and design and analysis of quantum algorithms. In this Letter, we propose a quantum algorithm that solves this problem in $text{poly}(log (N), r)$ time, where $r$ is the lower rank of $rho$ and $sigma$. This algorithm exhibits an exponential improvement over the best-known algorithm (based on quantum state tomography) in $text{poly}(N, r)$ time.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
