The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
Open accessAbstract
In the past years, quantum computers more and more have evolved from an academic idea to an upcoming reality. IBM's project IBM Q can be seen as evidence of this progress. Launched in March 2017 with the goal to provide access to quantum computers for a broad audience, this allowed users to conduct quantum experiments on a 5-qubit and, since June 2017, also on a 16-qubit quantum computer (called IBM QX2 and IBM QX3, respectively). Revised versions of these 5- and 16-qubit quantum computers (named IBM QX4 and IBM QX5, respectively) are available since September 2017. In order to use these, the desired quantum functionality (e.g., provided in terms of a quantum circuit) has to be properly mapped so that the underlying physical constraints are satisfied-a complex task. This demands solutions to automatically and efficiently conduct this mapping process. In this paper, we propose a methodology which addresses this problem, i.e., maps the given quantum functionality to a realization which satisfies all constraints given by the architecture and, at the same time, keeps the overhead in terms of additionally required quantum gates minimal. The proposed methodology is generic, can easily be configured for similar future architectures, and is fully integrated into IBM's SDK. Experimental evaluations show that the proposed approach clearly outperforms IBM's own mapping solution. In fact, for many quantum circuits, the proposed approach determines a mapping to the IBM architecture within minutes, while IBM's solution suffers from long runtimes and runs into a timeout of 1 h in several cases. As an additional benefit, the proposed approach yields mapped circuits with smaller costs (i.e., fewer additional gates are required). All implementations of the proposed methodology are publicly available at http://iic.jku.at/eda/research/ibm_qx_mapping.
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 Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
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
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549 · cited 5×
“For the Clifford + T library, Matsumoto and Amano [12] developed a normal form for single qubit operations, which allows for a unique and T-depth optimal decomposition (approximation) of arbitrary single qubit gates (e.g., rotations) into a sequence of Clifford+T gates (up to a certain error (cid:6) ).”
BackgroundInfluentialRevLib: An Online Resource for Reversible Functions and Reversible Circuits
Wille, R., Gro, D., Teuber, L., Dueck, G. W., & Drechsler, R. (2008) · 38th International Symposium on Multiple Valued Logic (ismvl 2008) · doi:10.1109/ismvl.2008.43 · Cited by 495
Self-citationA transformation based algorithm for reversible logic synthesis
Miller, D. M., Maslov, D., & Dueck, G. W. (2003) · Proceedings of the 40th annual Design Automation Conference · doi:10.1145/775832.775915 · Cited by 493
A blueprint for demonstrating quantum supremacy with superconducting qubits
Neill, C., Roushan, P., Kechedzhi, K., Boixo, S., Isakov, S. V., Smelyanskiy, V., Megrant, A., Chiaro, B., Dunsworth, A., Arya, K., et al. (2018) · Science · doi:10.1126/science.aao4309 · Cited by 458
A new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344
Quipper: a scalable quantum programming language
Green, A. S., Lumsdaine, P. L., Ross, N. J., Selinger, P., & Valiron, B. (2013) · Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2491956.2462177 · Cited by 334
Open Quantum Assembly Language
Cross, A. W., Bishop, L. S., Smolin, J. A., & Gambetta, J. M. (2017) · arXiv · doi:10.48550/arxiv.1707.03429 · Cited by 310
Synthesis of quantum circuits for linear nearest neighbor architectures
Saeedi, M., Wille, R., & Drechsler, R. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0201-2 · Cited by 212
Self-citationElementary Quantum Gate Realizations for Multiple-Control Toffoli Gates
Miller, D. M., Wille, R., & Sasanian, Z. (2011) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2011.54 · Cited by 193
Self-citationCompiling quantum circuits to realistic hardware architectures using temporal planners
Venturelli, D., Do, M., Rieffel, E. G., & Frank, J. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aaa331 · Cited by 159
(2014) · doi:10.1145/2597917.2597939 · Cited by 152
Efficient mapping of quantum circuits to the IBM QX architectures
Zulehner, A., Paler, A., & Wille, R. (2018) · Design, Automation, and Test in Europe · doi:10.23919/date.2018.8342181 · Cited by 145
Self-citationOptimization of quantum circuits for interaction distance in linear nearest neighbor architectures
Shafaei, A., Saeedi, M., & Pedram, M. (2013) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2463209.2488785 · Cited by 127
Qubit placement to minimize communication overhead in 2D quantum architectures
Shafaei, A., Saeedi, M., & Pedram, M. (2014) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2014.6742940 · Cited by 121
Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits
Wille, R., Keszöcze, O., Walter, M., Rohrs, P., Chattopadhyay, A., & Drechsler, R. (2016) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2016.7428026 · Cited by 120
Self-citationScaffold: Quantum Programming Language
Javadi-Abhari, A., Faruque, A. I., Dousti, M. J., Svec, L., Catu, O., Chakrabati, A., Chiang, C.-F., Vanderwilt, S., Black, J., & Chong, F. T. (2012) · Cited by 119
RevKit: A Toolkit for Reversible Circuit Design
Soeken, M., Frehse, S., Wille, R., & Drechsler, R. (2012) · Cited by 110
Self-citationExact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures
Wille, R., Lye, A., & Drechsler, R. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2356463 · Cited by 99
Self-citationA functional architecture for scalable quantum computing
Sete, E. A., Zeng, W. J., & Rigetti, C. T. (2016) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2016.7738703 · Cited by 90
One-pass Design of Reversible Circuits: Combining Embedding and Synthesis for Reversible Logic
Zulehner, A., & Wille, R. (2017) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2017.2729468 · Cited by 80
Self-citationRepresentation of Quantum Circuits with Clifford and $π/8$ GatesPreprint
Matsumoto, K., & Amano, K. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.3834 · Cited by 76
Improving the mapping of reversible circuits to quantum circuits using multiple target lines
Wille, R., Soeken, M., Otterstedt, C., & Drechsler, R. (2013) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2013.6509587 · Cited by 64
Self-citationGoogle aims for quantum computing supremacy [News]
Courtland, R. E. (2017) · IEEE Spectrum · doi:10.1109/mspec.2017.7934217 · Cited by 41
Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A $$^{*}$$
Zulehner, A., Gasser, S., & Wille, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59936-6_15 · Cited by 36
Self-citationUsing $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits
Wille, R., Quetschlich, N., Inoue, Y., Yasuda, N., & Minato, S.-I. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-40578-0_14 · Cited by 15
Self-citation
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
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475
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
Differentiable learning of quantum circuit Born machines
Liu, J.-G., & Wang, L. (2018) · Physical Review A · doi:10.1103/physreva.98.062324 · Cited by 279
Towards a distributed quantum computing ecosystem
Cuomo, D., Caleffi, M., & Cacciapuoti, A. S. (2020) · IET Quantum Communication · doi:10.1049/iet-qtc.2020.0002 · Cited by 265
Metadata
- Authors
- Zulehner, A., Paler, A., & Wille, R.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2019-07
- Volume
- 38
- Issue
- 7
- Pages
- 1226-1236
- ISSN
- 0278-0070 (ISSN-L)
- 1937-4151
- OpenAlex
- W2786476345
- Cited by
- 372
- References
- 33
- FWCI
- 18.81
- 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
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.