The bitter truth about gate-based quantum algorithms in the NISQ era. (1st September 2020)

• Record Type: Journal Article
• Authors: Leymann, Frank; Barzen, Johanna
• Is Part Of: Quantum science and technology. Volume 5:Number 4(2020)
• Publication Date: 2020-09-01
• Subjects: quantum software -- quantum computing -- NISQ -- software engineering of quantum applications; Quantum theory -- Periodicals; Quantum theory; Periodicals; 530
• DOI: 10.1088/2058-9565/abae7d
• Languages: English
• ISSNs: 2058-9565

Abstract

Abstract: Implementing a gate-based quantum algorithm on an noisy intermediate scale quantum (NISQ) device has several challenges that arise from the fact that such devices are noisy and have limited quantum resources. Thus, various factors contributing to the depth and width as well as to the noise of an implementation of a gate-based algorithm must be understood in order to assess whether an implementation will execute successfully on a given NISQ device. In this contribution, we discuss these factors and their impact on algorithm implementations. Especially, we will cover state preparation, oracle expansion, connectivity, circuit rewriting, and readout: these factors are very often ignored when presenting a gate-based algorithm but they are crucial when implementing such an algorithm on near-term quantum computers. Our contribution will help developers in charge of realizing gate-based algorithms on such machines in (i) achieving an executable implementation, and (ii) assessing the success of their implementation on a given machine.