English
Related papers

Related papers: Parallel assembly of arbitrary defect-free atom ar…

200 papers

The preparation of low-entropy starting conditions is a key requirement for many experiments involving neutral atoms. Here, we propose a method to autonomously assemble arbitrary spatial configurations of atoms within arrays of optical…

Quantum Gases · Physics 2021-05-12 M. A. Norcia

The binary-forking model is a parallel computation model, formally defined by Blelloch et al. very recently, in which a thread can fork a concurrent child thread, recursively and asynchronously. The model incurs a cost of $\Theta(\log n)$…

Data Structures and Algorithms · Computer Science 2020-09-04 Zafar Ahmad , Rezaul Chowdhury , Rathish Das , Pramod Ganapathi , Aaron Gregory , Mohammad Mahdi Javanmard

An efficient numerical algorithm is presented for massively parallel simulations of dispersion-managed wavelength-division-multiplexed optical fiber systems. The algorithm is based on a weak nonlinearity approximation and independent…

Pattern Formation and Solitons · Physics 2009-11-07 P. M. Lushnikov

We present a complete architecture for scalable quantum computation with ultracold atoms in optical lattices using optical tweezers focused to the size of a lattice spacing. We discuss three different two-qubit gates based on local…

Quantum Physics · Physics 2012-05-16 Christof Weitenberg , Stefan Kuhr , Klaus Mølmer , Jacob F. Sherson

Trapped atoms near nanophotonics form an exciting platform for bottom-up synthesis of strongly interacting quantum matter. The ability to induce tunable long-range atom-atom interactions with photons presents an opportunity to explore…

Quantum Physics · Physics 2019-04-12 May E. Kim , Tzu-Han Chang , Brian M. Fields , Cheng-An Chen , Chen-Lung Hung

Nucleus decompositions have been shown to be a useful tool for finding dense subgraphs. The coreness value of a clique represents its density based on the number of other cliques it is adjacent to. One useful output of nucleus decomposition…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-23 Jessica Shi , Laxman Dhulipala , Julian Shun

Quantum computing promises to solve previously intractable problems, with neutral atoms emerging as a promising technology. Zoned neutral atom architectures allow for immense parallelism and higher coherence times by shielding idling atoms…

Quantum Physics · Physics 2026-01-15 Yannick Stade , Wan-Hsuan Lin , Jason Cong , Robert Wille

In this work we propose an efficient parallelization of multiple-precision Taylor series method with variable stepsize and fixed order. For given level of accuracy the optimal variable stepsize determines higher order of the method than in…

Numerical Analysis · Mathematics 2021-10-20 I. Hristov , R. Hristova , S. Dimova , P. Armyanov , N. Shegunov , I. Puzynin , T. Puzynina , Z. Sharipov , Z. Tukhliev

We recently demonstrated that strings of trapped atoms inside a standing wave optical dipole trap can be rearranged using optical tweezers [Y. Miroshnychenko et al., Nature, in press (2006)]. This technique allows us to actively set the…

The approximate minimum degree algorithm is widely used before numerical factorization to reduce fill-in for sparse matrices. While considerable attention has been given to the numerical factorization process, less focus has been placed on…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-26 Yen-Hsiang Chang , Aydın Buluç , James Demmel

Data structures for efficient sampling from a set of weighted items are an important building block of many applications. However, few parallel solutions are known. We close many of these gaps both for shared-memory and distributed-memory…

Data Structures and Algorithms · Computer Science 2021-07-20 Lorenz Hübschle-Schneider , Peter Sanders

In this paper, we consider an approach to the parallelizing of the algorithms realizing the modified probability changigng method with adaptation and partial rollback procedure for constrained pseudo-Boolean optimization problems. Existing…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-09-03 Lev Kazakovtsev

Arrays of atoms trapped in optical tweezers combine features of programmable analog quantum simulators with atomic quantum sensors. Here we propose variational quantum algorithms, tailored for tweezer arrays as programmable quantum sensors,…

Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom…

We investigate the use of possibly the simplest scheme for the parallelisation of the standard particle filter, that consists in splitting the computational budget into $M$ fully independent particle filters with $N$ particles each, and…

Computation · Statistics 2015-10-12 Dan Crisan , Joaquin Miguez , Gonzalo Rios

This article describes algorithms for the hybrid parallelization and SIMD vectorization of molecular dynamics simulations with short-range forces. The parallelization method combines domain decomposition with a thread-based parallelization…

Materials Science · Physics 2017-09-13 Chris M. Mangiardi , Ralf Meyer

We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using arrays of dynamic optical traps. Red-rec exploits simple heuristics and exact subroutines to solve atom reconfiguration…

Polyatomic molecules have rich structural features that make them uniquely suited to applications in quantum information science, quantum simulation, ultracold chemistry, and searches for physics beyond the Standard Model. However, a key…

The contactless selective manipulation of individual objects at the microscale is powerfully enabled by acoustical tweezers based on acoustical vortices [Baudoin et al., Sci. Adv., 5:eaav1967 (2019)]. Nevertheless, the ability to assemble…

Applied Physics · Physics 2021-02-05 Zhixiong Gong , Michael Baudoin
‹ Prev 1 3 4 5 6 7 10 Next ›