Related papers: Polynomially scaling spin dynamics simulation algo…
A method of quantum tomography of arbitrary spin particle states is developed on the basis of the root approach. It is shown that the set of mutually complementary distributions of angular momentum projections can be naturally described by…
Modeling complex systems, like neural networks, simple liquids or flocks of birds, often works in reverse to textbook approaches: given data for which averages and correlations are known, we try to find the parameters of a given model…
New algorithms for construction of asymptotic expansions for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces are presented. These algorithms are based on a special technique of sequential…
The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed…
The global coupling of few-level quantum systems ("spins") to a discrete set of bosonic modes is a key ingredient for many applications in quantum science, including large-scale entanglement generation, quantum simulation of the dynamics of…
Recent research has demonstrated the usefulness of neural networks as variational ansatz functions for quantum many-body states. However, high-dimensional sampling spaces and transient autocorrelations confront these approaches with a…
Dynamical Ising machines achieve accelerated solving of complex combinatorial optimization problems by remapping the convergence to the ground state of the classical spin networks to the evolution of specially constructed continuous…
We study trajectories of collective spin states of an ensemble of spinors. The spinors considered here are either trapped ions in free space or atoms confined in a cavity, both systems of which are engineered through their interactions with…
A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling…
We experimentally and theoretically investigate the non-equilibrium phase structure of a well-controlled driven-disspative quantum spin system governed by the interplay of coherent driving, spontaneous decay and long-range spin-spin…
We study the distribution of non-overlapping spacing ratios of higher-orders for complex interacting many-body quantum systems, with and without spin degree of freedom (in addition to the particle number). The Hamiltonian of such systems is…
Periodically-driven systems are ubiquitous in science and technology. In quantum dynamics, even a small number of periodically-driven spins leads to complicated dynamics. Hence, it is of interest to understand what constraints such dynamics…
Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic…
Analytical expressions are derived for sums of matrix elements and their squared moduli over many-body states with given total spin --- the states built from spin and spatial wavefunctions belonging to multidimensional irreducible…
The possibility of using strongly and continuously interacting spins for quantum computation has recently been discussed. Here we present a simple optical scheme that achieves this goal while avoiding the drawbacks of earlier proposals. We…
It is shown that a spin system is equivalent to a set of constrained harmonic oscillators. For finite, but large, systems, a continuous approximation to the density of states can be used, and the oscillator frequencies can be exactly…
Simulation of quantum dynamics is a grand challenge of computational physics. In this work we investigate methods for reducing the demands of such simulation by identifying reduced-order models for dynamics generated by parameterized…
In simulations of some infinite range spin glass systems with finite connectivity, it is found that for any resonable computational time, the saturatedenergy per spin that is achieved by a cluster algorithm is lowered in comparison to that…
Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage. Shor's algorithm, while renowned, has not been realized at a scale to…
Efficient preparation of spin-squeezed states is important for quantum-enhanced metrology. Current protocols for generating strong spin squeezing rely on either high dimensionality or long-range interactions. A key challenge is how to…