research-article

Compiling SU(4) quantum circuits to IBM QX architectures

Authors:

Alwin Zulehner,

Robert WilleAuthors Info & Claims

ASPDAC '19: Proceedings of the 24th Asia and South Pacific Design Automation Conference

Pages 185 - 190

https://doi.org/10.1145/3287624.3287704

Published: 21 January 2019 Publication History

Abstract

The Noisy Intermediate-Scale Quantum (NISQ) technology is currently investigated by major players in the field to build the first practically useful quantum computer. IBM QX architectures are the first ones which are already publicly available today. However, in order to use them, the respective quantum circuits have to be compiled for the respectively used target architecture. While first approaches have been proposed for this purpose, they are infeasible for a certain set of SU(4) quantum circuits which have recently been introduced to benchmark corresponding compilers. In this work, we analyze the bottlenecks of existing compilers and provide a dedicated method for compiling this kind of circuits to IBM QX architectures. Our experimental evaluation (using tools provided by IBM) shows that the proposed approach significantly outperforms IBM's own solution regarding fidelity of the compiled circuit as well as runtime. Moreover, the solution proposed in this work has been declared winner of the IBM QISKit Developer Challenge. An implementation of the proposed methodology is publicly available at http://iic.jku.at/eda/research/ibm_qx_mapping.

References

[1]

IBM Q. https://www.research.ibm.com/ibm-q/. Accessed: 2017-09-15.

[2]

IBM QX backend information. https://github.com/QISKit/ibmqx-backend-information. Accessed: 2017-09-15.

[3]

IBM QX Devices. https://quantumexperience.ng.bluemix.net/qx/devices. Accessed: 2018-06-27.

[4]

QISKit Developer Challenge. https://qx-awards.mybluemix.net/#qiskitDeveloperChallengeAward. Accessed: 2018-06-27.

[5]

QISKit Python SDK. https://github.com/QISKit/qiskit-sdk-py. Accessed: 2017-09-15.

[6]

A. J. Abhari, A. Faruque, M. J. Dousti, L. Svec, O. Catu, A. Chakrabati, C.-F. Chiang, S. Vanderwilt, J. Black, and F. Chong. Scaffold: Quantum programming language. Technical report, Princeton univ nj dept of computer science, 2012.

[7]

M. Amy, D. Maslov, M. Mosca, and M. Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. on CAD of Integrated Circuits and Systems, 32(6):818--830, 2013.

Digital Library

[8]

A. Barenco, C. H. Bennett, R. Cleve, D. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. Elementary gates for quantum computation. The American Physical Society, 52:3457--3467, 1995.

[9]

D. Bhattacharjee and A. Chattopadhyay. Depth-optimal quantum circuit placement for arbitrary topologies. arXiv preprint arXiv:1703.08540, 2017.

[10]

P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan. A new universal and fault-tolerant quantum basis. Information Processing Letters, 75(3):101--107, 2000.

Digital Library

[11]

R. Courtland. Google aims for quantum computing supremacy. IEEE Spectrum, 54(6):9--10, 2017.

Digital Library

[12]

A. W. Cross, L. S. Bishop, J. A. Smolin, and J. M. Gambetta. Open quantum assembly language. arXiv preprint arXiv:1707.03429, 2017.

[13]

A. G. Fowler, S.J. Devitt, and L. C. Hollenberg. Implementation of Shor's algorithm on a linear nearest neighbour qubit array. arXiv preprint quant-ph/0402196, 2004.

Digital Library

[14]

L. Gomes. Quantum computing: Both here and not here. IEEE Spectrum April 2018.

[15]

A. S. Green, P. L. Lumsdaine, N.J. Ross, P. Selinger, and B. Valiron. Quipper: a scalable quantum programming language. In Conf. on Programming Language Design and Implementation, pages 333--342, 2013.

Digital Library

[16]

J. Hsu. CES 2018: Intel's 49-qubit chip shoots for quantum supremacy. IEEE Spectrum Tech Talk, 2018.

[17]

K. Matsumoto and K. Amano. Representation of quantum circuits with Clifford and π/8 gates. arXiv preprint arXiv:0806.3834, 2008.

[18]

D. M. Miller, R. Wille, and Z. Sasanian. Elementary quantum gate realizations for multiple-control Toffolli gates. In Int'l Symp. on Multi-Valued Logic, pages 288--293, 2011.

Digital Library

[19]

J. Preskill. Quantum computing in the NISQ era and beyond. arXiv preprint arXiv:1801.00862, 2018.

[20]

E. A. Sete, W. J. Zeng, and C. T. Rigetti. A functional architecture for scalable quantum computing. In Int'l Conf. on Rebooting Computing (ICRC), pages 1--6, 2016.

[21]

A. Shafaei, M. Saeedi, and M. Pedram. Qubit placement to minimize communication overhead in 2d quantum architectures. In Asia and South Pacific Design Automation Conf., pages 495--500, 2014.

[22]

M. Siraichi, V. F. Dos Santos, S. Collange, and F. M. Q. Pereira. Qubit allocation. In CGO 2018-IEEE/ACM International Symposium on Code Generation and Optimization, pages 1--12, 2018.

Digital Library

[23]

F. Vatan and C. Williams. Optimal quantum circuits for general two-qubit gates. Physical Review A, 69(3):032315, 2004.

[24]

D. Venturelli, M. Do, E. Rieffel, and J. Frank. Compiling quantum circuits to realistic hardware architectures using temporal planners. Quantum Science and Technology, 3(2):025004, 2018.

[25]

R. Wille, O. Keszocze, M. Walter, P. Rohrs, A. Chattopadhyay, and R. Drechsler. Look-ahead schemes for nearest neighbor optimization of 1d and 2d quantum circuits. In Asia and South Pacific Design Automation Conf., pages 292--297, 2016.

[26]

R. Wille, A. Lye, and R. Drechsler. Exact reordering of circuit lines for nearest neighbor quantum architectures. IEEE Trans. on CAD of Integrated Circuits and Systems, 33(12):1818--1831, 2014.

[27]

R. Wille, M. Soeken, C. Otterstedt, and R. Drechsler. Improving the mapping of reversible circuits to quantum circuits using multiple target lines. In Asia and South Pacific Design Automation Conf., pages 85--92, 2013.

[28]

A. Zulehner, S. Gasser, and R. Wille. Exact global reordering for nearest neighbor quantum circuits using A<sup>*</sup>. In Int'l Conf. of Reversible Computation, pages 185--201. Springer, 2017.

[29]

A. Zulehner, A. Paler, and R. Wille. An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. on CAD of Integrated Circuits and Systems, 2018.

Cited By

Sengupta ABhattacharjee D(2024)Quantum ProgramQuantum Computing and Cryptography in Future Computers10.4018/978-1-7998-9522-0.ch006(181-208)Online publication date: 26-Jul-2024
https://doi.org/10.4018/978-1-7998-9522-0.ch006
Tan DBluvstein DLukin MCong J(2024)Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array ProcessorsQuantum10.22331/q-2024-03-14-12818(1281)Online publication date: 14-Mar-2024
https://doi.org/10.22331/q-2024-03-14-1281
Wiersema RLewis DWierichs DCarrasquilla JKilloran N(2024)Here comes the SU(N): multivariate quantum gates and gradientsQuantum10.22331/q-2024-03-07-12758(1275)Online publication date: 7-Mar-2024
https://doi.org/10.22331/q-2024-03-07-1275
Show More Cited By

Recommendations

Quantum bit commitment on IBM QX
Abstract
Quantum bit commitment (QBC) is a quantum version of the classical bit commitment security primitive. As other quantum security primitives and protocols, QBC improves on cheating detection over its classical counterpart. The implementation of the ... $^{}$
Commuting quantum circuits: efficient classical simulations versus hardness results

The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine quantum effects ...
Quantum circuits and spin(3n) groups

All quantum gates with one and two qubits may be described by elements of Spin groups due to isomorphisms Spin(3) ≃ SU(2) and Spin(6) ≃ SU(4). However, the group of n-qubit gates SU(2ⁿ) for n > 2 has bigger dimension than Spin(3n). A quantum circuit ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

ASPDAC '19: Proceedings of the 24th Asia and South Pacific Design Automation Conference

January 2019

794 pages

ISBN:9781450360074

DOI:10.1145/3287624

General Chair:
Toshiyuki Shibuya
Fujitsu Laboratories

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGDA: ACM Special Interest Group on Design Automation

In-Cooperation

IEICE ESS: Institute of Electronics, Information and Communication Engineers, Engineering Sciences Society
IEEE CAS
IEEE CEDA
IPSJ SIG-SLDM: Information Processing Society of Japan, SIG System LSI Design Methodology

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 January 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

ASPDAC '19

Sponsor:

SIGDA

ASPDAC '19: 24th Asia and South Pacific Design Automation Conference

January 21 - 24, 2019

Tokyo, Japan

Acceptance Rates

Overall Acceptance Rate 466 of 1,454 submissions, 32%

Upcoming Conference

ASPDAC '25

Sponsor:
sigda

30th Asia and South Pacific Design Automation Conference

January 20 - 23, 2025

Tokyo , Japan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

74
Total Citations
View Citations
387
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)4

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sengupta ABhattacharjee D(2024)Quantum ProgramQuantum Computing and Cryptography in Future Computers10.4018/978-1-7998-9522-0.ch006(181-208)Online publication date: 26-Jul-2024
https://doi.org/10.4018/978-1-7998-9522-0.ch006
Tan DBluvstein DLukin MCong J(2024)Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array ProcessorsQuantum10.22331/q-2024-03-14-12818(1281)Online publication date: 14-Mar-2024
https://doi.org/10.22331/q-2024-03-14-1281
Wiersema RLewis DWierichs DCarrasquilla JKilloran N(2024)Here comes the SU(N): multivariate quantum gates and gradientsQuantum10.22331/q-2024-03-07-12758(1275)Online publication date: 7-Mar-2024
https://doi.org/10.22331/q-2024-03-07-1275
LUKAC MNURSULTAN SKRYLOV GKESZOCZE ORAKHMETTULAYEV AKAMEYAMA M(2024)Geometric Refactoring of Quantum and Reversible Circuits Using Graph AlgorithmsIEICE Transactions on Information and Systems10.1587/transinf.2023LOP0011E107.D:8(930-939)Online publication date: 1-Aug-2024
https://doi.org/10.1587/transinf.2023LOP0011
Cheng CYang CKuo YWang RCheng HHuang C(2024)Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum CircuitsACM Transactions on Quantum Computing10.1145/36802915:3(1-26)Online publication date: 19-Sep-2024
https://dl.acm.org/doi/10.1145/3680291
Quetschlich NBurgholzer LWille R(2024)MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum ComputingACM Transactions on Quantum Computing10.1145/3673241Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3673241
Guo ZWang THui-Ru Jiang IPosser G(2024)SMT-Based Layout Synthesis Approaches for Quantum CircuitsProceedings of the 2024 International Symposium on Physical Design10.1145/3626184.3633316(235-243)Online publication date: 12-Mar-2024
https://dl.acm.org/doi/10.1145/3626184.3633316
Quetschlich NKiwit FWolf MRiofrio CBurgholzer LLuckow AWille R(2024)Towards Application-Aware Quantum Circuit Compilation2024 IEEE International Conference on Quantum Software (QSW)10.1109/QSW62656.2024.00028(135-142)Online publication date: 7-Jul-2024
https://doi.org/10.1109/QSW62656.2024.00028
Wille RBerent LForster TKunasaikaran JMato KPeham TQuetschlich NRovara DSander ASchmid LSchönberger DStade YBurgholzer L(2024)The MQT Handbook : A Summary of Design Automation Tools and Software for Quantum Computing2024 IEEE International Conference on Quantum Software (QSW)10.1109/QSW62656.2024.00013(1-8)Online publication date: 7-Jul-2024
https://doi.org/10.1109/QSW62656.2024.00013
Kole ADatta KDrechsler R(2024)Design Automation Challenges and Benefits of Dynamic Quantum Circuit in Present NISQ Era and Beyond: (Invited Paper)2024 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)10.1109/ISVLSI61997.2024.00114(601-606)Online publication date: 1-Jul-2024
https://doi.org/10.1109/ISVLSI61997.2024.00114
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents