Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation

Quantum computing is a game-changing technology for global academia, research centers and industries including computational science, mathematics, fnance, pharmaceutical, materials science, chemistry and cryptography. Although it has seen a major boost in the last decade, we are still a long way from reaching the maturity of a full-fedged quantum computer. That said, we will be in the noisy-intermediate scale quantum(NISQ) era for a long time, working on dozens or even thousands of qubits quantum computing systems. An outstanding challenge, then, is to come up with an application that can reliably carry out a nontrivial task of interest on the near-term quantum devices with non-negligible quantum noise. To address this challenge, several nearterm quantum computing techniques, including variational quantum algorithms, error mitigation, quantum circuit compilation and benchmarking protocols, have been proposed to characterize and mitigate errors, and to implement algorithms with a certain resistance to noise, so as to enhance the capabilities of near-term quantum devices and explore the boundaries of their ability to realize useful applications. Besides, the development of near-term quantum devices is inseparable from the efcient classical simulation, which plays a vital role in quantum algorithm design and verifcation, error-tolerant verifcation and other applications.This review will provide a thorough introduction of these near-term quantum computing techniques, report on their progress, and fnally discuss the future prospect of these techniques, which we hope will motivate researchers to undertake additional studies in this field.