Related papers: Numerical complexity of helix unraveling algorithm…
Here we present the derivation, description and results of a Monte Carlo-based algorithm for simulating inelastic scattering of photo-electrons when passing through some scattering medium, such as a gas atmosphere or a solid material. The…
The derivation of cosmological parameters from astrophysical data sets routinely involves operations counts which scale as O(N^3) where N is the number of data points. Currently planned missions, including MAP and Planck, will generate sky…
Recent innovations focused around {\em parallel} processing, either through systems containing multiple processors or processors containing multiple cores, hold great promise for enhancing the performance of the trigger at the LHC and…
We study circuit complexity for spatial regions in holographic field theories. We study analogues based on the entanglement wedge of the bulk quantities appearing in the "complexity = volume" and "complexity = action" conjectures. We…
The structure of the CMS inner tracking system has been studied using nuclear interactions of hadrons striking its material. Data from proton-proton collisions at a center-of-mass energy of 13 TeV recorded in 2015 at the LHC are used to…
Hierarchical clustering is a critical task in numerous domains. Many approaches are based on heuristics and the properties of the resulting clusterings are studied post hoc. However, in several applications, there is a natural cost function…
Particle filters provide Monte Carlo approximations of intractable quantities such as point-wise evaluations of the likelihood in state space models. In many scenarios, the interest lies in the comparison of these quantities as some…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
Spectral clustering refers to a family of unsupervised learning algorithms that compute a spectral embedding of the original data based on the eigenvectors of a similarity graph. This non-linear transformation of the data is both the key of…
The ATLAS detector at CERN's Large Hadron Collider (LHC) will be exposed to proton-proton collisions from beams crossing at 40 MHz. At the design luminosity of 10^34 cm^-2 s^-1 there are on average 23 collisions per bunch crossing. A…
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
Clustering of charged particle tracks along the beam axis is the first step in reconstructing the positions of hadronic interactions, also known as primary vertices, at hadron collider experiments. We use a 2036 physical qubit D-Wave…
Application of real-time matrix algorithm in heavy ion induced complete fusion nuclear reactions of superheavy elements synthesis is reviewed in brief. An extended algorithm, for the case of the recoil detection efficiency is not close to…
A new numerical method is introduced for calculating the polarizability of an arbitrary dielectric object with position dependent complex permittivity. Three separate numerical approaches are provided to calculate the dipole moment of a…
Optical trapping is a widely used technique, with many important applications in biology and metrology. Complete modelling of trapping requires calculation of optical forces, primarily a scattering problem, and non-optical forces. The…
The current and upcoming generation of Very Large Volume Neutrino Telescopes---collecting unprecedented quantities of neutrino events---can be used to explore subtle effects in oscillation physics, such as (but not restricted to) the…
Reconstructing the trajectories of charged particles from the collection of hits they leave in the detectors of collider experiments like those at the Large Hadron Collider (LHC) is a challenging combinatorics problem and computationally…
The High Luminosity upgrade of the Large Hadron Collider (HL-LHC) will produce particle collisions with up to 200 simultaneous proton-proton interactions. These unprecedented conditions will create a combinatorial complexity for…
Electron orbits are calculated in solitary two-dimensional axisymmetric electrostatic potential structures, typical of plasma electron holes, in order to establish the conditions for the particles to remain trapped. Analytic calculations of…