Related papers: Connecting Entanglement in Time and Space: Improvi…
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to…
Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present here a near-optimal, robust, and end-to-end quantum…
Lubrication equations allow to describe many structurin processes of thin liquid films. We develop and apply numerical tools suitable for their analysis employing a dynamical systems approach. In particular, we present a time integration…
This article reviews and extends recent results concerning entanglement and frustration in multipartite systems which have some symmetry with respect to the ordering of the particles. Starting point of the discussion are Bell inequalities:…
We study the pairwise entanglement present in a quantum computer that simulates a dynamically localized system. We show that the concurrence is exponentially sensitive to changes in the Hamiltonian of the simulated system. Moreover,…
We develop a new algorithm based on the time-dependent variational principle applied to matrix product states to efficiently simulate the real- and imaginary time dynamics for infinite one-dimensional quantum lattice systems. This…
We present a practical algorithm based on symplectic splitting methods to integrate numerically in time the Schr\"odinger equation. When discretized in space, the Schr\"odinger equation can be recast as a classical Hamiltonian system…
The transverse folding algorithm [Phys. Rev. Lett. 102, 240603] is a tensor network method to compute time-dependent local observables in out-of-equilibrium quantum spin chains that can sometimes overcome the limitations of matrix product…
In the context of characterizing the structure of quantum entanglement in many-body systems, we introduce the entanglement contour, a tool to identify which real-space degrees of freedom contribute, and how much, to the entanglement of a…
The tube model is a central concept in polymer physics, and allows to reduce the complex many-filament problem of an entangled polymer solution to a single filament description. We investigate the probability distribution function of…
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm cite{BKL75}, which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is…
Federated learning enables training on a massive number of edge devices. To improve flexibility and scalability, we propose a new asynchronous federated optimization algorithm. We prove that the proposed approach has near-linear convergence…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any pre-existing structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into "system"…
Encoding classical data in a quantum state is a key prerequisite of many quantum algorithms. Recently matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits approximating input…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
Finite-dimensional Quantum Mechanics can be geometrically formulated as a proper classical-like Hamiltonian theory in a projective Hilbert space. The description of composite quantum systems within the geometric Hamiltonian framework is…