Related papers: Quantum Computational Structure of $SU(N)$ Scatter…
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve…
The Hubbard model may be the simplest model of particles interacting on a lattice, but simulation of its dynamics remains beyond the reach of current numerical methods. In this article, we show that general quantum computations can be…
For matter wave scattering from passive quantum obstacles, we propose a phase diagram in terms of phase and modulus of scattering coefficients to explore all possible directional scattering patterns. In the phase diagram, we can not only…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
We investigate multiple scattering of scalar waves by an ensemble of $N$ resonant point scatterers in three dimensions. For up to $N = 21$ scatterers, we numerically optimize the positions of the individual scatterers, such as to maximize…
We present a formalism for the scattering of an arbitrary linear or acyclic branched structure build by joining mutually non-interacting arbitrary functional sub-units. The formalism consists of three equations expressing the structural…
Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle…
When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…
We present quantum algorithms to realize geometric transformations (two-point swappings, symmetric flips, local flips, orthogonal rotations, and translations) based on an $n$-qubit normal arbitrary superposition state (NASS). These…
A version of scattering theory that was developed many years ago to treat nuclear scattering processes, has provided a powerful tool to study universality in scattering processes involving open quantum systems with underlying classically…
This paper explores the connections between particle scattering and quantum information theory in the context of the non-relativistic, elastic scattering of two spin-1/2 particles. An untangled, pure, two-particle in-state is evolved by an…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
We study classical and quantum scattering properties in the ballistic regime of particles in two-dimensional chaotic billiards that are models of electron- or micro- waveguides. To this end we construct the purely classical counterparts of…
We develop a non-perturbative approach to simulating scattering on classical and quantum computers, in which the initial and final states contain a fixed number of composite particles. The construction is designed to mimic a particle…
The negative-AND (NAND) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum…
Spectral clustering is a powerful unsupervised machine learning algorithm for clustering data with non convex or nested structures. With roots in graph theory, it uses the spectral properties of the Laplacian matrix to project the data in a…
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an…
Many synthetic quantum systems allow particles to have dispersion relations that are neither linear nor quadratic functions. Here, we explore single-particle scattering in general spatial dimension $D\geq 1$ when the density of states…
Quantum computers hold great promise for arriving at exact simulations of nuclear dynamical processes (e.g., scattering and reactions) that are paramount to the study of nuclear matter at the limit of stability and to explaining the…
The probability of a quantum particle being detected in a given solid angle is determined by the $S$-matrix. The explanation of this fact in time dependent scattering theory is often linked to the quantum flux, since the quantum flux…