Related papers: Parallel-in-time quantum simulation via Page and W…
Near-term quantum processors are limited in terms of the number of qubits and gates they can afford. They nevertheless give unprecedented access to programmable quantum systems that can efficiently, although imperfectly, simulate quantum…
Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry to reap enormous practical rewards. Analogue quantum simulation accomplishes this by using the dynamics of a controlled…
Even simplified models of quantum many-body systems can be difficult to analyse. However, taking inspiration from the foundations of physics, one may wonder whether there are practical advantages to constructing alternative beyond-quantum…
We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode decomposition algorithm used in diverse fields such as fluid…
We summarize our investigation of the extent to which the choice of internal clock influences the dynamics in quantum models of gravity. Firstly, at the classical level, we define an extension to the Hamilton-Jacobi theory of contact…
Central to the power of quantum computing is the concept of quantum parallelism: quantum systems can explore and process multiple computational paths simultaneously. In this paper, we discuss the elusive nature of quantum parallelism,…
Computations of chemical systems' equilibrium properties and non-equilibrium dynamics have been suspected of being a "killer app" for quantum computers. This review highlights the recent advancements of quantum algorithms tackling complex…
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body…
There is a solution to the problem of asymptotic completeness in many body scattering theory that offers a specific view of the quantum unitary dynamics which allows for the straightforward introduction of local time for every, at least…
We introduce a new discrete-time variational principle inspired by the quantum clock originally proposed by Feynman, and use it to write down quantum evolution as a ground state eigenvalue problem. The construction allows one to apply…
A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the…
Quantum simulators have made a remarkable progress towards exploring the dynamics of many-body systems, many of which offer a formidable challenge to both theoretical and numerical methods. While state-of-the-art quantum simulators are in…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
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 provide a Hilbert space approach to quantum mechanics where space and time are treated on an equal footing. Our approach replaces the standard dependence on an external classical time parameter with a spacetime-symmetric algebraic…
Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…
The integration of quantum computing and machine learning has emerged as a promising frontier in computational science. We present a hybrid protocol which combines classical neural networks with non-equilibrium dynamics of a quantum…
Analog quantum simulators and digital quantum computers are two distinct paradigms driving near-term applications in modern quantum science, from probing many-body phenomena to identifying computational advantage over classical systems. A…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. The interest often lies in estimating observables rather than explicitly obtaining…