Related papers: Simulation of Markovian quantum dynamics on quantu…

We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…

Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported…

This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational…

Accurate simulation of dynamical processes in molecules and reactions is among the most challenging problems in quantum chemistry. Quantum computers promise efficient chemical simulation, but the existing quantum algorithms require many…

We present a Bayesian algorithm to identify generators of open quantum system dynamics, described by a Lindblad master equation, that are compatible with measured experimental data. The algorithm, based on a Markov Chain Monte Carlo…

Recurrent neurons, or "simulated" qubits, can store simultaneous true and false with probabilistic behaviors usually reserved for the qubits of quantum physics. Although possible to construct artificially, simulated qubits are intended to…

We implement in a reactive programming framework a simulation of three aspects of quantum mechanics: self-interference, state superposition, and entanglement. The simulation basically consists in a cellular automaton embedded in a…

We show that dissipative classical dynamics converging to a strange attractor can be simulated on a quantum computer. Such quantum computations allow to investigate efficiently the small scale structure of strange attractors, yielding new…

Building a scalable quantum computer requires developing appropriate models to understand and verify its complex quantum dynamics. We focus on superconducting quantum processors based on transmons for which full numerical simulations are…

We compare two approaches to non-Markovian quantum evolution: one based on the concept of divisible maps and the other one based on distinguishability of quantum states. The former concept is fully characterized in terms of local generator…

In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where…

So far proposed quantum computers use fragile and environmentally sensitive natural quantum systems. Here we explore the new notion that synthetic quantum systems suitable for quantum computation may be fabricated from smart nanostructures…

We analyze non-Markovian evolution of open quantum systems. It is shown that any dynamical map representing evolution of such a system may be described either by non-local master equation with memory kernel or equivalently by equation which…

Quantum neuromorphic computing physically implements neural networks in brain-inspired quantum hardware to speed up their computation. In this perspective article, we show that this emerging paradigm could make the best use of the existing…

We consider the theoretical description of real-time counting of electrons tunneling through a Coulomb-blockade quantum dot using a detector with finite bandwidth. By tracing out the quantum dot we find that the dynamics of the detector…

A new physical implementation for quantum computation is proposed. The vibrational modes of molecules are used to encode qubit systems. Global quantum logic gates are realized using shaped femtosecond laser pulses which are calculated…

Quantum computing offers promising new avenues for tackling the long-standing challenge of simulating the quantum dynamics of complex chemical systems, particularly open quantum systems coupled to external baths. However, simulating such…

Using the tensor product representation in the density matrix renormalization group, we show that a quantum circuit of Grover's algorithm, which has one-qubit unitary gates, generalized Toffoli gates, and projective measurements, can be…

In the study of closed many-body quantum systems one is often interested in the evolution of a subset of degrees of freedom. On many occasions it is possible to approach the problem by performing an appropriate decomposition into a bath and…

Simulations of quantum dynamics are a key application of near term quantum computing, but are hindered by the twin challenges of noise and small device scale, which limit the executable circuit depths and the number of qubits the algorithm…