Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · quant-ph/9907012

Rotation Representations and e, $pi$, p Masses

Richard Shurtleff
View original source ↗Read source document ↗Export metadata ↓

Abstract

Mass is proportional to phase gain per unit time; for e, $π$, and p the quantum frequencies are 0.124, 32.6, and 227 Zhz, respectively. By explaining how these particles acquire phase at different rates, we explain why these particles have different masses. Any free particle spin 1/2 wave function is a sum of plane waves with spin parallel to velocity. Each plane wave, a pair of 2-component rotation eigenvectors, can be associated with a 2x2 matrix representation of rotations in a Euclidean space without disturbing the plane wave's space-time properties. In a space with more than four dimensions, only rotations in a 4d subspace can be represented. So far all is well known. Now consider that unrepresented rotations do not have eigenvectors, do not make plane waves, and do not contribute phase. The particles e, $π,$ and p are assigned rotations in a 4d subspace of 16d, rotations in an 8d subspace of 12d, and rotations in a 12d subspace of 12d, respectively. The electron 4d subspace, assumed to be as likely to align with any one 4d subspace as with any other, produces phase when aligned with the represented 4d subspace in 16d. Similarly, we calculate the likelihood that a 4d subspace of the pion's 8d space aligns with the represented 4d subspace in 12d. The represented 4d subspace is contained in the proton's 12d space, so the proton always acquires phase. By the relationship between mass and phase, the resulting particle phase ratios are the particle mass ratios and these are coincident with the measured mass ratios, within about one percent. 1999 PACS number(s): 03.65.Fd Keywords:Algebraic methods; particle masses; rotation group

Explore related subjects

quant-phhep-ph

Keep this discovery

BibTeXRIS

Richard Shurtleff. 1999-07-05. Rotation Representations and e, $pi$, p Masses. https://arxiv.org/abs/quant-ph/9907012

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↗