SearcharxivSearch

arXiv · 2510.23996

Nonreciprocity enhanced Quantum Gyroscopes based on Surface Acoustic Waves

Abstract

Surface acoustic waves (SAWs), as Rayleigh waves generated by elastic media, have been used in gyroscopes for over 40 years due to their unique propagation characteristics. However, their working principle, based on Coriolis effects, has become increasingly ineffective for addressing modern sensing challenges in complex scenarios. Fortunately, recent advancements in quantized SAWs offer a promising solution: SAWs operating at extremely low pump powers (approximately at the single-phonon level) can exhibit substantial quantum coherence, enabling investigations into the fundamental limits of SAW gyroscopes as constrained by the Heisenberg uncertainty relation. In particular, when multiple SAWs couple to a common waveguide at distinct locations, the nonlocality arising from the spatial separation among coupling points induces directional coupling between the SAWs. To elucidate this directionality, we propose a quantum gyroscope characterized by multiplepoint couplings. Unlike traditional single-point coupling designs, our gyroscope exhibits distinctive time-delayed dynamics that depend on the system's topologies. We emphasize that these dynamics invalidate the Markovian approximation, even when the time delay is relatively small. Through a comprehensive analysis of all possible topologies, we observe that the directional coupling implies an inherent nonreciprocal transfer. This nonreciprocity confers signiffcant advantages to our gyroscope compared to traditional designs, notably enhancing both the signal-to-noise ratio and sensitivity. Speciffcally, it enables the extraction of output signals that would otherwise be obscured by noise. Consequently, our ffndings suggest that systems with multiple-point couplings and the associated nonreciprocity can serve as valuable resources for advancing quantum sensing technologies.

Explore related subjects

Keep this discovery

BibTeXRIS

Y. T. Zhu, Shibei Xue, Fangfang Ju, Haidong Yuan. 2025-10-28. Nonreciprocity enhanced Quantum Gyroscopes based on Surface Acoustic Waves. https://doi.org/10.1103/n52d-dr86

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph