Low-rank density-matrix evolution for noisy quantum circuits

Abstract In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leading eigenbasis during each simulation step...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Yi-Ting Chen, Collin Farquhar, Robert M. Parrish
Formato: article
Lenguaje:EN
Publicado: Nature Portfolio 2021
Materias:
Acceso en línea:https://doaj.org/article/160a2edde3bb4dbabe269eb7736cbcb8
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:160a2edde3bb4dbabe269eb7736cbcb8
record_format dspace
spelling oai:doaj.org-article:160a2edde3bb4dbabe269eb7736cbcb82021-12-02T16:45:22ZLow-rank density-matrix evolution for noisy quantum circuits10.1038/s41534-021-00392-42056-6387https://doaj.org/article/160a2edde3bb4dbabe269eb7736cbcb82021-04-01T00:00:00Zhttps://doi.org/10.1038/s41534-021-00392-4https://doaj.org/toc/2056-6387Abstract In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leading eigenbasis during each simulation step without the need to store, manipulate, or diagonalize the full matrix. We implement this algorithm using an in-house simulator and show that the low-rank algorithm speeds up simulations by more than two orders of magnitude over existing implementations of full-rank simulators, and with negligible error in the noise effect and final observables. Finally, we demonstrate the utility of the low-rank method as applied to representative problems of interest by using the algorithm to speed up noisy simulations of Grover’s search algorithm and quantum chemistry solvers.Yi-Ting ChenCollin FarquharRobert M. ParrishNature PortfolioarticlePhysicsQC1-999Electronic computers. Computer scienceQA75.5-76.95ENnpj Quantum Information, Vol 7, Iss 1, Pp 1-12 (2021)
institution DOAJ
collection DOAJ
language EN
topic Physics
QC1-999
Electronic computers. Computer science
QA75.5-76.95
spellingShingle Physics
QC1-999
Electronic computers. Computer science
QA75.5-76.95
Yi-Ting Chen
Collin Farquhar
Robert M. Parrish
Low-rank density-matrix evolution for noisy quantum circuits
description Abstract In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leading eigenbasis during each simulation step without the need to store, manipulate, or diagonalize the full matrix. We implement this algorithm using an in-house simulator and show that the low-rank algorithm speeds up simulations by more than two orders of magnitude over existing implementations of full-rank simulators, and with negligible error in the noise effect and final observables. Finally, we demonstrate the utility of the low-rank method as applied to representative problems of interest by using the algorithm to speed up noisy simulations of Grover’s search algorithm and quantum chemistry solvers.
format article
author Yi-Ting Chen
Collin Farquhar
Robert M. Parrish
author_facet Yi-Ting Chen
Collin Farquhar
Robert M. Parrish
author_sort Yi-Ting Chen
title Low-rank density-matrix evolution for noisy quantum circuits
title_short Low-rank density-matrix evolution for noisy quantum circuits
title_full Low-rank density-matrix evolution for noisy quantum circuits
title_fullStr Low-rank density-matrix evolution for noisy quantum circuits
title_full_unstemmed Low-rank density-matrix evolution for noisy quantum circuits
title_sort low-rank density-matrix evolution for noisy quantum circuits
publisher Nature Portfolio
publishDate 2021
url https://doaj.org/article/160a2edde3bb4dbabe269eb7736cbcb8
work_keys_str_mv AT yitingchen lowrankdensitymatrixevolutionfornoisyquantumcircuits
AT collinfarquhar lowrankdensitymatrixevolutionfornoisyquantumcircuits
AT robertmparrish lowrankdensitymatrixevolutionfornoisyquantumcircuits
_version_ 1718383439277719552