Abstract

The concept of quantum computing has inspired a whole new generation of scientists, including physicists, engineers, and computer scientists, to fundamentally change the landscape of information technology. With experimental demonstrations stretching back more than two decades, the quantum computing community has achieved a major milestone over the past few years: the ability to build systems that are stretching the limits of what can be classically simulated, and which enable cloud-based research for a wide range of scientists, thus increasing the pool of talent exploring early quantum systems. While such noisy near-term quantum computing systems fall far short of the requirements for fault-tolerant systems, they provide unique testbeds for exploring the opportunities for quantum applications. Here we highlight the facets associated with these systems, including quantum software, cloud access, benchmarking quantum systems, error correction and mitigation in such systems, and understanding the complexity of quantum circuits and how early quantum applications can run on near term quantum computers.

Highlights

  • Quantum computers can potentially solve problems that are considered intractable on even the fastest classical computers [1]–[6]

  • Considering that quantum states are written as wave functions, classical interference is a reasonable analog: wave functions are steered to the correct answer through constructive interference

  • Wave functions that do not correspond to the Córcoles et al.: Challenges and Opportunities of Near-Term Quantum Computing Systems correct answer vanish by destructive interference

Read more

Summary

INTRODUCTION

Quantum computers can potentially solve problems that are considered intractable on even the fastest classical computers [1]–[6]. By applying QEC schemes, the logical qubit error rates can be arbitrarily suppressed, provided physical error rates are below a threshold to enable fault-tolerant quantum computing [11]–[14]. In this context, many quantum codes and techniques have been invented [15]. Because simulating the full dynamics of quantum computers quickly becomes intractable as more qubits are added, QEC codes have been studied assuming simplified noise models, such as the Pauli noise These simulations, together with assumptions about what is experimentally feasible, provide estimates of what would be required to operate various quantum algorithms using fully fault-tolerant computation [16]–[19].

CLOUDQUANTUMSYSTEMSAND USER ACCESS LEVELS
Qiskit Architecture
Compiling for Near-Term Machines
ERRORMITIGATIONAND CORRECTION
Quantum Machine Learning
Quantum Chemistry
VIII. CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call