Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

A Brief Introduction to NISQ Computer and Error Mitigation

L. C. Kwek

Published Jul 1, 2022• 1 citation
Publisher

Abstract

For the last thirty years, we have witnessed a steady progress towards the ultimate realization of a quantum computer. We are not there yet: there are still umpteen challenges and issues with actually realizing a fully programmable computer capable of solving realistic problems with an advantage over classical or traditional computer devices.

DOI
10.1142/9789811263699_0034

Related papers

5 Year Update to the Next Steps in Quantum Computing

Kenneth R. Brown, Frederic T. Chong, Kaitlin N. Smith +5 more

It has been 5 years since the Computing Community Consortium (CCC) Workshop on Next Steps in Quantum Computing, and significant progress has been made in closing the gap between useful quantum algorithms and quantum hardware. Yet much remains to be done, in particular in terms of mitigating errors and moving towards error-corrected machines. As we begin to transition from the Noisy-Intermediate Scale Quantum (NISQ) era to a future of fault-tolerant machines, now is an opportune time to reflect on how to apply what we have learned thus far and what research needs to be done to realize computational advantage with quantum machines.

arXiv:2403.08780•Jan 26, 2024•9 citations

Quantum error mitigations for quantum approximate optimization algorithms on IBM quantum processors

Sixian Liu, Hyunkyung Lim, Jia Choi +3 more

In recent years, there have been significant advancements in various aspects of quantum computing. However, despite this substantial progress, the availability of fault-tolerant quantum computers is still out of reach and may remain so for decades. Therefore, a key challenge is to leverage current NISQ devices to achieve a quantum advantage effectively. In this context, the Quantum Approximate Optimization Algorithm (QAOA) was proposed to potentially demonstrate computational advantages in combinatorial optimization problems using NISQ computers. Meanwhile, quantum error mitigation (QEM) techniques have been developed to address errors, with their effectiveness validated in practical problems involving more than 100 qubits. Therefore, in this paper, we optimize QAOA circuits and apply various error mitigation methods, such as dynamic decoupling and Pauli-twirling, to scale problem sizes on IBM quantum processors. Additionally, we discuss optimal implementation strategies for scalable QAOA. We test our implementations on Max-Cut problems and compare our results with previous works.

Quantum Communications and Quantum Imaging•Oct 4, 2024•0 citations

Practical quantum computers still at least a decade away

Peter H. Gwynne

Significant technical and financial issues remain towards building a large, fault-tolerant quantum computer and one is unlikely to be built within the coming decade.

Physics World•Jan 1, 2019•2 citations

Building a quantum computer (invited)

Barry C. Sanders

Quantum computing has leapt from concept to commercial enterprise in four decades and now the complexities of computer hardware apply to quantum computing but with the added challenge that computer fundamentals are radically different.

•Nov 5, 2020•3 citations

Towards the First Practical Applications of Quantum Computers

Kevin J. Sung

Noisy intermediate-scale quantum (NISQ) computers are coming online. The lack of error-correction in these devices prevents them from realizing the full potential of fault-tolerant quantum computation, a technology that is known to have significant practical applications, but which is years, if not decades, away. A major open question is whether NISQ devices will have practical applications. In this thesis, we explore and implement proposals for using NISQ devices to achieve practical applications. In particular, we develop and execute variational quantum algorithms for solving problems in combinatorial optimization and quantum chemistry. We also execute a prototype of a protocol for generating certified random numbers. We perform our experiments on a superconducting qubit processor developed at Google. While we do not perform any quantum computations that are beyond the capabilities of classical computers, we address many implementation challenges that must be overcome to succeed in such an endeavor, including optimization, efficient compilation, and error mitigation. In addressing these challenges, we push the limits of what can currently be done with NISQ technology, going beyond previous quantum computing demonstrations in terms of the scale of our experiments and the types of problems we tackle. While our experiments demonstrate progress in the utilization of quantum computers, the limits that we reached underscore the fundamental challenges in scaling up towards the classically intractable regime. Nevertheless, our results are a promising indication that NISQ devices may indeed deliver practical applications.

•Jan 1, 2020•0 citations

Quantum Computing: Predictions and Challenges

S. P. Kulik

Abstract A brief overview of the state of the art in the field of quantum computing is presented and the main problems in the construction of full-scale quantum computers, as well as ways to solve them, are discussed.

Bulletin of the Lebedev Physics Institute•Dec 1, 2023•2 citations
For the last thirty years, we have witnessed a steady progress towards the ultimate realization of a quantum computer. We are not there yet: there are still umpteen challenges and issues with actually realizing a fully programmable computer capable of solving realistic problems with an advantage over classical or traditional computer devices.
It has been 5 years since the Computing Community Consortium (CCC) Workshop on Next Steps in Quantum Computing, and significant progress has been made in closing the gap between useful quantum algorithms and quantum hardware. Yet much remains to be done, in particular in terms of mitigating errors and moving towards error-corrected machines. As we begin to transition from the Noisy-Intermediate Scale Quantum (NISQ) era to a future of fault-tolerant machines, now is an opportune time to reflect on how to apply what we have learned thus far and what research needs to be done to realize computational advantage with quantum machines.
In recent years, there have been significant advancements in various aspects of quantum computing. However, despite this substantial progress, the availability of fault-tolerant quantum computers is still out of reach and may remain so for decades. Therefore, a key challenge is to leverage current NISQ devices to achieve a quantum advantage effectively. In this context, the Quantum Approximate Optimization Algorithm (QAOA) was proposed to potentially demonstrate computational advantages in combinatorial optimization problems using NISQ computers. Meanwhile, quantum error mitigation (QEM) techniques have been developed to address errors, with their effectiveness validated in practical problems involving more than 100 qubits. Therefore, in this paper, we optimize QAOA circuits and apply various error mitigation methods, such as dynamic decoupling and Pauli-twirling, to scale problem sizes on IBM quantum processors. Additionally, we discuss optimal implementation strategies for scalable QAOA. We test our implementations on Max-Cut problems and compare our results with previous works.
Noisy intermediate-scale quantum (NISQ) computers are coming online. The lack of error-correction in these devices prevents them from realizing the full potential of fault-tolerant quantum computation, a technology that is known to have significant practical applications, but which is years, if not decades, away. A major open question is whether NISQ devices will have practical applications. In this thesis, we explore and implement proposals for using NISQ devices to achieve practical applications. In particular, we develop and execute variational quantum algorithms for solving problems in combinatorial optimization and quantum chemistry. We also execute a prototype of a protocol for generating certified random numbers. We perform our experiments on a superconducting qubit processor developed at Google. While we do not perform any quantum computations that are beyond the capabilities of classical computers, we address many implementation challenges that must be overcome to succeed in such an endeavor, including optimization, efficient compilation, and error mitigation. In addressing these challenges, we push the limits of what can currently be done with NISQ technology, going beyond previous quantum computing demonstrations in terms of the scale of our experiments and the types of problems we tackle. While our experiments demonstrate progress in the utilization of quantum computers, the limits that we reached underscore the fundamental challenges in scaling up towards the classically intractable regime. Nevertheless, our results are a promising indication that NISQ devices may indeed deliver practical applications.