Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.10738

Nonclassical photon statistics in two-tone continuously driven optomechanics

K. Borkje·F. Massel·J. G. E. Harris
View original source ↗Read source document ↗Export metadata ↓

Abstract

In cavity optomechanics, single photon detection of Raman scattered photons can be a useful tool for observing nonclassical features of both radiation and motion. While this tool has been employed in experiments with pulsed laser driving of a cavity mode, it has not been readily accessible to experiments with continuous and constant laser driving. To address this, we present a study of a standard optomechanical system where the cavity mode is continuously driven at two different frequencies, and where sideband photons are detected by single photon detectors after frequency filtering the output from the cavity mode around its resonance frequency. We first derive the normalized second order coherence associated with the detected photons, and show that it contains signatures of the quantum nature of the mechanical mode which would be absent with only single-tone driving. To identify model-independent nonclassical features, we derive two inequalities for the sideband photon statistics that should be valid in any classical model of the system. We show that these inequalities are violated in the proposed setup. This is provided that the average phonon occupation number of the mechanical mode is sufficiently small, which in principle can be achieved through sideband cooling intrinsic to the setup. Violation of the first inequality means that there is no well-defined probability distribution of the Glauber-Sudarshan type for the cavity mode. In contrast, a violation of the second inequality means that there is no joint probability distribution for the cavity mode at two times separated by a finite interval, which originates from the noncommutativity of the motional quadratures of the mechanical mode. The proposed setup thus employs a mechanical oscillator in order to generate a steady-state source of nonclassical radiation.

Explore related subjects

quant-phphysics.optics

Keep this discovery

BibTeXRIS

K. Borkje, F. Massel, J. G. E. Harris. 2021-08-24. Nonclassical photon statistics in two-tone continuously driven optomechanics. https://doi.org/10.1103/physreva.104.063507

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗