SearcharxivSearch

arXiv · 1706.07788

Spatial statistics of single-quantum detection

Abstract

In a single-particle detection experiment, a wavefront impinges on a detector but observers only see a point response. The extent of the wavefront becomes evident only in statistical accumulation of many independent detections, with probability given by the Born rule. Drawing on concepts from quantum optics, we analyze a simple model to reverse-engineer how this behavior can come about in terms of wave mechanics alone without a measurement axiom. The model detector consists of many molecules, each of which can be resonantly excited by the incoming particle and then emit a detection signature (e.g., localized flash of light). Different molecules have different resonant energies because local conditions (proximity of other molecules, Doppler shifts, etc.) vary. The detector is thus a quasi-continuum, and the incoming particle preferentially excites the molecule that it matches most closely in energy. (In actuality, molecules can be so numerous that many could closely match the incoming particle in energy; but in that case only one will be the first, and there will be nothing left for the others by the time the first match resonates and then emits. The model does not explicitly take into account the temporal advance of the particle wave packet through the detector medium.) The excited molecule can emit a detection signature, but that process competes with fluctuation-driven dephasing. We estimate the probability that a given molecule is resonantly excited, and we also estimate the probability that a detection signature is produced before being overwhelmed by fluctuations in the detector medium. The product of these two probabilities is proportional to the absolute-square of the incoming wavefunction at the molecule in question, i.e. the Born rule. We discuss ways to probe these mechanisms experimentally, and check the model with numbers from a neutron interference experiment.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonathan F. Schonfeld. 2017-06-20. Spatial statistics of single-quantum detection. https://arxiv.org/abs/1706.07788

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