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.
Bosonic "cat qubits" encoded in superpositions of well-separated coherent states |+a⟩ and |-a⟩ are attractive for quantum error correction because single-photon loss acts as a phase-flip error while the dominant, hardware-limiting bit-flip error is suppressed exponentially in the mean photon number |a|². We ask whether an analogous noise bias can be engineered using the orbital angular momentum (OAM) of light instead of its amplitude, encoding a qubit in a superposition of two well-separated OAM eigenstates |+L⟩ and |-L⟩. We model the dominant OAM channel noise—local mode-mixing induced by fiber imperfections or wavefront aberrations, which couples only adjacent topological charges (Δl = ±1)—as a continuous-time random walk on the integers. We define an operational experimental protocol to extract the channel hopping rate directly from the linear spatial growth of the OAM variance Var(l) = γz. We show analytically and numerically that this local, nearest-neighbor character converts almost all population leakage out of the code space into a detectable erasure, while the probability of an undetected logical bit-flip is suppressed as exp(-2L² / γz), a direct structural analog of the exp(-2|a|²) bias of amplitude-phase cat qubits. This revised version (v2) corrects the erasure-probability expression using an exact closed form (Skellam/Bessel identity), adds an explicit resource-overhead analysis quantifying the repetition cost of the scheme, and discusses the impact of a mode-dependent hopping rate γ(l) on the achievable suppression. We argue that periodic syndrome extraction using existing phase-locked OAM mode sorters could realize the required error-detection step without a dedicated nonlinear dissipative stabilizer. ---Keywords: Quantum Error Correction, Cat Qubits, Orbital Angular Momentum (OAM), Noise Bias, Erasure Channel, Random Walk, Frugal Quantum Hardware, Open Science.Repository contents: Includes manuscript PDF and full Python simulation package (NumPy/SciPy/Matplotlib).
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.