Hardware-efficient quantum algorithm for the simulation of open-system dynamics and the thermalisation on quantum computer

@article{Su2019HardwareefficientQA,
  title={Hardware-efficient quantum algorithm for the simulation of open-system dynamics and the thermalisation on quantum computer},
  author={Hong-Yi Su and Ying Li},
  journal={arXiv: Quantum Physics},
  year={2019}
}
  • H. SuYing Li
  • Published 10 August 2019
  • Physics, Computer Science
  • arXiv: Quantum Physics
The quantum open system simulation is an important category of quantum simulation. By simulating the thermalisation process of the zero temperature, we can solve the ground-state problem of quantum systems. To realise the open-system evolution on the quantum computer, we need to encode the environment using qubits. However, usually the environment is much larger than the system, i.e. plenty of qubits are required if the environment is directly encoded. In this paper, we propose a way to… 

Figures from this paper

References

SHOWING 1-10 OF 35 REFERENCES

Quantum algorithm for simulating the dynamics of an open quantum system

In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the

Quantum Metropolis sampling

This paper demonstrates how to implement a quantum version of the Metropolis algorithm, a method that has basically acquired a monopoly on the simulation of interacting particles and permits sampling directly from the eigenstates of the Hamiltonian, and thus avoids the sign problem present in classical simulations.

Universal simulation of Markovian quantum dynamics

Although the conditions for performing arbitrary unitary operations to simulate the dynamics of a closed quantum system are well understood, the same is not true of the more general class of quantum

Problem of equilibration and the computation of correlation functions on a quantum computer

The quantum algorithms that are presented could provide an exponential speedup over what can be achieved with a classical device, given a preparation of the equilibrium state.

Dissipative quantum Church-Turing theorem.

We show that the time evolution of an open quantum system, described by a possibly time dependent Liouvillian, can be simulated by a unitary quantum circuit of a size scaling polynomially in the

Quantum computation and quantum-state engineering driven by dissipation

In quantum information science, dissipation is commonly viewed as an adverse effect that destroys information through decoherence. But theoretical work shows that dissipation can be used to drive

Variational quantum simulation of imaginary time evolution

This work proposes a hybrid, variational algorithm, suitable for error mitigation, and can exploit shallow quantum circuits, that can be implemented with current quantum computers and used to find the ground state energy of many-particle systems.

A quantum–quantum Metropolis algorithm

This work presents a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain, and offers a quantum speedup relative to the classical counterpart.

Surface codes: Towards practical large-scale quantum computation

The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.

Simulation of electronic structure Hamiltonians using quantum computers

Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However,