The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Synthesis of quantum circuits for linear nearest neighbor architectures
Open accessAbstract
While a couple of impressive quantum technologies have been proposed, they have several intrinsic limitations which must be considered by circuit designers to produce realizable circuits. Limited interaction distance between gate qubits is one of the most common limitations. In this paper, we suggest extensions of the existing synthesis flow aimed to realize circuits for quantum architectures with linear nearest neighbor interaction. To this end, a template matching optimization, an exact synthesis approach, and two reordering strategies are introduced. The proposed methods are combined as an integrated synthesis flow. Experiments show that by using the suggested flow, quantum cost can be improved by more than 50% on average.
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.
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 Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Shor's algorithm on a nearest-neighbor machine
Kutin, S. A. (2006) · arXiv · doi:10.48550/arxiv.quant-ph/0609001 · Cited by 47
Cited by
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
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
Murali, P., Baker, J. M., Javadi-Abhari, A., Chong, F. T., & Martonosi, M. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304075 · Cited by 411
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
Zulehner, A., Paler, A., & Wille, R. (2019) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2846658 · Cited by 372
Self-citationSynthesis and optimization of reversible circuits—a survey
Saeedi, M., & Markov, I. L. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431220 · Cited by 298
Self-citationA 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
“Most of the previous works [23]–[27] using the second method only adapt for nearest-neighbor connectivity and cannot be directly applicable to actual quantum architectures with nonuniform connections.”
Method
Metadata
- Authors
- Saeedi, M., Wille, R., & Drechsler, R.
- Venue
- Quantum Information Processing
- Published
- 2010-10-19
- Volume
- 10
- Issue
- 3
- Pages
- 355-377
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W2023675295
- Cited by
- 212
- References
- 5
- FWCI
- 8.50
- Type
- journal article
- Language
- en
- Open access
- green
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: Synthesis of quantum circuits for linear nearest neighbor architectures. https://app.cochat.ai/papers/10.1007/s11128-010-0201-2
- The paper
- Saeedi, M., Wille, R., & Drechsler, R. (2011). Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Information Processing. https://doi.org/10.1007/s11128-010-0201-2
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.