SearcharxivSearch

arXiv · 2607.16988

How many degrees of freedom describe a quantum N-particle state?

Abstract

In Newtonian spacetime, the canonical description of a classical $N$-particle system requires $3N$ degrees of freedom. Not all of these are physical, however, since the conservation of the net momentum implies that only $3(N-1)$ accelerations are independent. Hence, three constraints can be used to eliminate the unphysical centre-of-mass variables, at the level of the Lagrangian, leaving only the subset of observable displacements and momenta, which are relational. Imposing the constraints does not change the dynamics of these variables, at the classical level, and is analogous to a gauge-fixing procedure, which removes redundancy in the description of the system. In classical physics, therefore, the number of physical degrees of freedom equals the number of independent relational degrees of freedom. Here, we show that this is not the case in quantum mechanics. While an operator-analogue of the classical net momentum exists, it cannot be used to impose constraints that restrict the degrees of freedom in the theory, without a loss of physical information. This means that all $3N$ canonical degrees of freedom are physical, even though only $3(N-1)$ of them are relational. We explore the physical consequences of the non-relational variables and show that they give rise to generalised uncertainty relations (GURs), for the relational quantities that define the quantum reference frame (QRF). Hence, it is shown that the non-relational degrees of freedom refer to the frame itself and that the non-Heisenberg terms in the GURs define its Galilean-invariant spreads, in both real space and momentum space. The implications of this result for recent work on relational models, including the ``perspective neutral'' framework for QRFs, are discussed. Its implications for the wider relational program, and, in particular, the relevance of the latter to quantum gravity research, are also critically assessed

Explore related subjects

Keep this discovery

BibTeXRIS

Matthew J. Lake, Marek L. Miller. 2026-07-18. How many degrees of freedom describe a quantum N-particle state?. https://arxiv.org/abs/2607.16988

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