SearcharxivSearch

arXiv · 0909.3068

On the use of the proximity force approximation for deriving limits to short-range gravitational-like interactions from sphere-plane Casimir force experiments

Abstract

We discuss the role of the proximity force approximation in deriving limits to the existence of Yukawian forces - predicted in the submillimeter range by many unification models - from Casimir force experiments using the sphere-plane geometry. Two forms of this approximation are discussed, the first used in most analyses of the residuals from the Casimir force experiments performed so far, and the second recently discussed in this context in R. Decca et al. [Phys. Rev. D 79, 124021 (2009)]. We show that the former form of the proximity force approximation overestimates the expected Yukawa force and that the relative deviation from the exact Yukawa force is of the same order of magnitude, in the realistic experimental settings, as the relative deviation expected between the exact Casimir force and the Casimir force evaluated in the proximity force approximation. This implies both a systematic shift making the actual limits to the Yukawa force weaker than claimed so far, and a degree of uncertainty in the alpha-lambda plane related to the handling of the various approximations used in the theory for both the Casimir and the Yukawa forces. We further argue that the recently discussed form for the proximity force approximation is equivalent, for a geometry made of a generic object interacting with an infinite planar slab, to the usual exact integration of any additive two-body interaction, without any need to invoke approximation schemes. If the planar slab is of finite size, an additional source of systematic error arises due to the breaking of the planar translational invariance of the system, and we finally discuss to what extent this may affect limits obtained on power-law and Yukawa forces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Diego A. R. Dalvit, Roberto Onofrio. 2009-09-16. On the use of the proximity force approximation for deriving limits to short-range gravitational-like interactions from sphere-plane Casimir force experiments. https://doi.org/10.1103/physrevd.80.064025

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