Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2104.02064

Incompatible observables in classical physics: A closer look at measurement in Hamiltonian mechanics

David Theurel
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum theory famously entails the existence of incompatible measurements; pairs of observables which cannot be simultaneously measured to arbitrary precision. Incompatibility is widely regarded to be a uniquely quantum phenomenon, linked to failure to commute of quantum operators. Even in the face of deep parallels between quantum commutators and classical Poisson brackets, no connection has been established between the Poisson algebra and any intrinsic limitations to classical measurement. Here I examine measurement in classical Hamiltonian physics as a process involving the joint evolution of an object-system and a finite-temperature measuring apparatus. Instead of the ideal measurement capable of extracting information without disturbing the system, I find a Heisenberg-like precision-disturbance relation: Measuring an observable leaves all Poisson-commuting observables undisturbed but inevitably disturbs all non-Poisson-commuting observables. In this relation the role of h-bar is played by an apparatus-specific quantity, q-bar. While not a universal constant, q-bar takes a finite positive value for any apparatus that can be built. I show that a classical version of Ozawa's model of quantum measurement, originally proposed as a means to violate the Heisenberg relation, does not violate the classical relation. Hence, incompatibility may prove to be a feature not only of quantum, but of classical physics too. This approach points the way to studying the Bayesian epistemology of classical physics, which was until now assumed to be trivial. It now seems possible that it is non-trivial and bears a resemblance to the quantum formalism. These findings may be of interest to researchers working on foundations of quantum mechanics, particularly for psi-epistemic interpretations. And there may be applications in the fields of precision measurement, nanoengineering and molecular machines.

Explore related subjects

quant-phcond-mat.stat-mech

Keep this discovery

BibTeXRIS

David Theurel. 2021-04-05. Incompatible observables in classical physics: A closer look at measurement in Hamiltonian mechanics. https://doi.org/10.1103/physreve.110.024124

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↗