Qubit Mapping Toward Quantum Advantage

Abstract

Qubit Mapping is a pivotal stage in quantum compilation flow. Its goal is to convert logical circuits into physical circuits so that a quantum algorithm can be executed on realworld non-fully connected quantum devices. Qubit Mapping techniques nowadays still lack the key to quantum advantage, scalability. Several studies have proved that at least thousands of logical qubits are required to achieve quantum computational advantage. However, to our best knowledge, there is no previous research with the ability to solve the qubit mapping problem with the necessary number of qubits for quantum advantage in a reasonable time. In this work, we provide the first qubit mapping framework with the scalability to achieve quantum advantage while accomplishing a fairly good performance. The framework also boasts its flexibility for quantum circuits of different characteristics. Experimental results show that the proposed mapping method outperforms the state-of-the-art methods on quantum circuit benchmarks by improving over 5% of the cost complexity in one-tenth of the program running time. Moreover, we demonstrate the scalability of our method by accomplishing mapping of an 11,969-qubit Quantum Fourier Transform within five hours.

Suppression of Crosstalk in Quantum Computers Based on Instruction Exchange Rules and Duration

“…The CONT in quantum circuits do not exist independently, and a double quantum gate i G occupies qubits i q j q and can only be executed after all the double quantum gates j G have been executed before, which is called i G depend on j G . Traverse the whole quantum circuit and construct a directed acyclic graph (DAG) according to this dependency, called a relational dependency graph [11], to represent the dependency between two quantum gates in the quantum circuit. Its complexity is ( ) O g .…”

Suppression of Crosstalk in Quantum Circuit Based on Instruction Exchange Rules and Duration

“…The gates in the quantum circuit do not exist independently, and a double quantum gate occupying qubits and can only be executed after all previous double quantum gates have been executed, which is called depend on [ 28 ]. Traverse the whole quantum circuit, and construct a directed acyclic graph (DAG) according to this dependency, called relational dependency graph [ 29 ], to represent the dependency between two quantum gates in the quantum circuit. Its time complexity is .…”