Related papers: Optimal simulation of nonlocal Hamiltonians using …
Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but…
We analyze the complexity of classically simulating continuous-time dynamics of locally interacting quantum spin systems with a constant rate of entanglement breaking noise. We prove that a polynomial time classical algorithm can be used to…
We provide a first operational method for checking indistinguishability of orthogonal states by local operations and classical communication (LOCC). This method originates from the one introduced by Ghosh et al. (Phys. Rev. Lett. 87, 5807…
Implementing the time evolution under a desired target Hamiltonian is critical for various applications in quantum science. Due to the exponential increase in the number of parameters with system size and experimental imperfections, this…
We provide a quantum method for simulating Hamiltonian evolution with complexity polynomial in the logarithm of the inverse error. This is an exponential improvement over existing methods for Hamiltonian simulation. In addition, its scaling…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
Localized orbital coupled cluster theory has recently emerged as an nonempirical alternative to DFT for large systems. Intuitively, one might expect such methods to perform less well for highly delocalized systems. In the present work, we…
Long ranged electrostatic interactions are time consuming to calculate in molecular dynamics and Monte-Carlo simulations. We introduce an algorithmic framework for simulating charged particles which modifies the dynamics so as to allow…
Long-range entanglement is an important quantum resource, particularly for topological orders and quantum error correction. In reality, preparing long-range entangled states requires a deep unitary circuit, which poses significant…
We can only perform a finite rounds of measurements in protocols with local operations and classical communication (LOCC). In this paper, we propose a set of product states, which require infinite rounds of measurements in order to…
Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge.…
We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguishable by local operations and classical communication when a finite number of runs is allowed. We then directly…
We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we consider "space-like cuts" where an entangling unitary is…
We prove a necessary condition that a quantum channel on a multipartite system may be approximated arbitrarily closely using local operations and classical communication (LOCC). We then extend those arguments to obtain a condition that…
We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions. Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions. This enables…
All known examples confirming the possibility of an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (AQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric…
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing sequences of one- and two-qubit gates with a unitary transformation generated…
We study when a multipartite non--local unitary operation can deterministically or probabilistically simulate another one when local operations of a certain kind -in some cases including also classical communication- are allowed. In the…
Building on recent advances in quantum algorithms which measure and reuse qubits and in efficient classical simulation leveraging projective measurements, we extend these frameworks to real-time dynamics of quantum many-body systems…
The reduction of Hamiltonian systems aims to build smaller reduced models, valid over a certain range of time and parameters, in order to reduce computing time. By maintaining the Hamiltonian structure in the reduced model, certain…