Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · quant-ph/0103103

Michelson interferometer operating at effects of first order with respect to v/c

V. V. Demjanov
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the first version of this paper (arXiv: 1003.2899v1, 15.03.2010) there is described first, traditional method of measuring the non-zero shift of interference fringe in the Michelson interferometer, operating on the effects of second order with respect to v/c, and are revealed hidden causes of the failure to measure the shift of interference fringe in the period from 1881 till 1960. It is shown that at the latitude of Obninsk within a 24-hour observation period the horizontal projection of aether wind velocity varies from 140 km/s to 480 km/s. The second version of this paper (arXiv: 1003.2899v2, 15.04.2010) is supplemented with a second method of finding the velocity of the aether wind -- through measuring the largest seasonal decrease in the ratio of the summer shift of the interference fringe to the winter one (equaled ~12%). It gave the same interval of values of the projections of the aether wind velocity as the first method. More than hundred years there persists a belief that Michelson-type interferometer can not be adjusted such as to detect effects of the first order with respect to v/c. Below I show that it is possible, and more successfully than on the interferometer of the second order. In contrast to the traditional approach, in the interferometer of the first order the light after splitting on a semi-transparent plate propagates in both arms to the reflecting mirrors in one optical medium, and returns after reflection from the mirrors through another optical medium. The shift of the interference fringe was found to be proportional to the difference of dielectric permittivities of these media. The horizontal projection of the Earth's velocity relative to luminiferous aether measured by the first order interferometer agrees with that found by the first two methods.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

V. V. Demjanov. 2001-03-17. Michelson interferometer operating at effects of first order with respect to v/c. https://arxiv.org/abs/quant-ph/0103103

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↗