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

Optimization of Many-Fermion Wave Functions on Shared and Distributed Memory Multiprocessors

Brent M. Han

Published Jan 1, 1991• 0 citations
OpenAlex

Related papers

Full optimization of variational wave functions using parallel distributed processing

Ken Kobayashi, C. Ohe, K. Suzuki

Abstracts of the meeting of the Physical Society of Japan. Sectional meeting•Sep 13, 1996•0 citations

Lattice Fermions With Optimized Wave Functions: Exact Results

Józef Spałek, Adam Rycerz, W. Wójcik +1 more

Springer eBooks•Jan 1, 2001•0 citations

Fast Algorithms and Implementations for Computing the Minimum Distance of Quantum Codes

Fernando Hernando, Gregorio Quintana‐Ortí, Markus Grassl

The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code. Our new algorithms are based on the Brouwer–Zimmermann algorithm. Our experimental study shows that these new implementations are much faster than current state-of-the-art licensed implementations on single-core processors, multicore processors, and shared-memory multiprocessors. In the most computationally-demanding cases, the performance gain in the computational time can be larger than one order of magnitude. The experimental study also shows a good scalability on shared-memory parallel architectures.

arXiv:2408.10743•ACM Transactions on Quantum Computing•Feb 6, 2026•2 citations

Monte Carlo methods for the many-fermion problem

Malvin H. Kalos

Physica A Statistical Mechanics and its Applications•Mar 1, 1984•0 citations

BIGSTICK: A flexible configuration-interaction shell-model code (updated)

Calvin W. Johnson, W. E. Ormand, Kenneth McElvain +2 more

We present BIGSTICK, a flexible configuration-interaction open-source shell-model code for the many-fermion problem. Written mostly in Fortran 90 with some later extensions, BIGSTICK utilizes a factorized on-the-fly algorithm for computing many-body matrix elements, and has both MPI (distributed memory) and OpenMP (shared memory) parallelization, and can run on platforms ranging from laptops to the largest parallel supercomputers. It uses a flexible yet efficient many-body truncation scheme, and reads input files in multiple formats, allowing one to tackle both phenomenological (major valence shell space) and ab initio (the so-called no-core shell model) calculations. BIGSTICK can generate energy spectra, static and transition one-body densities, and expectation values of scalar operators. Using the built-in Lanczos algorithm one can compute transition probability distributions and decompose wave functions into components defined by group theory. This manual provides a general guide to compiling and running BIGSTICK, which comes with numerous sample input files, as well as some of the basic theory underlying the code. Updated November 2025 to version 8.0.0

arXiv:1801.08432•Jan 24, 2018•122 citations

A Stochastic Algorithm for Many-Fermion Systems

Douglas J. Scalapino

Springer series in solid-state sciences•Jan 1, 1987•1 citation
The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code. Our new algorithms are based on the Brouwer–Zimmermann algorithm. Our experimental study shows that these new implementations are much faster than current state-of-the-art licensed implementations on single-core processors, multicore processors, and shared-memory multiprocessors. In the most computationally-demanding cases, the performance gain in the computational time can be larger than one order of magnitude. The experimental study also shows a good scalability on shared-memory parallel architectures.
We present BIGSTICK, a flexible configuration-interaction open-source shell-model code for the many-fermion problem. Written mostly in Fortran 90 with some later extensions, BIGSTICK utilizes a factorized on-the-fly algorithm for computing many-body matrix elements, and has both MPI (distributed memory) and OpenMP (shared memory) parallelization, and can run on platforms ranging from laptops to the largest parallel supercomputers. It uses a flexible yet efficient many-body truncation scheme, and reads input files in multiple formats, allowing one to tackle both phenomenological (major valence shell space) and ab initio (the so-called no-core shell model) calculations. BIGSTICK can generate energy spectra, static and transition one-body densities, and expectation values of scalar operators. Using the built-in Lanczos algorithm one can compute transition probability distributions and decompose wave functions into components defined by group theory. This manual provides a general guide to compiling and running BIGSTICK, which comes with numerous sample input files, as well as some of the basic theory underlying the code. Updated November 2025 to version 8.0.0