Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Topics in current physics

Few- and Many-Fermion Problems

Kevin E. Schmidt, Malvin H. Kalos

Published Jan 1, 1987• 11 citations
Publisher
DOI
10.1007/978-3-642-51703-7_4

Related papers

Few-and Many-Fermion Problems

Kevin E. Schmidt, Malvin H. Kalos

Topics in current physics•Jan 1, 1984•54 citations

Few- and Many-Fermion Problems (With 7 Figures)

Kevin E. Schmidt, Malvin H. Kalos

•Jan 1, 1984•0 citations

Few-cluster solutions of many-fermion problem

I. A. Gnilozub, Sergei Kurgalin, Yu. M. Tchuvil’sky

Nuclear Physics A•Jun 1, 2007•5 citations

Recent Advances in Description of Few Two-Component Fermions

O. I. Kartavtsev, A. V. Malykh

Overview of the recent advances in description of the few two-component fermions is presented. The model of zero-range interaction is generally considered to discuss the principal aspects of the few-body dynamics. Particular attention is paid to detailed description of two identical fermions of mass $m$ and a distinct particle of mass $m_1$: it turns out that two $L^P = 1^-$ three-body bound states emerge if mass ratio $m/m_1$ increases up to the critical value $μ_c \approx 13.607$, above which the Efimov effect takes place. The topics considered include rigorous treatment of the few-fermion problem in the zero-range interaction limit, low-dimensional results, the four-body energy spectrum, crossover of the energy spectra for $m/m_1$ near $μ_c $, and properties of potential-dependent states. At last, enlisted are the problems, whose solution is in due course.

arXiv:1211.5557•Ядерная физика•Jan 1, 2014•4 citations

A Solution to the Sign Problem Using a Sum of Controlled Few-Fermions

Wei, David H.

A restricted path integral method is proposed to simulate a type of quantum system or Hamiltonian called a sum of controlled few-fermions on a classical computer using Monte Carlo without a numerical sign problem. Then a universality is proven to assert that any bounded-error quantum polynomial time (BQP) algorithm can be encoded into a sum of controlled few-fermions and simulated efficiently using classical Monte Carlo. Therefore, BQP is precisely the same as the class of bounded-error probabilistic polynomial time (BPP), namely, BPP = BQP.

arXiv:2208.13744•Jun 8, 2022•0 citations

The Many-Fermion Problem

WORLD SCIENTIFIC eBooks•Mar 1, 1993•0 citations
Overview of the recent advances in description of the few two-component fermions is presented. The model of zero-range interaction is generally considered to discuss the principal aspects of the few-body dynamics. Particular attention is paid to detailed description of two identical fermions of mass mmm and a distinct particle of mass m1m_1m1​: it turns out that two LP=1−L^P = 1^-LP=1− three-body bound states emerge if mass ratio m/m1m/m_1m/m1​ increases up to the critical value μc≈13.607μ_c \approx 13.607μc​≈13.607, above which the Efimov effect takes place. The topics considered include rigorous treatment of the few-fermion problem in the zero-range interaction limit, low-dimensional results, the four-body energy spectrum, crossover of the energy spectra for m/m1m/m_1m/m1​ near $μ_c $, and properties of potential-dependent states. At last, enlisted are the problems, whose solution is in due course.
A restricted path integral method is proposed to simulate a type of quantum system or Hamiltonian called a sum of controlled few-fermions on a classical computer using Monte Carlo without a numerical sign problem. Then a universality is proven to assert that any bounded-error quantum polynomial time (BQP) algorithm can be encoded into a sum of controlled few-fermions and simulated efficiently using classical Monte Carlo. Therefore, BQP is precisely the same as the class of bounded-error probabilistic polynomial time (BPP), namely, BPP = BQP.