Related papers: Entanglement-Dependent Error Bounds for Hamiltonia…
We upper- and lower-bound the optimal precision with which one can estimate an unknown Hamiltonian parameter via measurements of Gibbs thermal states with a known temperature. The bounds depend on the uncertainty in the Hamiltonian term…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
In one dimension, the area law and its implications for the approximability by Matrix Product States are the key to efficient numerical simulations involving quantum states. Similarly, in simulations involving quantum operators, the…
A higher-order Suzuki-Trotter decomposition or Trotterization can be exploited to mitigate the Trotter error in digital quantum simulation. This work revisits the second-order symmetric Trotterization in terms of the Trotter error, where…
In a recent publication, we have discussed the effects of boundary conditions in finite quantum systems and their connection with symmetries. Focusing on the one-dimensional Hubbard Hamiltonian under twisted boundary conditions, we have…
A fundamental challenge in digital quantum simulation (DQS) is the control of inherent errors. These appear when discretizing the time evolution generated by the Hamiltonian of a quantum many-body system as a sequence of quantum gates,…
Entanglement does not correspond to any observable and its evaluation always corresponds to an estimation procedure where the amount of entanglement is inferred from the measurements of one or more proper observables. Here we address…
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from…
For many quantum systems of interest, the classical computational cost of simulating their time evolution scales exponentially in the system size. At the same time, quantum computers have been shown to allow for simulations of some of these…
We present practical methods to measure entanglement for quantum simulators that can be realized with trapped ions, cold atoms, and superconducting qubits. Focussing on long- and short-range Ising-type Hamiltonians, we introduce schemes…
The entanglement entropy of a subsystem $A$ of a quantum system is expressed, in the replica method, through analytic continuation with respect to n of the trace of the n-th power of the reduced density matrix $\tr\rho_A^n$. We study the…
We provide three improvements to the product formula implementation of the ground state energy estimation algorithm via Trotter-Suzuki decomposition. These consist of smaller circuit templates for each Hamiltonian term, parallelization of…
The eigenstate entanglement entropy has been recently shown to be a powerful tool to distinguish integrable from generic quantum-chaotic models. In integrable models, a unique feature of the average eigenstate entanglement entropy (over all…
We investigate the entanglement in Hubbard models of hardcore bosons in $1D$, with an additional hardcore interaction on nearest neighbouring sites. We derive analytical formulas for the bipartite entanglement entropy for any number of…
The modular Hamiltonian of reduced states, given essentially by the logarithm of the reduced density matrix, plays an important role within the AdS/CFT correspondence in view of its relation to quantum information. In particular, it is an…
We study the relationship between entanglement and spectral gap for local Hamiltonians in one dimension. The area law for a one-dimensional system states that for the ground state, the entanglement of any interval is upper-bounded by a…
The area law conjecture states that the entanglement entropy of a region of space in the ground state of a gapped, local Hamiltonian only grows like the surface area of the region. We show that, for any quantum state that fulfills an area…
We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. Assuming access to a block-encoding of $H'=(H-E)/\lambda$ for some $E \in \mathbb R$, the goal is to implement an…
This work aims to address the bottleneck issues of hardware resource limitation and decoherence error in the Hamiltonian simulation of quantum fluids, which are caused by the standard quantum Fourier transform and the evolution of momentum…
We develop a fourth-order Magnus expansion based quantum algorithm for the simulation of many-body problems involving two-level quantum systems with time-dependent Hamiltonians, $\mathcal{H}(t)$. A major hurdle in the utilization of the…