SearcharxivSearch

arXiv · 0911.2736

Electromagnetic Energy, Absorption, and Casimir Forces. I. Uniform Dielectric Media in Thermal Equilibrium

Abstract

The derivation of Casimir forces between dielectrics can be simplified by ignoring absorption, calculating energy changes due to displacements of the dielectrics, and only then admitting absorption by allowing permittivities to be complex. As a first step towards a better understanding of this situation we consider in this paper the model of a dielectric as a collection of oscillators, each of which is coupled to a reservoir giving rise to damping and Langevin forces on the oscillators and a noise polarization acting as a source of a fluctuating electromagnetic (EM) field in the dielectric. The model leads naturally to expressions for the quantized EM fields that are consistent with those obtained by different approaches, and also results in a fluctuation-dissipation relation between the noise polarization and the imaginary part of the permittivity; comparison with the Rytov fluctuation-dissipation relation employed in the well-known Lifshitz theory for the van der Waals (or Casimir) force shows that the Lifshitz theory is actually a classical stochastic electrodynamical theory. The approximate classical expression for the energy density in a band of frequencies at which absorption in a dielectric is negligible is shown to be exact as a spectral thermal equilibrium expectation value in the quantum-electrodynamical theory. Our main result is the derivation of an expression for the QED energy density of a uniform dispersive, absorbing media in thermal equilibrium. The spectral density of the energy is found to have the same form with or without absorption. We also show how the fluctuation-dissipation theorem ensures a detailed balance of energy exchange between the (absorbing) medium, the reservoir and the EM field in thermal equilibrium.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F. S. S. Rosa, D. A. R. Dalvit, P. W. Milonni. 2009-11-14. Electromagnetic Energy, Absorption, and Casimir Forces. I. Uniform Dielectric Media in Thermal Equilibrium. https://doi.org/10.1103/physreva.81.033812

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