Related papers: Accuracy of the box-counting algorithm for noisy f…
We explore the fractal nature of particle showers using Monte-Carlo simulation. We define the fractal dimension of showers measured in a high granularity calorimeter designed for a future lepton collider. The shower fractal dimension…
Many biological processes and objects can be described by fractals. The paper uses a new type of objects - blinking fractals - that are not covered by traditional theories considering dynamics of self-similarity processes. It is shown that…
In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the…
A major challenge in developing quantum computing technologies is to accomplish high precision tasks by utilizing multiplex optimization approaches, on both the physical system and algorithm levels. Loss functions assessing the overall…
Breast cancer exhibits intricate morphological and dynamical heterogeneity across cellular, tissue, and tumor scales, posing challenges to conventional modeling approaches that fail to capture its nonlinear, self-similar, or self-affine,…
Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimising the number of gates is known as gate-synthesis. The approximation error is a form of coherent…
Complexity measures are designed to capture complex behavior and quantify *how* complex, according to that measure, that particular behavior is. It can be expected that different complexity measures from possibly entirely different fields…
We measure atom number statistics after splitting a gas of ultracold 87Rb atoms in a purely magnetic double-well potential created on an atom chip. Well below the critical temperature for Bose-Einstein condensation T_c, we observe reduced…
Hausdorff dimension of level sets of generic continuous functions defined on fractals can give information about the "thickness/narrow cross-sections" "network" corresponding to a fractal set, $F$. This lead to the definition of the…
We derive a set of spectral statistics whose power spectrum is characterized, in the case of chaotic quantum systems, by colored noise $1/f^{\gamma}$, where the integer parameter $\gamma$ critically depends on the specific energy-level…
While the power of quantum computers is commonly acknowledged to rise exponentially, it is often overlooked that the complexity of quantum noise mechanisms generally grows much faster. In particular, quantifying whether the instructions on…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
Twenty years ago the anti-reflective numerical boundary conditions (BCs) were introduced in a context of signal processing and imaging, for increasing the quality of the reconstruction of a blurred signal/image contaminated by noise and for…
Static structure factors are computed for large-scale, mechanically stable, jammed packings of frictionless spheres (three dimensions) and disks (two dimensions) with broad, power-law size dispersity characterized by the exponent $-\beta$.…
Compressed Counting (CC) was recently proposed for very efficiently computing the (approximate) $\alpha$th frequency moments of data streams, where $0<\alpha <= 2$. Several estimators were reported including the geometric mean estimator,…
We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the…
We consider quantile optimization of black-box functions that are estimated with noise. We propose two new iterative three-timescale local search algorithms. The first algorithm uses an appropriately modified finite-difference-based…
We show that counting the number of collisions (re-sampled bitstrings) when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer and a quantitative noise characterization method. We…
Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions…
Noise remains the major obstacle to scalable quantum computation. Quantum benchmarking provides key information on noise properties and is an important step for developing more advanced quantum processors. However, current benchmarking…