Cited by 74Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyParallel Computing and Optimization Techniques

Time-optimal Qubit mapping

Zhang, Chi, Hayes, Ari B., Qiu, Longfei, Jin, Yuwei, Chen, Yanhao, Zhang, Eddy Z.·2021·Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

Abstract

Rapid progress in the physical implementation of quantum computers gave birth to multiple recent quantum machines implemented with superconducting technology. In these NISQ machines, each qubit is physically connected to a bounded number of neighbors. This limitation prevents most quantum programs from being directly executed on quantum devices. A compiler is required for converting a quantum program to a hardware-compliant circuit, in particular, making each two-qubit gate executable by mapping the two logical qubits to two physical qubits with a link between them. To solve this problem, existing studies focus on inserting SWAP gates to dynamically remap logical qubits to physical qubits. However, most of the schemes lack the consideration of time-optimality of generated quantum circuits, or are achieving time-optimality with certain constraints. In this work, we propose a theoretically time-optimal SWAP insertion scheme for the qubit mapping problem. Our model can also be extended to practical heuristic algorithms. We present exact analysis results by using our model for quantum programs with recurring execution patterns. We have for the first time discovered an optimal qubit mapping pattern for quantum fourier transformation (QFT) on 2D nearest neighbor architecture. We also present a scalable extension of our theoretical model that can be used to solve qubit mapping for large quantum circuits.

Integrity signals

Registry

Crossref · 10.1145/3445814.3446706

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhang, C., Hayes, A. B., Qiu, L., Jin, Y., Chen, Y., & Zhang, E. Z.
Affiliations
  • University of Pittsburgh (US)
  • Rutgers, The State University of New Jersey (US)
Venue
Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems
Publisher
ACM
Published
2021-04-17
Pages
360-374
OpenAlex
W3154532826
Cited by
74
References
18
Citations by year
2026: 6 · 2025: 21 · 2024: 21 · 2023: 14 · 2022: 8 · 2021: 3 · 2020: 1
FWCI
5.31
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (publishedVersion)
Funders
NSF (National Science Foundation) (NSF-CCF-1628401)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
Keywords
qubit mapping, quantum circuit compilation, NISQ devices, superconducting quantum computing, quantum Fourier transform

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review