Related papers: Simple Algorithm for Factorized Dynamics of g_n-Au…
We present a first principles molecular dynamics approach that is based on time-reversible ex- tended Lagrangian Born-Oppenheimer molecular dynamics [Phys. Rev. Lett. 100, 123004 (2008)] in the limit of vanishing self-consistent field…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of…
In recent work [Coretti et al., The Journal of Chemical Physics, 2018, 149, 191102], a new algorithm to solve numerically the dynamics of the shell model for polarization was presented. The approach, broadly applicable to systems involving…
We exhibit an algorithm to compute the strongest algebraic (or polynomial) invariants that hold at each location of a given unguarded linear hybrid automaton (i.e., a hybrid automaton having only unguarded transitions, all of whose…
We construct an approximation to field theories on the noncommutative torus based on soliton projections and partial isometries which together form a matrix algebra of functions on the sum of two circles. The matrix quantum mechanics is…
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced…
This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results…
This is a review paper concerned with the global consistency of the quantum dynamics of non-commutative systems. Our point of departure is the theory of constrained systems, since it provides a unified description of the classical and…
We present a quantum algorithm for computational fluid dynamics based on the Lattice-Boltzmann method. Our approach involves a novel encoding strategy and a modified collision operator, assuming full relaxation to the local equilibrium…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…
Inspired by G. Frieden's recent work on the geometric R-matrix for affine type A crystal associated with rectangular shaped Young tableaux, we propose a method to construct a novel family of discrete integrable systems which can be regarded…
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is…
We present an efficient \textit{ab initio} algorithm for quantum dynamics simulations of interacting systems that is based on the conditional decomposition of the many-body wavefunction [Phys. Rev. Lett. 113, 083003 (2014)]. Starting with…
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…
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations…
We show that the stochastic dynamics of a large class of one-dimensional interacting particle systems may be presented by integrable quantum spin Hamiltonians. Using the Bethe ansatz and similarity transformations this yields new exact…