Related papers: Polynomially scaling spin dynamics simulation algo…

Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation…

In dense neutrino gases, which exist for instance in supernovae, the flavour states of different neutrinos may become entangled with one another. The theoretical description of such systems may therefore call for simulations on a quantum…

Numerical methods in spin-foam models have significantly advanced in the last few years, yet challenges remain in efficiently extracting results for amplitudes with many quantum degrees of freedom. In this paper we sketch a proposal for a…

We propose a dynamic quantum sensing scheme by using a quantum many-spin system composed of a central spin interacting with many surrounding spins. Starting from a generalized Ising ring model, we investigate the error propagation formula…

We propose and implement a novel hybrid meta-heuristic optimization algorithm for the identification of non-collinear global ground-states in magnetic systems. The inputs to this optimization scheme are directly from non-collinear density…

Systems of interacting quantum spins show a rich spectrum of quantum phases and display interesting many-body dynamics. Computing characteristics of even small systems on conventional computers poses significant challenges. A quantum…

A defining feature of sampling-based motion planning is the reliance on an implicit representation of the state space, which is enabled by a set of probing samples. Traditionally, these samples are drawn either probabilistically or…

A numerical procedure is presented for mapping the vicinity of the null-space of the spin relaxation superoperator. The states populating this space, i.e. those with near-zero eigenvalues, of which the two-spin singlet is a well-studied…

A shortcoming of existing reachability approaches for nonlinear systems is the poor scalability with the number of continuous state variables. To mitigate this problem we present a simulation-based approach where we first sample a number of…

The number of parameters describing a quantum state is well known to grow exponentially with the number of particles. This scaling clearly limits our ability to do tomography to systems with no more than a few qubits and has been used to…

In this work we propose techniques for efficient reachability analysis of the state space (e.g., detection of bad states) using a combination of partial order and symmetry based reductions in a distributed setting. The proposed techniques…

Spin qubits are contenders for scalable quantum computation because of their long coherence times demonstrated in a variety of materials, but individual control by frequency-selective addressing using pulsed spin resonance creates severe…

We present a method for performing atomistic spin dynamic simulations. A comprehensive summary of all pertinent details for performing the simulations such as equations of motions, models for including temperature, methods of extracting…

Various methods have been explored to prepare the spin-adapted ground state, the lowest energy state within the Hilbert space constrained by externally specified values of the total spin magnitude and the spin-$z$ component. In such problem…

We present a new, simple, fast algorithm to numerically evolve disks of inelastically colliding particles surrounding a central star. Our algorithm adds negligible computational cost to the fastest existing collisionless N-body codes, and…

We introduce a variational method for the approximation of ground states of strongly interacting spin systems in arbitrary geometries and spatial dimensions. The approach is based on weighted graph states and superpositions thereof. These…

Spin amplification is the process that ideally increases the number of excited spins when one of them is excited initially. We show that by applying optimal control techniques to design classical drive pulse shapes, spin amplification can…

An N-component continuous-time dynamic system is considered whose components evolve autonomously all the time except for in discrete asynchronous instances of pairwise interactions. Examples include chaotically colliding billiard balls and…

We present an algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of…

In SDN stateful data planes, switches can execute algorithms to process traffic based on local states. This approach permits to offload decisions from the controller to the switches, thus to reduce the latency to react to network events. We…