Dissipative quantum Church-Turing theorem.

@article{Kliesch2011DissipativeQC,
  title={Dissipative quantum Church-Turing theorem.},
  author={Martin Kliesch and Thomas Barthel and Christian Gogolin and Michael J. Kastoryano and Jens Eisert},
  journal={Physical review letters},
  year={2011},
  volume={107 12},
  pages={
          120501
        }
}
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 simulation time and the size of the system. An immediate consequence is that dissipative quantum computing is no more powerful than the unitary circuit model. Our result can be seen as a dissipative Church-Turing theorem, since it implies that under natural assumptions, such as weak coupling to an… 
Quasilocality and efficient simulation of markovian quantum dynamics.
TLDR
It is concluded that the simulation on a quantum computer is additionally efficient in time and can be simulated on classical computers with a cost that is independent of the system size.
Dissipative universal Lindbladian simulation
It is by now well understood that quantum dissipative processes can be harnessed and turned into a resource for quantum-information processing tasks. In this paper we demonstrate yet another way in
Classifying quantum data by dissipation
We investigate a general class of dissipative quantum circuit capable of computing arbitrary Conjunctive Normal Form (CNF) Boolean formulas. In particular, the clauses in a CNF formula define a local
Quantum data classification by dissipation
We investigate a general class of dissipative quantum circuit capable of computing arbitrary Conjunctive-Normal-Form (CNF) Boolean formulas. In particular, the clauses in a CNF formula define a local
Computational Problems Related to Open Quantum Systems
  • C. Wang
  • Computer Science, Physics
  • 2018
TLDR
It is shown that it is impossible for a simple reductionist approach to simulate Lindblad evolution with gate complexity that has linear dependence in evolution time and poly-logarithmic dependence in precision, and a novel variation of the “linear combination of unitaries” construction that pertains to quantum channels is used.
Quantum algorithm for the simulation of open-system dynamics and thermalization
TLDR
This paper proposes a way to simulate open-system dynamics by reproducing reservoir correlation functions using a minimised Hilbert space and suggests that the environment on the quantum computer could be even smaller than the system.
Hardware-efficient quantum algorithm for the simulation of open-system dynamics and the thermalisation on quantum computer
TLDR
This paper proposes a way to simulate open-system dynamics by reproducing reservoir correlation functions using a minimised Hilbert space and suggests that the environment on the quantum computer could be even smaller than the system.
Efficient universal quantum channel simulation in IBM’s cloud quantum computer
TLDR
This work proposed a quantum algorithm for the simulation of the universal single-qubit channel, described by a convex combination of “quasi-extreme” channels corresponding to four Kraus operators, and is scalable to arbitrary higher dimension.
Experimental repetitive quantum channel simulation
Succinct Description and Efficient Simulation of Non-Markovian Open Quantum Systems
Non-Markovian open quantum systems are the most general dynamics when the quantum system is coupled with a bath environment. The quantum dynamics arising from many important applications are
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
An Introduction to Quantum Computing
TLDR
This book discusses quantum algorithms, a quantum model of computation, and algorithms with super-polynomial speed-up, as well as quantum computational complexity theory and lower bounds.
Classical and Quantum Computation
Introduction Classical computation Quantum computation Solutions Elementary number theory Bibliography Index.
Int
  • J. Theor. Phys. 21, 467
  • 1982
Nature Phys
  • 4, 878 (2008); J. Eisert and T. Prosen, arXiv:1012.5013. PRL 107, 120501
  • 2011
Phys
  • Rev. Lett. 106, 170501
  • 2011
Nature Phys
  • 5, 633
  • 2009
Phys
  • 121, 3393 (2004); R. Kapral, Annu. Rev. Phys. Chem. 57, 129 (2006); D.M. Kernan, G. Ciccotti, and R. Kapral, J. Phys. Chem. B 112, 424 (2008); G. Benenti, G. Casati, T. Prosen, D. Rossini, and M. Znidaric, Phys. Rev. B 80, 035110
  • 2009
Commun
  • Math. Phys. 279, 147
  • 2008
W
  • van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, SIAM J. Comput. 37, 166 (2007); D.W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Commun. Math. Phys. 270, 359
  • 2007
...
1
2
...