Related papers: The iTEBD algorithm beyond unitary evolution
Complex geometric tasks such as geometric modeling, physical simulation, and texture parametrization often involve the embedding of many complex sub-domains with potentially different dimensions. These tasks often require evolving the…
Many-body localization is a striking mechanism that prevents interacting quantum systems from thermalizing. The absence of thermalization behaviour manifests itself, for example, in a remanence of local particle number configurations, a…
We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasi-polynomial runtime for inverse temperatures up to…
We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators. Complexity is understood here as the shortest geodesic distance between the…
We develop a constructive approach to generate quantum neural networks capable of representing the exact thermal states of all many-body qubit Hamiltonians. The Trotter expansion of the imaginary-time propagator is implemented through an…
We run a numerical linked-cluster expansion with a quantum algorithm (NLCE+QA), computing ground-state energies and one quasi-particle dispersions in the thermodynamic limit using a 20-qubit trapped-ion quantum processing unit (QPU). The…
The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. On the other hand, the time evolution of quantum states is a natural application for quantum computers…
The current generation of noisy intermediate scale quantum computers introduces new opportunities to study quantum many-body systems. In this paper, we show that quantum circuits can provide a dramatically more efficient representation than…
We propose a tensor-network-based algorithm to study the classical Ising model on an infinitely large hyperbolic lattice with a regular 3D tesselation of identical dodecahedra. We reformulate the corner transfer matrix renormalization group…
Linear algebraic primitives are at the core of many modern algorithms in engineering, science, and machine learning. Hence, accelerating these primitives with novel computing hardware would have tremendous economic impact. Quantum computing…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…
We generalize the Linear Combination of Hamiltonian Simulation (LCHS) formula [An, Liu, Lin, Phys. Rev. Lett. 2023] to simulate time-evolution operators in infinite-dimensional spaces, including scenarios involving unbounded operators. This…
Lattice gauge theories are fundamental to various fields, including particle physics, condensed matter, and quantum information theory. Recent progress in the control of quantum systems allows for studying Abelian lattice gauge theories in…
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…
The investigation of the behavior of both classical and quantum systems on non-Euclidean surfaces near the phase transition point represents an interesting research area of modern physics. In the case of classical spin systems, a…
An optical-lattice quantum simulator is an ideal experimental platform to investigate non-equilibrium dynamics of a quantum many-body system, which is in general hard to simulate with classical computers. Here, we use our quantum simulator…
We extend the concept of dual unitary quantum gates to quantum lattice models in $2 + 1$ dimensions, by introducing and studying ternary unitary four-particle gates, which are unitary in time and both spatial dimensions. When used as…
Solving linear ordinary differential equations (ODE) is one of the most promising applications for quantum computers to demonstrate exponential advantages. The challenge of designing a quantum ODE algorithm is how to embed non-unitary…
We introduce the concept of embedding quantum simulators, a paradigm allowing the efficient quantum computation of a class of bipartite and multipartite entanglement monotones. It consists in the suitable encoding of a simulated quantum…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…