A randomly walking quantum particle searches in Grover’s Θ(√ N) iterations for a marked vertex on the complete graph of N vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a “coin” flip, and hopping. Physically, however, potential energy barriers can hinder the hop and cause the search to fail, even when the amplitude of not hopping decreases with N. We correct for these errors by interpreting the quantum walk search as an amplitude amplification algorithm and modifying the phases applied by the coin flip and oracle such that the amplification recovers the Θ(√ N) runtime.
The principal problem of light amplifiers is to find a means to amplify a coherent amplitude without decreasing the SNR. Consider a signal with amplitude squeezed quantum fluctuations, that is, less noise in the amplitude quadrature than the phase quadrature. The objective is to find a phase sensitive amplifier, which, while amplifying the coherent amplitude, adds quantum noise preferentially to the phase quadrature. We take as a concrete model for the amplifier an intracavity parametric amplifier. We go beyond the usual linear analysis and include the nonlinear regime where pump depletion is important. We find that in the linear region the quantum noise added by the amplification process may be reduced by squeezing the idler mode, while in the nonlinear regime the quantum fluctuations from the pump become more important. These results are of direct application to practical light amplifiers.
The detection and characterization of quantum coherence is of fundamental importance both in the foundations of quantum theory as well as for the rapidly developing field of quantum technologies, where coherence has been linked to quantum advantage. Typical approaches for detecting coherence employ {\it coherence witnesses} -- observable quantities whose expectation value can be used to certify the presence of coherence. By design, coherence witnesses are only able to detect coherence for some, but not all, possible states of a quantum system. In this work we construct protocols capable of detecting the presence of coherence in an {\it unknown} pure quantum state
∣ψ⟩. Having access to
m copies of an unknown pure state
∣ψ⟩ we show that the sample complexity of any experimental procedure for detecting coherence with constant probability of success
≥2/3 is
Θ(c(∣ψ⟩)−1), where
c(∣ψ⟩) is the geometric measure of coherence of
∣ψ⟩. However, assuming access to the unitary
Uψ which prepares the unknown state
∣ψ⟩, and its inverse
Uψ†, we devise a coherence detecting protocol that employs amplitude-amplification {\it a la} Grover, and uses a quadratically smaller number
O(c(∣ψ⟩)−1/2) of samples. Furthermore, by augmenting amplitude amplification with phase estimation we obtain an experimental estimation of upper bounds on the geometric measure of coherence within additive error
ε with a sample complexity that scales as
O(1/ε) as compared to the
O(1/ε2) sample complexity of Monte Carlo estimation methods. The average number of samples needed in our amplitude estimation protocol provides a new operational interpretation for the geometric measure of coherence. Finally, we also derive bounds on the amount of noise our protocols are able to tolerate.