Related papers: A cluster algorithm for resistively shunted Joseph…
We present an efficient method to perform overdamped Brownian dynamics simulations in external force fields and for particle interactions that include a hardcore part. The method applies to particle motion in one dimension, where it is…
In this note I survey the extensive literature on the dynamics of large series arrays of identical current biased Josephson junctions coupled through various shared loads. The equations describing the dynamics are invariant under…
The phase diagram of a 2D Josephson junction array with large substrate resistance, described by a quantum XY model, is studied by means of Fourier path-integral Monte Carlo. A genuine Berezinskii-Kosterlitz-Thouless transition is found up…
Superconducting quantum circuits based on Josephson junctions have made rapid progress in demonstrating quantum behavior and scalability. However, the future prospects ultimately depend upon the intrinsic coherence of Josephson junctions,…
Shallow, CNOT-efficient quantum circuits are crucial for performing accurate computational chemistry simulations on current noisy quantum hardware. Here, we explore the usefulness of non-iterative energy corrections, based on the method of…
Josephson tunnel junctions are proposed as efficient phase-tunable thermal rectifiers. The latter exploit the strong temperature dependence of the superconducting density of states and phase-dependence of heat currents flowing through…
Many superconducting technologies such as rapid single flux quantum computing (RSFQ) and superconducting quantum interference devices (SQUIDs) rely on the modulation of nonlinear dynamics in Josephson junctions for functionality. More…
We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed…
This paper extends algorithms that remove the fixed point bias of decentralized gradient descent to solve the more general problem of distributed optimization over subspace constraints. Leveraging the integral quadratic constraint…
Conventional Josephson metal-insulator-metal devices are inherently underdamped and exhibit hysteretic current-voltage response due to a very high subgap resistance compared to that in the normal state. At the same time, overdamped…
Diffusion on complex networks is a convenient framework to simulate a great variety of transport systems. The effects of failures in the network links may be used to cascade phenomena or the congestion formation in the system. A real time…
This paper proposes an accurate fault location algorithm technique based on hybrid synchronized sparse voltage and sparse current phasor measurements. The proposed algorithm addresses the performance limitation of fault location algorithms…
Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic…
We introduce a novel algorithm that leverages stochastic sampling techniques to compute the perturbative triples correction in the coupled-cluster (CC) framework. By combining elements of randomness and determinism, our algorithm achieves a…
The coupling of Josephson oscillations in layered superconductors is studied with help of a tunneling Hamiltonian formalism. The general form of the current density across the barriers between the superconducting layers is derived. The…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
We theoretically investigate the phase and voltage correlation dynamics, which includes both the deterministic contribution and stochastic fluctuations, under a current noise generated by a resistor including thermal and quantum…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
We bring together topological data analysis, applied category theory, and machine learning to study multiparameter hierarchical clustering. We begin by introducing a procedure for flattening multiparameter hierarchical clusterings. We…
Identification of the clusters from an unlabeled data set is one of the most important problems in Unsupervised Machine Learning. The state of the art clustering algorithms are based on either the statistical properties or the geometric…