We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Physics/NISQ computing: where are we and where do we go?
PeriodicalsPhysics

NISQ computing: where are we and where do we go?

Checking your access to this record.

Abstract & Overview

Abstract In this short review article, we aim to provide physicists not working within the quantum computing community a hopefully easy-to-read introduction to the state of the art in the field, with minimal mathematics involved. In particular, we focus on what is termed the Noisy Intermediate Scale Quantum era of quantum computing. We describe how this is increasingly seen to be a distinct phase in the development of quantum computers, heralding an era where we have quantum computers that are capable of doing certain quantum computations in a limited fashion, and subject to certain constraints and noise. We further discuss the prominent algorithms that are believed to hold the most potential for this era, and also describe the competing physical platforms on which to build a quantum computer that have seen the most success so far. We then talk about the applications that are most feasible in the near-term, and finish off with a short discussion on the state of the field. We hope that as non-experts read this article, it will give context to the recent developments in quantum computers that have garnered much popular press, and help the community understand how to place such developments in the timeline of quantum computing.

Cite this record

Jonathan Wei Zhong Lau, Kian Hwee Lim, Harshank Shrotriya, L. C. Kwek (2022). NISQ computing: where are we and where do we go?. AAPPS bulletin, 32(1). https://doi.org/10.1007/s43673-022-00058-z

Copy in another style

Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022). NISQ computing: where are we and where do we go? AAPPS bulletin, 32(1). https://doi.org/10.1007/s43673-022-00058-z
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.