Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1410.1492

Vacuum Casimir energy densities and field divergences at boundaries

Nicola Bartolo·Salvatore Butera·Margherita Lattuca·Roberto Passante·Lucia Rizzuto·Salvatore Spagnolo
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider and review the emergence of singular energy densities and field fluctuations at sharp boundaries or point-like field sources in the vacuum. The presence of singular energy densities of a field may be relevant from a conceptual point of view, because they contribute to the self-energy of the system. They should also generate significant gravitational effects. We first consider the case of the interface between a metallic boundary and the vacuum, and obtain the structure of the singular electric and magnetic energy densities at the interface through an appropriate limit from a dielectric to an ideal conductor. Then, we consider the case of a point-like source of the electromagnetic field, and show that also in this case the electric and magnetic energy densities show a singular structure at the source position. We discuss how, in both cases, these singularities give an essential contribution to the electromagnetic self-energy of the system; moreover, they solve an apparent inconsistency between the space integral of the field energy density and the average value of the field Hamiltonian. The singular behavior we find is softened, or even eliminated, for boundaries fluctuating in space and for extended field sources. We discuss in detail the case in which a reflecting boundary is not fixed in space but is allowed to move around an equilibrium position, under the effect of quantum fluctuations of its position. Specifically, we consider the simple case of a one-dimensional massless scalar field in a cavity with one fixed and one mobile wall described quantum-mechanically. We investigate how the possible motion of the wall changes the vacuum fluctuations and the energy density of the field, compared with the fixed-wall case. Also, we explicitly show how the fluctuating motion of the wall smears out the singular behaviour of the field energy density at the boundary.

Explore related subjects

quant-phhep-th

Keep this discovery

BibTeXRIS

Nicola Bartolo, Salvatore Butera, Margherita Lattuca, Roberto Passante, Lucia Rizzuto, Salvatore Spagnolo. 2014-10-06. Vacuum Casimir energy densities and field divergences at boundaries. https://doi.org/10.1088/0953-8984%2F27%2F21%2F214015

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↗