Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1101.5222

The auxiliary field method in quantum mechanics

Bernard Silvestre-Brac·Claude Semay·Fabien Buisseret
View original source ↗Read source document ↗Export metadata ↓

Abstract

The auxiliary field method is a new technique to obtain closed formulae for the solutions of eigenequations in quantum mechanics. The idea is to replace a Hamiltonian $H$ for which analytical solutions are not known by another one $\tilde H$, including one or more auxiliary fields. For instance, a potential $V(r)$ not solvable is replaced by another one $P(r)$ more familiar, or a semirelativistic kinetic part is replaced by an equivalent nonrelativistic one. The approximation comes from the replacement of the auxiliary fields by pure real constants. The approximant solutions for $H$, eigenvalues and eigenfunctions, are then obtained by the solutions of $\tilde H$ in which the auxiliary parameters are eliminated by an extremization procedure for the eigenenergies. If $H=T(\bm p)+V(r)$ and if $P(r)$ is a power law, the approximate eigenvalues can be written $T(p_0)+V(r_0)$, where the mean impulsion $p_0$ is a function of the mean distance $r_0$ and where $r_0$ is determined by an equation which is linked to the generalized virial theorem. The general properties of the method are studied and the connections with the envelope theory presented. This method is first applied to nonrelativistic and semirelativistic two-body systems, with a great variety of potentials. Closed formulae are produced for energies, eigenstates, various observables and critical constants, with sometimes a very good accuracy. The method is then used to solve nonrelativistic and semirelativistic many-body systems with one-body and two-body interactions. For such cases, analytical solutions can only be obtained for systems of identical particles, but several systems of interest for atomic and hadronic physics are studied. General results concerning the many-body critical constants are presented, as well as duality relations existing between approximate and exact eigenvalues.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Bernard Silvestre-Brac, Claude Semay, Fabien Buisseret. 2012-06-20. The auxiliary field method in quantum mechanics. https://doi.org/10.4303/jpm%2Fp120601

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↗