Related papers: Simulation of three-spin evolution under XX Hamilt…
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…
The propagation of excitation along a one-dimensional chain of atoms is simulated by means of NMR. The physical system used as an analog quantum computer is a nucleus of 133-Cs (spin 7/2) in a liquid crystalline matrix. The Hamiltonian of…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
Efficient simulation of quantum mechanical problems can be performed in a quantum computer where the interactions of qubits lead to the realization of various problems possessing quantum nature. Spin-Boson Model (SBM) is one of the striking…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
Quantum computers have the potential to simulate chemical systems beyond the capability of classical computers. Recent developments in hybrid quantum-classical approaches enable the determinations of the ground or low energy states of…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
The evolution of entanglement in a 3-spin chain with nearest-neighbor Heisenberg-XY interactions for different initial states is investigated here. In an NMR experimental implementation, we generate multipartite entangled states starting…
Systems of interacting quantum spins show a rich spectrum of quantum phases and display interesting many-body dynamics. Computing characteristics of even small systems on conventional computers poses significant challenges. A quantum…
We present the quantum simulation of the frustrated quantum spin-$\frac{1}{2}$ antiferromagnetic Heisenberg spin chain with competing nearest-neighbor $(J_1)$ and next-nearest-neighbor $(J_2)$ exchange interactions in the real…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
Many-body physics is one very well suited field for testing quantum algorithms and for finding working heuristics on present quantum computers. We have investigated the non-equilibrium dynamics of one- and two-electron systems, which are…
We present a model of quantum teleportation protocol based on one-dimensional quantum dots system. Three quantum dots with three electrons are used to perform teleportation, the unknown qubit is encoded using one electron spin on quantum…
The construction of quantum computer simulators requires advanced software which can capture the most significant characteristics of the quantum behavior and quantum states of qubits in such systems. Additionally, one needs to provide valid…
We extend the notion of compressed quantum simulation to the XY-model. We derive a quantum circuit processing log(n) qubits which simulates the 1D XY-model describing n qubits. In particular, we demonstrate how the adiabatic evolution can…
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…
Photosynthesis is an important and complex physical process in nature, whose comprehensive understanding would have many relevant industrial applications, for instance in the field of energy production. In this paper we propose a quantum…
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series…
We point out that superconducting quantum computers are prospective for the simulation of the dynamics of spin models far from equilibrium, including nonadiabatic phenomena and quenches. The important advantage of these machines is that…
Quantum state estimation is an important task of many quantum information protocols. We consider two families of unitary evolution operators, one with a one-parameter and the other with a two-parameter, which enable the estimation of a…