Related papers: Simulating Hamiltonians in Quantum Networks: Effic…
We demonstrate quantum interference of three photons that are distinguishable in time, by resolving them in the conjugate parameter, frequency. We show that the multiphoton interference pattern in our setup can be manipulated by tuning the…
We present an algorithm that exploits quantum parallelism to simulate randomness in a quantum system. In our scheme, all possible realizations of the random parameters are encoded quantum mechanically in a superposition state of an…
We propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of…
We present a proposal for the realization of entanglement Hamiltonians in one-dimensional critical spin systems with strongly interacting cold atoms. Our approach is based on the notion that the entanglement spectrum of such systems can be…
Quantum simulators have the potential to solve quantum many-body problems that are beyond the reach of classical computers, especially when they feature long-range entanglement. To fulfill their prospects, quantum simulators must be fully…
In NMR (Nuclear Magnetic Resonance) quantum computation, the selective control of multiple homonuclear spins is usually slow because their resonance frequencies are very close to each other. To quickly implement controls against decoherence…
The need for Hamiltonians with many-body interactions arises in various applications of quantum computing. However, interactions beyond two-body are difficult to realize experimentally. Perturbative gadgets were introduced to obtain…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically…
The observation of genuine quantum effects in systems governed by non-Hermitian Hamiltonians has been an outstanding challenge in the field. Here we simulate the evolution under such Hamiltonians in the quantum regime on a superconducting…
We investigate the quantum algorithm of Babbush et al. (arXiv:2303.13012v3) for simulating coupled harmonic oscillators, which promises exponential speedups over classical methods. Focusing on linearly connected oscillator chains, we bridge…
The regular structures obtained by optical lattice technology and their behaviour are analysed from the quantum information perspective. Initially, we demonstrate that a triangular optical lattice of two atomic species, bosonic or…
We demonstrate that a triangular optical lattice of two atomic species, bosonic or fermionic, can be employed to generate a variety of novel spin-1/2 Hamiltonians. These include effective three-spin interactions resulting from the…
We consider quantum systems consisting of a linear chain of n harmonic oscillators coupled by a nearest neighbour interaction of the form $-q_r q_{r+1}$ ($q_r$ refers to the position of the $r$th oscillator). In principle, such systems are…
Quantum systems governed by time-dependent Hamiltonians pose significant challenges for the accurate computation of unitary time-evolution operators, which are essential for predicting quantum state dynamics. In this work, we introduce a…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
The parareal in time algorithm allows to efficiently use parallel computing for the simulation of time-dependent problems. It is based on a decomposition of the time interval into subintervals, and on a predictor-corrector strategy, where…
We present a quantum algorithm to obtain the response of the atomic nucleus to a small external electromagnetic perturbation. The Hamiltonian of the system is presented by a harmonic oscillator, and the linear combination of unitaries (LCU)…
The simulation of quantum systems has been a key aim of quantum technologies for decades, and the generalisation to open systems is necessary to include physically realistic systems. We introduce an approach for quantum simulations of open…