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

arXiv:1911.06167

NISQ computing for decision making under uncertainty

H. W. L. Naus

Published Nov 14, 2019• 0 citations
arXivHTMLPDF

Abstract

Noisy Intermediate-Scale Quantum computers are expected to be available this year. It is proposed to exploit such a device for decision making under uncertainty. The probabilistic character of quantum mechanics reflects this uncertainty. Concomitantly, the noise may add to it. The approach is standard in the sense that Bayes decision rule is used to decide on the basis of maximum expected reward. The novelty is to model the various action profiles and the development of `nature' as unitary transformations on a set of qubits. Measurement eventually yields samples of classical binary random variables in which the reward function has to be expressed. In order to achieve sufficiently low variances for reliable decision making more runs of such a quantum algorithm are necessary. Some simple examples have been worked out to elucidate the idea. Here the calculations are still analytically feasible. Presently lacking an operating quantum device, the QX simulator of Quantum Inspire has been used to generate the necessary samples for comparison and demonstration. First obtained results are promising and point at a possible useful application for noisy intermediate-scale quantum computers.

DOI
10.48550/arxiv.1911.06167

Related papers

Bell inequality violation on small NISQ computers

H. W. L. Naus, Polinder, H.

Quantum computational experiments exploiting Noisy Intermediate-Scale Quantum (NISQ) devices to demonstrate violation of a Bell inequality are proposed. They consist of running specified quantum algorithms on few-qubit computers. If such a device assures entanglement and performs single-shot measurements, the detection loophole is avoided. Four concise quantum circuits determining the expectation values of the relevant observables are used for a two-qubit system. It is possible to add an ancilla qubit to these circuits and eventually only measure the ancilla to obtain the relevant information. For a four-qubit NISQ computer, two algorithms yielding the same averages, however also guaranteeing a random choice of the observable, are developed. A freedom-of-choice loophole is therefore avoided. Including an additional ancilla reduces the number of measurements by one since in this case only the ancillas need to be measured. Note that these methods, using the NISQ device, are intrinsically quantum mechanical. Locality loopholes cannot be excluded on present NISQ systems. Results of simulations on the QX simulator of Quantum Inspire are presented. The Bell inequality is indeed found to be violated, even if some additional noise is included by means of the depolarizing channel error model. The algorithms have been implemented on the IBM Q Experience as well. The results of these quantum computations support a violation of the Bell inequality by various standard deviations.

arXiv:2006.13794•Jun 24, 2020•0 citations

Where are we heading with NISQ?

Olivier Ezratty

In 2017, John Preskill defined Noisy Intermediate Scale Quantum (NISQ) computers as an intermediate step on the road to large scale error corrected fault-tolerant quantum computers (FTQC). The NISQ regime corresponds to noisy qubit quantum computers with the potential to solve actual problems of some commercial value faster than conventional supercomputers, or consuming less energy. Over five years on, it is a good time to review the situation. While rapid progress is being made with quantum hardware and algorithms, and many recent experimental demonstrations, no one has yet successfully implemented a use case matching the original definition of the NISQ regime. This paper investigates the space, fidelity and time resources of various NISQ algorithms and highlights several contradictions between NISQ requirements and actual as well as future quantum hardware capabilities. It then covers various techniques which could help like qubit fidelities improvements, various breeds of quantum error mitigation methods, analog/digital hybridization, using specific qubit types like multimode photons as well as quantum annealers and analog quantum computers (aka quantum simulators or programmable Hamiltonian simulators) which seem closer to delivering useful applications although they have their own mid to longer-term scalability challenges. Given all the constraints of these various solutions, it seems possible to expect some practical use cases for NISQ systems, but with a very narrow window before various scaling issues show up. Turning to the future, a scenario can be envisioned where NISQ will not necessarily be an intermediate step on the road to FTQC. Instead, the two may develop along different paths, due to their different requirements. This leaves open a key question on the trade-offs that may be necessary to make between qubit scale and qubit fidelities in future quantum computers designs.

arXiv:2305.09518•May 16, 2023•23 citations

Full-stack, real-system quantum computer studies: architectural comparisons and design insights

Prakash Murali, Norbert M. Linke, Margaret Martonosi +3 more

In recent years, Quantum Computing (QC) has progressed to the point where small working prototypes are available for use. Termed Noisy Intermediate-Scale Quantum (NISQ) computers, these prototypes are too small for large benchmarks or even for Quantum Error Correction (QEC), but they do have sufficient resources to run small benchmarks, particularly if compiled with optimizations to make use of scarce qubits and limited operation counts and coherence times. QC has not yet, however, settled on a particular preferred device implementation technology, and indeed different NISQ prototypes implement qubits with very different physical approaches and therefore widely-varying device and machine characteristics.

arXiv:1905.11349•Proceedings - International Symposium on Computer Architecture/Proceedings•Jun 14, 2019•181 citations

How Many Trials Do We Need for Reliable NISQ Computing?

Teruo Tanimoto, Shuhei Matsuo, Satoshi Kawakami +3 more

Gate-based quantum computing is an attractive candidate in the post-Moore era. Noisy intermediate-scale quantum (NISQ) computers are expected to be available in the next few years. It is required to repeatedly execute the target quantum application for reliable NISQ computing, e.g., users can set 1,024 as a repetition parameter in the IBM-Q machine, because NISQ computers output follows the probability distribution of execution trials. Since the distribution depends strongly on the effects of noise, it is difficult to determine a sufficient number of repetitions. This paper proposes a novel statistical approach for efficient NISQ computing. The key idea is to introduce a Bayesian credible interval model to obtain convergence of the probability distributions. We demonstrate that our execution method can detect all significant output values, that occur more often than the random situation (probability is 1/2n), using a NISQ simulator.

IEEE Computer Society Annual Symposium on VLSI•Jul 1, 2020•1 citation

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 in the NISQ era and beyond

John P. Preskill

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.

arXiv:1801.00862•Quantum•Aug 6, 2018•10,261 citations
Noisy Intermediate-Scale Quantum computers are expected to be available this year. It is proposed to exploit such a device for decision making under uncertainty. The probabilistic character of quantum mechanics reflects this uncertainty. Concomitantly, the noise may add to it. The approach is standard in the sense that Bayes decision rule is used to decide on the basis of maximum expected reward. The novelty is to model the various action profiles and the development of `nature' as unitary transformations on a set of qubits. Measurement eventually yields samples of classical binary random variables in which the reward function has to be expressed. In order to achieve sufficiently low variances for reliable decision making more runs of such a quantum algorithm are necessary. Some simple examples have been worked out to elucidate the idea. Here the calculations are still analytically feasible. Presently lacking an operating quantum device, the QX simulator of Quantum Inspire has been used to generate the necessary samples for comparison and demonstration. First obtained results are promising and point at a possible useful application for noisy intermediate-scale quantum computers.
Quantum computational experiments exploiting Noisy Intermediate-Scale Quantum (NISQ) devices to demonstrate violation of a Bell inequality are proposed. They consist of running specified quantum algorithms on few-qubit computers. If such a device assures entanglement and performs single-shot measurements, the detection loophole is avoided. Four concise quantum circuits determining the expectation values of the relevant observables are used for a two-qubit system. It is possible to add an ancilla qubit to these circuits and eventually only measure the ancilla to obtain the relevant information. For a four-qubit NISQ computer, two algorithms yielding the same averages, however also guaranteeing a random choice of the observable, are developed. A freedom-of-choice loophole is therefore avoided. Including an additional ancilla reduces the number of measurements by one since in this case only the ancillas need to be measured. Note that these methods, using the NISQ device, are intrinsically quantum mechanical. Locality loopholes cannot be excluded on present NISQ systems. Results of simulations on the QX simulator of Quantum Inspire are presented. The Bell inequality is indeed found to be violated, even if some additional noise is included by means of the depolarizing channel error model. The algorithms have been implemented on the IBM Q Experience as well. The results of these quantum computations support a violation of the Bell inequality by various standard deviations.
In 2017, John Preskill defined Noisy Intermediate Scale Quantum (NISQ) computers as an intermediate step on the road to large scale error corrected fault-tolerant quantum computers (FTQC). The NISQ regime corresponds to noisy qubit quantum computers with the potential to solve actual problems of some commercial value faster than conventional supercomputers, or consuming less energy. Over five years on, it is a good time to review the situation. While rapid progress is being made with quantum hardware and algorithms, and many recent experimental demonstrations, no one has yet successfully implemented a use case matching the original definition of the NISQ regime. This paper investigates the space, fidelity and time resources of various NISQ algorithms and highlights several contradictions between NISQ requirements and actual as well as future quantum hardware capabilities. It then covers various techniques which could help like qubit fidelities improvements, various breeds of quantum error mitigation methods, analog/digital hybridization, using specific qubit types like multimode photons as well as quantum annealers and analog quantum computers (aka quantum simulators or programmable Hamiltonian simulators) which seem closer to delivering useful applications although they have their own mid to longer-term scalability challenges. Given all the constraints of these various solutions, it seems possible to expect some practical use cases for NISQ systems, but with a very narrow window before various scaling issues show up. Turning to the future, a scenario can be envisioned where NISQ will not necessarily be an intermediate step on the road to FTQC. Instead, the two may develop along different paths, due to their different requirements. This leaves open a key question on the trade-offs that may be necessary to make between qubit scale and qubit fidelities in future quantum computers designs.
In recent years, Quantum Computing (QC) has progressed to the point where small working prototypes are available for use. Termed Noisy Intermediate-Scale Quantum (NISQ) computers, these prototypes are too small for large benchmarks or even for Quantum Error Correction (QEC), but they do have sufficient resources to run small benchmarks, particularly if compiled with optimizations to make use of scarce qubits and limited operation counts and coherence times. QC has not yet, however, settled on a particular preferred device implementation technology, and indeed different NISQ prototypes implement qubits with very different physical approaches and therefore widely-varying device and machine characteristics.
Gate-based quantum computing is an attractive candidate in the post-Moore era. Noisy intermediate-scale quantum (NISQ) computers are expected to be available in the next few years. It is required to repeatedly execute the target quantum application for reliable NISQ computing, e.g., users can set 1,024 as a repetition parameter in the IBM-Q machine, because NISQ computers output follows the probability distribution of execution trials. Since the distribution depends strongly on the effects of noise, it is difficult to determine a sufficient number of repetitions. This paper proposes a novel statistical approach for efficient NISQ computing. The key idea is to introduce a Bayesian credible interval model to obtain convergence of the probability distributions. We demonstrate that our execution method can detect all significant output values, that occur more often than the random situation (probability is 1/2n), using a NISQ simulator.
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.
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.