Codar: A Contextual Duration-Aware Qubit Mapping for Various NISQ Devices

Deng, H.W.; Zhang, Yu; Li, Quanxi

doi:10.1109/dac18072.2020.9218561

Cited by 16 publications

(12 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cost computation followed the discoveries in CO-DAR [9] and computation from TOQM [29], that the execution time of single-qubit gates, double-qubit gates (CX), and SWAP gates were 1, 2, and 6, respectively. As for Ratio, we defined it as 𝐶 𝑃𝑟𝑜𝑝𝑜𝑠𝑒𝑑 /𝐶 𝐼𝑑𝑒𝑎𝑙 , where Ideal represents Table 2.…”

Section: Methodsmentioning

confidence: 92%

See 1 more Smart Citation

Qubit Mapping Toward Quantum Advantage

Cheng¹,

Yang²,

Wang³

et al. 2022

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Methodsmentioning

confidence: 92%

“…However, in reality, the circuit depth is not precise enough. Deng et al [9] proposed CODAR 2 specifically for the total circuit execution time. They first introduced the concept of lock time for the busy qubits.…”

Section: Introductionmentioning

confidence: 99%

Qubit Mapping Toward Quantum Advantage

Cheng¹,

Yang²,

Wang³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…These heuristic algorithms can be further classified according to their optimisation objective. A few algorithms aim to maximise the fidelity or minimise the error rate [15], [2], [26], [9]; many aim to reduce the number of SWAP gates inserted [34], [11], [12], [33], [31]; and many others aim to reduce the depth of the output circuit [7], [30], [32] so that the highly limited qubit coherence time is respected.…”

Section: Related Workmentioning

confidence: 99%

“…This critical procedure is known as quantum circuit transformation (QCT), qubit mapping, or layout synthesis, and is in a sense analogous to the classical layout synthesis task. QCT is an important component of quantum circuit compilation and has attracted broad interests from areas like quantum computing [4], [7], [17], [21], [28], electronic design automation [2], [9], [10], [24], [29], [31], [32], [33], [34], and computer architecture [11], [13], [15], [16], [26], [30]. In this paper, we address this procedure as, interchangeably, qubit mapping and (quantum) circuit transformation.…”

Section: Introductionmentioning

confidence: 99%

On constructing benchmark quantum circuits with known near-optimal transformation cost

Li¹,

Zhou²,

Feng³

2023

Preprint

View full text Add to dashboard Cite

Current quantum devices impose strict connectivity constraints on quantum circuits, making circuit transformation necessary before running logical circuits on real quantum devices. Many quantum circuit transformation (QCT) algorithms have been proposed in the past several years. This paper proposes a novel method for constructing benchmark circuits and uses these benchmark circuits to evaluate state-of-the-art QCT algorithms, including t|ket from Cambridge Quantum Computing, Qiskit from IBM, and three academic algorithms SABRE, SAHS, and MCTS. These benchmarks have known near-optimal transformation costs and thus are called QUEKNO (for quantum examples with known near-optimality). Compared with QUEKO benchmarks designed by Tan and Cong ( 2021), which all have zero optimal transformation costs, QUEKNO benchmarks are more general and can provide a more faithful evaluation for QCT algorithms (like t|ket ) which use subgraph isomorphism to find the initial mapping. Our evaluation results show that SABRE can generate transformations with conspicuously low average costs on the 53-qubit IBM Q Rochester and Google's Sycamore in both gate size and depth objectives.

show abstract

“…Quantum error correction [27] requires significant qubit overhead (e.g., 18X extra qubits in the surface code [19]). Furthermore, quantum computing researchers have studied methods of optimizing the mapping from logical qubits to more reliable physical qubits by considering the noise of physical qubits [15,36]. Ash-Saki et al [6] provided an approach where high-quality qubits are prioritized for mapping.…”

Section: Reliability Improvement In Quantum Computingmentioning

confidence: 99%

VACSEN: A Visualization Approach for Noise Awareness in Quantum Computing

Ruan¹,

Wang²,

Jiang³

et al. 2022

Preprint

View full text Add to dashboard Cite

A1 C1 Fig. 1: The interface of VACSEN makes users aware of the quantum noise via three linked views (A-C). Computer Evolution View (A) allows the assessment for all quantum computers based on a temporal analysis for multiple performance metrics. Circuit Filtering View (B) supports the filtering for the potential optimal compiled circuits. Circuit Comparison View (C) supports the in-depth comparison regarding the performance of qubits or quantum gates and corresponding usages. The control panel (D) allows users to interactively configure the settings of VACSEN. Fidelity Comparison View (E) shows the fidelity distribution of each compiled circuit. Probability Distribution View (F) visualizes the results of state distribution of a quantum circuit execution.

show abstract

Codar: A Contextual Duration-Aware Qubit Mapping for Various NISQ Devices

Cited by 16 publications

References 28 publications

Qubit Mapping Toward Quantum Advantage

Qubit Mapping Toward Quantum Advantage

On constructing benchmark quantum circuits with known near-optimal transformation cost

VACSEN: A Visualization Approach for Noise Awareness in Quantum Computing

Contact Info

Product

Resources

About