Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3489517.3530654acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article
Open access

Optimizing quantum circuit synthesis for permutations using recursion

Published: 23 August 2022 Publication History

Abstract

We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a non-scalable, yet exact, synthesis.

References

[1]
N. Alon, F. R. K. Chung, and R. L. Graham. 1993. Routing permutations on graphs via matchings. In STOC '93.
[2]
Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov, Samuel King, Eddie Schoute, and Hrishee Shastri. 2021. Quantum routing with fast reversals. Quantum 5 (Aug. 2021), 533.
[3]
Ethan Bernstein and Umesh Vazirani. 1997. Quantum complexity theory. SIAM Journal on computing 26, 5 (1997), 1411--1473.
[4]
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, and Cyril Allouche. 2021. Reducing the Depth of Linear Reversible Quantum Circuits. IEEE Transactions on Quantum Engineering 2 (2021), 1--22.
[5]
Janka Chlebíková. 1996. Approximating the maximally balanced connected partition problem in graphs. Inform. Process. Lett. 60, 5 (1996), 225--230.
[6]
Andrew W. Cross, Lev S. Bishop, Sarah Sheldon, Paul D. Nation, and Jay M. Gambetta. 2019. Validating quantum computers using randomized model circuits. Physical Review A 100, 3 (Sep 2019).
[7]
Vlad Gheorghiu, Sarah Meng Li, Michele Mosca, and Priyanka Mukhopadhyay. 2021. Reducing the CNOT count for Clifford+T circuits on NISQ architectures. arXiv:2011.12191 [quant-ph]
[8]
Aleks Kissinger and Arianne Meijer van de Griend. 2019. CNOT circuit extraction for topologically-constrained quantum memories. arXiv:1904.00633 [quant-ph]
[9]
Samuel Kutin, David Moulton, and Lawren Smithline. 2007. Computation at a distance. Chicago Journal of Theoretical Computer Science 13 (02 2007).
[10]
Ketan N Patel, Igor L Markov, and John P Hayes. 2008. Optimal synthesis of linear reversible circuits. Quantum Inf. Comput. 8, 3 (2008), 282--294.
[11]
Bruno Schmitt. 2021. tweedledum. https://github.com/boschmitt/tweedledum.
[12]
Bruno Schmitt, Mathias Soeken, and Giovanni De Micheli. 2020. Symbolic Algorithms for Token Swapping. In 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL). 28--33.
[13]
Eddie Schoute. 2019. arct. https://gitlab.umiacs.umd.edu/amchilds/arct.
[14]
P.W. Shor. 1994. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science. 124--134.
[15]
Bujiao Wu, Xiaoyu He, Shuai Yang, Lifu Shou, Guojing Tian, Jialin Zhang, and Xiaoming Sun. 2019. Optimization of CNOT circuits on topological superconducting processors. arXiv:1910.14478 [quant-ph]
[16]
Katsuhisa Yamanaka, Erik D Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno. 2015. Swapping labeled tokens on graphs. Theoretical Computer Science 586 (2015), 81--94.
[17]
Louxin Zhang. 1997. Optimal Bounds for Matching Routing on Trees. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.

Cited By

View all
  • (2023)Lightning Talk: Scaling Up Quantum Compilation – Challenges and Opportunities2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247677(1-2)Online publication date: 9-Jul-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DAC '22: Proceedings of the 59th ACM/IEEE Design Automation Conference
July 2022
1462 pages
ISBN:9781450391429
DOI:10.1145/3489517
This work is licensed under a Creative Commons Attribution International 4.0 License.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 August 2022

Check for updates

Qualifiers

  • Research-article

Funding Sources

  • U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Co-Design Center for Quantum Advantage

Conference

DAC '22
Sponsor:
DAC '22: 59th ACM/IEEE Design Automation Conference
July 10 - 14, 2022
California, San Francisco

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25
62nd ACM/IEEE Design Automation Conference
June 22 - 26, 2025
San Francisco , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)507
  • Downloads (Last 6 weeks)81
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Lightning Talk: Scaling Up Quantum Compilation – Challenges and Opportunities2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247677(1-2)Online publication date: 9-Jul-2023

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media