Related papers: The Dynamics of 1D Quantum Spin Systems Can Be App…
We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system…
What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a 10-local finite-range interaction among qubits on a…
An efficient numerical method is developed using the matrix product formalism for computing the properties at finite energy densities in one-dimensional (1D) many-body localized (MBL) systems. Arguing that any efficient (possibly quantum)…
We provide new examples of pure entangled systems related to cluster state quantum computation that can be efficiently simulated classically. In cluster state quantum computation input qubits are initialised in the `equator' of the Bloch…
In dense neutrino gases, which exist for instance in supernovae, the flavour states of different neutrinos may become entangled with one another. The theoretical description of such systems may therefore call for simulations on a quantum…
Fault-tolerant quantum computing typically requires the transpilation of arbitrary quantum circuits into a finite, universal gate set, such as Clifford+T. As a baseline, Diagonal approximation can be used for synthesizing single-qubit Pauli…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
We prove that ground states of gapped local Hamiltonians on an infinite spin chain can be efficiently approximated by matrix product states with a bond dimension which scales as D~(L-1)/epsilon, where any local quantity on L consecutive…
We present a quantum computational framework using Hamiltonian Truncation (HT) for simulating real-time scattering processes in $(1+1)$-dimensional scalar $\phi^4$ theory. Unlike traditional lattice discretisation methods, HT approximates…
A major challenge in the burgeoning field of quantum simulation for high-energy physics is the realization of scalable $2+1$D lattice gauge theories on state-of-the-art quantum hardware, which is an essential step towards the overarching…
We extend previous work concerning rest-frame partial-wave mixing in Hamiltonian effective field theory to both elongated and moving systems, where two particles are in a periodic elongated cube or have nonzero total momentum, respectively.…
Recent work has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian $H$ for a given simulation problem into subsets $A$ and $B$ such that $H=A+B$, where the terms in $A$ are simulated with a…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
We present quantum algorithms for the loading of probability distributions using Hamiltonian simulation for one dimensional Hamiltonians of the form ${\hat H}= \Delta + V(x) \mathbb{I}$. We consider the potentials $V(x)$ for which the…
Many promising applications of quantum computing with a provable speedup center around the HHL algorithm. Due to restrictions on the hardware and its significant demand on qubits and gates in known implementations, its execution is…
This chapter gives a self-contained review of the how standard open quantum system Hamiltonians can be mapped analytically onto representations in which the environments appear as one dimensional harmonic chains with nearest neighbour…
We analyze the method for calculation of properties of non-relativistic quantum systems based on exact diagonalization of space-discretized short-time evolution operators. In this paper we present a detailed analysis of the errors…
In this article, we compare the methods implementing the real-time evolution operator generated by a unitary diagonal matrix where its entries obey a known underlying real function. When the size of the unitary diagonal matrix is small, 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…
Particle transport and localization phenomena in condensed-matter systems can be modeled using a tight-binding lattice Hamiltonian. The ideal experimental emulation of such a model utilizes simultaneous, high-fidelity control and readout of…