Optimization of quantum circuit mapping using gate transformation and commutation
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
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., 2020
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
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Li, G., Ding, Y., & Xie, Y. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304023 · Cited by 594
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
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
Wille, R., Burgholzer, L., & Zulehner, A. (2019) · Proceedings of the 56th Annual Design Automation Conference 2019 · doi:10.1145/3316781.3317859 · Cited by 207
Research works printed but not linked: 4
- Hirata, 2011, An efficient conversion of quantum circuits to a linear nearest neighbor architecture, Quantum Inf. Comput., 11, 142
- Saeedi, 2011, Synthesis of quantum circuits for linear nearest neighbor architectures, Quantum Inf. Process., 10, 355, 10.1007/s11128-010-0201-2 · DOI · Paper page
- Ruffinelli, 2017, Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective, Quantum Inf. Process., 16, 220, 10.1007/s11128-017-1662-3 · DOI
- Shende, 2006, Synthesis of quantum-logic circuits, IEEE Trans. Comput. Aided Des. Integr Circuits Syst., 25, 1000, 10.1109/TCAD.2005.855930 · DOI · Paper page
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
The bitter truth about gate-based quantum algorithms in the NISQ era
Leymann, F., & Barzen, J. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abae7d · Cited by 224
Challenges and Opportunities of Near-Term Quantum Computing Systems
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., McClure, D. T., Cross, A. W., Temme, K., Nation, P. D., Steffen, M., & Gambetta, J. M. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954005 · Cited by 203
A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Niu, S., Suau, A., Staffelbach, G., & Todri-Sanial, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3026544 · Cited by 103
Efficient Encoding of the Weighted MAX $$k$$-CUT on a Quantum Computer Using QAOA
Fuchs, F. G., Kolden, H. Ø., Aase, N. H., & Sartor, G. (2021) · SN Computer Science · doi:10.1007/s42979-020-00437-z · Cited by 56
MQT QMAP: Efficient Quantum Circuit Mapping
Wille, R., & Burgholzer, L. (2023) · Proceedings of the 2023 International Symposium on Physical Design · doi:10.1145/3569052.3578928 · Cited by 41
Reducing 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
Quantum circuit engineering for correcting coherent noise
Ahsan, M., Naqvi, S. A. Z., & Anwer, H. (2022) · Physical Review A · doi:10.1103/physreva.105.022428 · Cited by 22
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.
- Venue
- Integration
- Publisher
- Elsevier BV
- Published
- 2020-01
- Volume
- 70
- Pages
- 43-50
- ISSN
- 0167-9260
- Cited by
- 102
- References
- 4
- Language
- en
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
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
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.