Related papers: Comment on "Accurate and Scalable O(N) Algorithm f…
Comment on R. Planet, S. Santucci, J. Ortin, Phys. Rev. Lett. 102, 094502 (2009) about the rescaling of the data and the data collapse. Reply to be found here.
Matrix multiplication is integral to various scientific and engineering disciplines, including machine learning, image processing, and gaming. With the increasing data volumes in areas like machine learning, the demand for efficient…
This is a comment published in Phys. Rev. Lett. vol. 73, page 1051 (1994).
Traditional databases commonly support efficient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take a first step toward dynamic reasoning in probabilistic…
Artificial magnetic molecules can contribute to progressing towards large scale quantum computation by: a) integrating multiple quantum resources and b) reducing the computational costs of some applications. Chemical design, guided by…
We propose Scalable Mechanistic Neural Network (S-MNN), an enhanced neural network framework designed for scientific machine learning applications involving long temporal sequences. By reformulating the original Mechanistic Neural Network…
The key to optical analogy to a multi-particle quantum system is the scalable property. Optical elds modulated with pseudorandom phase sequences is an interesting solution. By utilizing the properties of pseudorandom sequences, mixing…
Particle tracking in large-scale numerical simulations of turbulent flows presents one of the major bottlenecks in parallel performance and scaling efficiency. Here, we describe a particle tracking algorithm for large-scale parallel…
We report the results of intensive numerical calculations for four atomic H2+H2 energy transfer collision. A parallel computing technique based on LAM/MPI functions is used. In this algorithm, the data is distributed to the processors…
We present $O(\log\log n)$ round scalable Massively Parallel Computation algorithms for maximal independent set and maximal matching, in trees and more generally graphs of bounded arboricity, as well as for constant coloring trees.…
We provide a reply to a comment by I. Goychuk arXiv:1708.04155, version v2 from 27 Aug 2017 (not under active consideration with Phys. Rev. Lett.), on our Letter E. Aghion, D. A. Kessler and E. Barkai, Phys. Rev. Lett., 118, 260601 (2017).
The molecular dynamics simulation code ls1 mardyn is presented. It is a highly scalable code, optimized for massively parallel execution on supercomputing architectures, and currently holds the world record for the largest molecular…
This short communication develops a new numerical procedure suitable for a large class of ordinary differential equation systems found in models in physics and engineering. The main numerical procedure is analogous to those concerning the…
This paper proposes a novel second-order optimization algorithm based on the Optimal Control Principle (OCP), applicable to large-scale optimization problems in neural network training. The algorithm has a computational complexity of O(d)…
ParSplice D. Perez, E. D. Cubuk, A. Waterland, E. Kaxiras, and A. F. Voter, Long-Time Dynamics through Parallel Trajectory Splicing, Journal of Chemical Theory and Computation, 2016 is a molecular dynamics method for parallel-in-time…
We present a plane-wave ultrasoft pseudopotential implementation of first-principle molecular dynamics, which is well suited to model large molecular systems containing transition metal centers. We describe an efficient strategy for…
This is a reply to the paper by S.C.Benjamin, quant-ph/0008127.
Atomic ensembles, comprising clouds of atoms addressed by laser fields, provide an attractive system for both the storage of quantum information, and the coherent conversion of quantum information between atomic and optical degrees of…
Quantum computers are appealing for their ability to solve some tasks much faster than their classical counterparts. It was shown in [Aspuru-Guzik et al., Science 309, 1704 (2005)] that they, if available, would be able to perform the full…
Current computers operate at enormous speeds of ~10^13 bits/s, but their principle of sequential logic operation has remained unchanged since the 1950s. Though our brain is much slower on a per-neuron base (~10^3 firings/s), it is capable…