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

Computer Physics Communications

A Toolkit for solving the Optical Bloch Rate Equations in alkali metal atoms based on the QuantumOptics.jl package in Julia

Dace Osite, Marcis P. Auzinsh, Laima Busaite, F. Gahbauer, Arturs Mozers

Published May 16, 2025• 1 citation
Publisher
DOI
10.1016/j.cpc.2025.109678

Related papers

A Toolkit for Solving the Optical Bloch Equations in Alkali Metal Atoms Based on the Quantumoptics.Jl Package in Julia

Dace Osite, Marcis P. Auzinsh, Laima Busaite +2 more

•Jan 1, 2024•0 citations

QuantumOptics.jl: A Julia framework for simulating open quantum systems

Sebastian Krämer, David Plankensteiner, Laurin Ostermann +1 more

arXiv:1707.01060•Computer Physics Communications•Feb 17, 2018•209 citations

Kinetic equations for optical pumping of alkali metal atoms with large hyperfine structure of the excited states

E. I. Dashevskaya

Optics and Spectroscopy•Oct 1, 1980•0 citations

QAOA.jl: Toolkit for the Quantum and Mean-Field Approximate Optimization Algorithms

Tim Bode, Dmitry Bagrets, Aditi Misra-Spieldenner +2 more

Quantum algorithms are an area of intensive research thanks to their potential for speeding up certain specific tasks exponentially.However, for the time being, high error rates on the existing hardware realizations preclude the application of many algorithms that are based on the assumption of fault-tolerant quantum computation.On such noisy intermediatescale quantum (NISQ) devices (Preskill, 2018), the exploration of the potential of heuristic quantum algorithms has attracted much interest.A leading candidate for solving combinatorial optimization problems is the so-called Quantum Approximate Optimization Algorithm (QAOA) (Farhi et al., 2014).QAOA.jl is a Julia package (Bezanson et al., 2017) that implements the mean-field Approximate Optimization Algorithm (mean-field AOA) (Misra-Spieldenner et al., 2023) -a quantum-inspired classical algorithm derived from the QAOA via the mean-field approximation.This novel algorithm is useful in assisting the search for quantum advantage by providing a tool to discriminate (combinatorial) optimization problems that can be solved classically from those that cannot.Note that QAOA.jl has already been used during the research leading to Misra-Spieldenner et al. (2023).

The Journal of Open Source Software•Jun 28, 2023•2 citations

Tools for quantum simulation with ultracold atoms in optical lattices

Florian Schäfer, Takeshi Fukuhara, Seiji Sugawa +2 more

arXiv:2006.06120•Nature Reviews Physics•Jul 1, 2020•486 citations

Rimu.jl: Random integrators for many-body quantum systems

Matija Čufar, C. J. Bradly, Ray Yang +2 more

Rimu$.$jl is a Julia package for solving many-body quantum problems. The core of the package is a matrix-free implementation of Hamiltonians and other operators and compact representation of Fock states, which together allow for efficient methods suitable for high-performance computing. Rimu$.$jl includes a Julia implementation of the full configuration interaction quantum Monte Carlo (FCIQMC) algorithm which is a type of projector QMC algorithm for stochastically solving the time-independent Schrödinger equation. It also includes many well-known model Hamiltonians, and an interface for exact diagonalisation based on external eigenvalue solvers. Both the stochastic and exact diagonalisation methods are accessed with a CommonSolve$.$jl interface. We describe the FCIQMC algorithm and how to obtain estimators of observables as well as the key features of the implementation.

arXiv:2601.19505•Jan 27, 2026•0 citations
Quantum algorithms are an area of intensive research thanks to their potential for speeding up certain specific tasks exponentially.However, for the time being, high error rates on the existing hardware realizations preclude the application of many algorithms that are based on the assumption of fault-tolerant quantum computation.On such noisy intermediatescale quantum (NISQ) devices (Preskill, 2018), the exploration of the potential of heuristic quantum algorithms has attracted much interest.A leading candidate for solving combinatorial optimization problems is the so-called Quantum Approximate Optimization Algorithm (QAOA) (Farhi et al., 2014).QAOA.jl is a Julia package (Bezanson et al., 2017) that implements the mean-field Approximate Optimization Algorithm (mean-field AOA) (Misra-Spieldenner et al., 2023) -a quantum-inspired classical algorithm derived from the QAOA via the mean-field approximation.This novel algorithm is useful in assisting the search for quantum advantage by providing a tool to discriminate (combinatorial) optimization problems that can be solved classically from those that cannot.Note that QAOA.jl has already been used during the research leading to Misra-Spieldenner et al. (2023).
Rimu...jl is a Julia package for solving many-body quantum problems. The core of the package is a matrix-free implementation of Hamiltonians and other operators and compact representation of Fock states, which together allow for efficient methods suitable for high-performance computing. Rimu...jl includes a Julia implementation of the full configuration interaction quantum Monte Carlo (FCIQMC) algorithm which is a type of projector QMC algorithm for stochastically solving the time-independent Schrödinger equation. It also includes many well-known model Hamiltonians, and an interface for exact diagonalisation based on external eigenvalue solvers. Both the stochastic and exact diagonalisation methods are accessed with a CommonSolve...jl interface. We describe the FCIQMC algorithm and how to obtain estimators of observables as well as the key features of the implementation.