Quantum circuit compilers using gate commutation rules
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The use of noisy intermediate-scale quantum computers (NISQCs), which consist of dozens of noisy qubits with limited coupling constraints, has been increasing. A circuit compiler, which transforms an input circuit into an equivalent output circuit conforming the coupling constraints with as few additional gates as possible, is essential for running applications on NISQCs. We propose a formulation and two algorithms exploiting gate commutation rules to obtain a better circuit compiler.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
In the citing paper
“Approaches for circuit compilation based on commutation algebra of quantum gates have been suggested in (Itoko et al. , 2020, 2019).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Itoko et al., 2019
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Siraichi, M. Y., Santos, V. F. D., Collange, C., & Pereira, F. M. Q. (2018) · Proceedings of the 2018 International Symposium on Code Generation and Optimization · doi:10.1145/3168822 · Cited by 254 · cited 2×
“We see that by fixing the layers, previous studies, such as on A ∗ search [24], mixed integer programming (MIP) [1], and dynamic programming (DP) [19], can fail to obtain optimal solutions.”
BackgroundMethod
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
Murali, P., Mckay, D. C., Martonosi, M., & Javadi-Abhari, A. (2020) · Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3373376.3378477 · Cited by 253
“Since SWAP operations are the fundamental method of communication in these systems, this large improvement impacts all programs that rely on communication [27, 43, 44, 55, 56, 58–60], especially as systems scale up.”
MethodReducing the CNOT count for Clifford+T circuits on NISQ architectures
Gheorghiu, V., Huang, J., Li, S. M., Mosca, M., & Mukhopadhyay, P. (2020) · arXiv · doi:10.48550/arxiv.2011.12191 · Cited by 31
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Cheng, C.-Y., Yang, C.-Y., Kuo, Y.-H., Wang, R.-C., Cheng, H.-C., & Huang, C.-Y. (. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680291 · Cited by 19
Metadata
- Authors
- Itoko, T., Raymond, R., Imamichi, T., Matsuo, A., & Cross, A. W.
- Venue
- Proceedings of the 24th Asia and South Pacific Design Automation Conference
- Publisher
- ACM
- Published
- 2019-01-21
- Pages
- 191-196
- OpenAlex
- W2908999967
- Cited by
- 50
- References
- 2
- FWCI
- 2.90
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum circuit compilers using gate commutation rules. https://app.cochat.ai/papers/10.1145/3287624.3287701
- The paper
- Itoko, T., Raymond, R., Imamichi, T., Matsuo, A., & Cross, A. W. (2019). Quantum circuit compilers using gate commutation rules. Proceedings of the 24th Asia and South Pacific Design Automation Conference. https://doi.org/10.1145/3287624.3287701
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.