SearcharxivSearch

arXiv · 2207.01521

Quantum particle in a spherical well confined by a cone

Abstract

We consider the quantum problem of a particle in either a spherical box or a finite spherical well confined by a circular cone with an apex angle $2\theta_0$ emanating from the center of the sphere, with $0<\theta_0<\pi$. This non-central potential can be solved by an extension of techniques used in spherically-symmetric problems. The angular parts of the eigenstates depend on azimuthal angle $\varphi$ and polar angle $\theta$ as $P_\lambda^m(\cos\theta){\rm e}^{im\varphi}$ where $P_\lambda^m$ is the associated Legendre function of integer order $m$ and (usually noninteger) degree $\lambda$. There is an infinite discrete set of values $\lambda=\lambda_i^m$ ($i=0,1,3,\dots$) that depend on $m$ and $\theta_0$. Each $\lambda_i^m$ has an infinite sequence of eigenenergies $E_n(\lambda_i^m)$, with corresponding radial parts of eigenfunctions. In a spherical box the discrete energy spectrum is determined by the zeros of the spherical Bessel functions. For several $\theta_0$ we demonstrate the validity of Weyl's continuous estimate ${\cal N}_W$ for the exact number of states $\cal N$ up to energy $E$, and evaluate the fluctuations of $\cal N$ around ${\cal N}_W$. We examine the behavior of bound states in a well of finite depth $U_0$, and find the critical value $U_c(\theta_0)$ when all bound states disappear. The radial part of the zero energy eigenstate outside the well is $1/r^{\lambda+1}$, which is not square-integrable for $\lambda\le 1/2$. ($0<\lambda\le 1/2$ can appear for $\theta_0>\theta_c\approx 0.726\pi$ and has no parallel in spherically-symmetric potentials.) Bound states have spatial extent $\xi$ which diverges as a (possibly $\lambda$-dependent) power law as $U_0$ approaches the value where the eigenenergy of that state vanishes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raz Halifa Levi, Yacov Kantor. 2022-07-04. Quantum particle in a spherical well confined by a cone. https://doi.org/10.1088/2399-6528%2Fac6bdc

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