Related papers: Enabling Lie-Algebraic Classical Simulation beyond…
Recent advancements in the field of quantum simulation have significantly expanded the potential for applications, particularly in the context of lattice gauge theories (LGTs). Maintaining gauge invariance throughout a simulation remains a…
Programmable neutral-atom arrays provide a promising route to real-time analog simulation of strongly interacting quantum systems. We introduce a two leg Rydberg atom ladder that realizes string dynamics and controllable particle production…
A Quantum Cellular Automaton (QCA) is essentially an operator driving the evolution of particles on a lattice, through local unitaries. Because $\Delta_t=\Delta_x = \epsilon$, QCAs constitute a privileged framework to cast the digital…
This work develops a symplectic framework for quantum computing to be applied to classical Hamiltonian systems, exploiting the intrinsic geometric compatibility between unitary quantum evolution and symplectic phase-space dynamics in a…
An algebraic approach is formulated in the harmonic approximation to describe a dynamics of two-fermion systems, confined in three-dimensional axially symmetric parabolic potential, in an external magnetic field. The fermion interaction is…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
A central requirement for the faithful implementation of large-scale lattice gauge theories (LGTs) on quantum simulators is the protection of the underlying gauge symmetry. Recent advancements in the experimental realizations of large-scale…
In the effort to develop useful quantum computers simulating quantum machines with conventional computing resources is a key capability. Such simulations will always face limits preventing the emulation of quantum computers of substantial…
The long-standing problem of time in canonical quantum gravity is the source of several conceptual and technical issues. Here, recent mathematical results are used to provide a consistent algebraic formulation of dynamical symplectic…
Digital quantum computers promise exponential speedups in performing quantum time-evolution, providing an opportunity to simulate quantum dynamics of complex systems in physics and chemistry. However, the task of extracting desired quantum…
Quantum computing is greatly advanced in recent years and is expected to transform the computation paradigm in the near future. Quantum circuit simulation plays a key role in the toolchain for the development of quantum hardware and…
Time-dependent orbital-free DFT is an efficient method for calculating the dynamic properties of large scale quantum systems due to the low computational cost compared to standard time-dependent DFT. We formalize this method by mapping the…
Multi-scale computer simulations combine the computationally efficient classical algorithms with more expensive but also more accurate ab-initio quantum mechanical algorithms. This work describes one implementation of multi-scale…
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system…
In computer simulations, quantum delocalization of atomic nuclei can be modeled making use of the Path Integral (PI) formulation of quantum statistical mechanics. This approach, however, comes with a large computational cost. By restricting…
The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of…
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using…
The Fast Multipole Method (FMM) computes pairwise interactions between particles with an efficiency that scales linearly with the number of particles. The method works by grouping particles based on their spatial distribution and…
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…
We develop classical simulation algorithms for adaptive quantum circuits that produce states with low levels of ``magic'' (i.e., non-stabilizerness). These algorithms are particularly well-suited to circuits with high rates of Pauli…