SearcharxivSearch

arXiv · 2504.13029

Three-dimensional canonical quantum plasmonics for finite media: exact solution in terms of the classical Green tensor

Abstract

This article presents a comprehensive three-dimensional canonical quantization to treat quantum plasmonics for finite metallic or dielectric media of arbitrary shape. We use a microscopic model for the dissipative and dispersive medium coupled with the electromagnetic field, which is justified by the fact that if one integrates the degrees of freedom of the medium, one obtains the macroscopic Maxwell equations. Its quantization features a Hamiltonian formulation having the form of two infinite harmonic oscillators characterized by a double continuum. The diagonalized Hamiltonian is quantized by the correspondence principle, introducing creation-annihilation operators in a bosonic Fock space. The diagonal quantum Hamiltonian is the sum of two terms corresponding to the two continua. The physical observables, like, e.g., the electric field, are also the sum of two terms corresponding to the two continua, one of which had been omitted in the literature geared for an infinite bulk medium. In a second step, we show that the electric field operator can by written as linear combinations of the creation-annihilation operators with coefficients that satisfy integral equations of Fredholm type. We show that the solution of these equations can be expressed in terms of the classical Green tensor of the medium satisfying the Sommerfeld radiation condition. Finally, we consider the Purcell effect for the spontaneous emission of an atom close to the medium. We show that through an exact compensation of some terms, the Purcell factor for the system with the double continuum is proportional to the imaginary part of the Green tensor, which defines the local density of states. This result has the same form as the one obtained in the literature for bulk systems that involve a single continuum and a small dissipative background extending to infinity, and can be seen as a justification of this approach.

Explore related subjects

Keep this discovery

BibTeXRIS

Georgii Semin, Hans-Rudolf Jauslin, Stephane Guerin. 2025-04-17. Three-dimensional canonical quantum plasmonics for finite media: exact solution in terms of the classical Green tensor. https://arxiv.org/abs/2504.13029

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