Sign-problem free quantum stochastic series expansion algorithm on a quantum computer

A quantum implementation of the Stochastic Series Expansion (SSE) Monte Carlo method is proposed, and is shown to offer significant advantages over classical implementations of SSE. In particular, for problems where classical SSE encounters the sign problem, the cost of implementing a Monte Carlo it...

Full description

Saved in:

Bibliographic Details
Main Authors:	Tan, Kok Chuan, Bhowmick, Dhiman, Sengupta, Pinaki
Other Authors:	School of Physical and Mathematical Sciences
Format:	Article
Language:	English
Published:	2023
Subjects:	Science::Mathematics Iterative Methods Quantum Computers
Online Access:	https://hdl.handle.net/10356/171018
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Nanyang Technological University
Language:	English

id	sg-ntu-dr.10356-171018
record_format	dspace
spelling	sg-ntu-dr.10356-1710182023-10-16T15:36:01Z Sign-problem free quantum stochastic series expansion algorithm on a quantum computer Tan, Kok Chuan Bhowmick, Dhiman Sengupta, Pinaki School of Physical and Mathematical Sciences Science::Mathematics Iterative Methods Quantum Computers A quantum implementation of the Stochastic Series Expansion (SSE) Monte Carlo method is proposed, and is shown to offer significant advantages over classical implementations of SSE. In particular, for problems where classical SSE encounters the sign problem, the cost of implementing a Monte Carlo iteration scales only linearly with system size in quantum SSE, while it may scale exponentially with system size in classical SSE. In cases where classical SSE can be efficiently implemented, quantum SSE still offers an advantage by allowing for more general observables to be measured. Ministry of Education (MOE) Nanyang Technological University Published version K.C.T. acknowledges support by the University of Electronic Science and Technology of China and the NTU Presidential Postdoctoral Fellowship program funded by Nanyang Technological University. Financial support from the Ministry of Education, Singapore, in the form of Grant No. MOE2018-T1-1-021 is gratefully acknowledged. 2023-10-14T05:53:22Z 2023-10-14T05:53:22Z 2022 Journal Article Tan, K. C., Bhowmick, D. & Sengupta, P. (2022). Sign-problem free quantum stochastic series expansion algorithm on a quantum computer. Npj Quantum Information, 8(1), 44-. https://dx.doi.org/10.1038/s41534-022-00555-x 2056-6387 https://hdl.handle.net/10356/171018 10.1038/s41534-022-00555-x 2-s2.0-85129232031 1 8 44 en MOE2018-T1-1-021 npj Quantum Information © 2022 The Author(s). This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons. org/licenses/by/4.0/. application/pdf
institution	Nanyang Technological University
building	NTU Library
continent	Asia
country	Singapore Singapore
content_provider	NTU Library
collection	DR-NTU
language	English
topic	Science::Mathematics Iterative Methods Quantum Computers
spellingShingle	Science::Mathematics Iterative Methods Quantum Computers Tan, Kok Chuan Bhowmick, Dhiman Sengupta, Pinaki Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
description	A quantum implementation of the Stochastic Series Expansion (SSE) Monte Carlo method is proposed, and is shown to offer significant advantages over classical implementations of SSE. In particular, for problems where classical SSE encounters the sign problem, the cost of implementing a Monte Carlo iteration scales only linearly with system size in quantum SSE, while it may scale exponentially with system size in classical SSE. In cases where classical SSE can be efficiently implemented, quantum SSE still offers an advantage by allowing for more general observables to be measured.
author2	School of Physical and Mathematical Sciences
author_facet	School of Physical and Mathematical Sciences Tan, Kok Chuan Bhowmick, Dhiman Sengupta, Pinaki
format	Article
author	Tan, Kok Chuan Bhowmick, Dhiman Sengupta, Pinaki
author_sort	Tan, Kok Chuan
title	Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
title_short	Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
title_full	Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
title_fullStr	Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
title_full_unstemmed	Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
title_sort	sign-problem free quantum stochastic series expansion algorithm on a quantum computer
publishDate	2023
url	https://hdl.handle.net/10356/171018
_version_	1781793781385789440

Sign-problem free quantum stochastic series expansion algorithm on a quantum computer

Similar Items