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

Fast algorithms for large scale quantum transport simulations with applications

King Tai Cheung

Published Jan 1, 2017• 0 citations
Publisher
DOI
10.5353/th_991044014361303414

Related papers

A fast, large-scale optimal transport algorithm for holographic beam shaping

Andrii Torchylo, Hunter Swan, Lucas Tellez +1 more

Optimal transport methods have recently established state of the art accuracy and efficiency for holographic laser beam shaping. However, use of such methods is hindered by severe $\mathcal{O}(N^2)$ memory and $\mathcal{O}(N^2)$ time requirements for large scale input or output images with $N$ total pixels. Here we leverage the dual formulation of the optimal transport problem and the separable structure of the cost to implement algorithms with greatly reduced $\mathcal{O}(N)$ memory and $\mathcal{O}(N\log N)$ to $\mathcal{O}(N^{3/2})$ time complexity. These algorithms are parallelizable and can solve megapixel-scale beam shaping problems in tens of seconds on a CPU or seconds on a GPU.

physics.opticsCross-listedarXiv:2512.19072•Dec 23, 2025

Numerical Algorithms for Time-Resolved Quantum Transport

Joseph Weston

Springer theses•Jan 1, 2017•1 citation

Fast simulation of Grover's quantum search on classical computer

Ayan Chattopadhyay, Menon, Vikram

The research community has been actively working on the realization of quantum computer. But the large scale commercial quantum computers are not a reality yet quantum computing field has become richer by day with the advent of algorithms and the avenue of its application in multiple domains. Availability of efficient quantum simulators will enable the researchers to quickly verify their results and concepts in order to establish a working proof of correctness. One important algorithm that has become one of the basic ingredients to build other algorithms and models is the Grover's search Algorithm which is known to be the most compute intensive. Our approach highlights the design principles for the fast simulation of Grover's search which can be implemented on a general purpose personal computer. The performance obtained are encouraging when compared to the existing simulators.

arXiv:2005.04635•May 10, 2020•3 citations

Optical transport of cold atoms to quantum degeneracy

Yanqing Tao, Yufei Wang, Ligeng Yu +1 more

Efficient transport of cold atoms is essential for continuous operation, enabling applications ranging from atomic lasers to continuously operated qubits. However, deep potentials required to overcome vibrations, axial trap nonuniformity and insufficient cooling have limited transport of cold atoms near quantum degeneracy. Here we demonstrate rapid optical transport of cold atoms to Bose-Einstein condensation using a moving optical lattice formed by two Bessel beams. A gas of $3 \times 10^5$ ytterbium atoms at a temperature of $340\,$nK is transported over $34\,$cm in $350\,$ms with efficiency over $60\%$. Furthermore, a degenerate gas of $1 \times 10^5$ atoms with a $40\%$ condensate fraction emerges from the phase synchronization process driven by atomic interactions. This demonstration enables the fast preparation of ultracold atomic beams and large-scale atom arrays for quantum sensing, simulation and computing.

cond-mat.quant-gasCross-listedarXiv:2602.14249•Feb 17, 2026•1 citation

High-Speed Algorithm for Quantum Monte Carlo Simulation

Yutaka Okabe, Macoto Kikuchi

Springer series in solid-state sciences•Jan 1, 1987•0 citations

Numerical study of quantum transport phenomena

Tsuneya Ando, 安藤 恒也

•Jan 1, 1999•0 citations
Optimal transport methods have recently established state of the art accuracy and efficiency for holographic laser beam shaping. However, use of such methods is hindered by severe O(N2)\mathcal{O}(N^2)O(N2) memory and O(N2)\mathcal{O}(N^2)O(N2) time requirements for large scale input or output images with NNN total pixels. Here we leverage the dual formulation of the optimal transport problem and the separable structure of the cost to implement algorithms with greatly reduced O(N)\mathcal{O}(N)O(N) memory and O(Nlog⁡N)\mathcal{O}(N\log N)O(NlogN) to O(N3/2)\mathcal{O}(N^{3/2})O(N3/2) time complexity. These algorithms are parallelizable and can solve megapixel-scale beam shaping problems in tens of seconds on a CPU or seconds on a GPU.
The research community has been actively working on the realization of quantum computer. But the large scale commercial quantum computers are not a reality yet quantum computing field has become richer by day with the advent of algorithms and the avenue of its application in multiple domains. Availability of efficient quantum simulators will enable the researchers to quickly verify their results and concepts in order to establish a working proof of correctness. One important algorithm that has become one of the basic ingredients to build other algorithms and models is the Grover's search Algorithm which is known to be the most compute intensive. Our approach highlights the design principles for the fast simulation of Grover's search which can be implemented on a general purpose personal computer. The performance obtained are encouraging when compared to the existing simulators.
Efficient transport of cold atoms is essential for continuous operation, enabling applications ranging from atomic lasers to continuously operated qubits. However, deep potentials required to overcome vibrations, axial trap nonuniformity and insufficient cooling have limited transport of cold atoms near quantum degeneracy. Here we demonstrate rapid optical transport of cold atoms to Bose-Einstein condensation using a moving optical lattice formed by two Bessel beams. A gas of 3×1053 \times 10^53×105 ytterbium atoms at a temperature of 340 340\,340nK is transported over 34 34\,34cm in 350 350\,350ms with efficiency over 60%60\%60%. Furthermore, a degenerate gas of 1×1051 \times 10^51×105 atoms with a 40%40\%40% condensate fraction emerges from the phase synchronization process driven by atomic interactions. This demonstration enables the fast preparation of ultracold atomic beams and large-scale atom arrays for quantum sensing, simulation and computing.