skip to main content
10.1145/3489517.3530483acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article

A bridge-based algorithm for simultaneous primal and dual defects compression on topologically quantum-error-corrected circuits

Published: 23 August 2022 Publication History

Abstract

Topological quantum error correction (TQEC) using the surface code is among the most promising techniques for fault-tolerant quantum circuits. The required resource of a TQEC circuit can be modeled as a space-time volume of a three-dimensional diagram by describing the defect movement along the time axis. For large-scale complex problems, it is crucial to minimize the space-time volume for a quantum algorithm with a reasonable physical qubit number and computation time. Previous work proposed an automated tool to perform bridge compression on a large-scale TQEC circuit. However, the existing automated bridging compression is only for dual defects and not for primal defects. This paper presents an algorithm to perform bridge compression on primal and dual defects simultaneously. In addition, the automatic compression algorithm performs initialization/measurement simplification and flipping to improve the compression. Compared with the state-of-the-art work, experimental results show that our proposed algorithm can averagely reduce space-time volumes by 47%.

References

[1]
Nurul Ain Binti Adnan and Shigeru Yamashita. 2018. Logical qubit layout problem for ICM representation. Journal of Information Processing 26 (2018), 20--28.
[2]
Mohammad AlFailakawi, Imtiaz Ahmad, Laila AlTerkawi, and Suha Hamdan. 2015. Depth optimization for topological quantum circuits. Quantum Information Processing 14, 2 (2015), 447--463.
[3]
Kota Asai and Shigeru Yamashita. 2019. Compaction of Topological Quantum Circuits by Modularization. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences 102, 4 (2019), 624--632.
[4]
Paul Falkenstern, Yuan Xie, Yao-Wen Chang, and Yu Wang. 2010. Three-Dimensional Integrated Circuits (3D IC) Floorplan and Power/Ground Network Co-Synthesis. In Proc. of ASPDAC.
[5]
Austin G Fowler and Simon J Devitt. 2012. A bridge to lower overhead quantum computation. arXiv preprint arXiv:1209.0510 (2012).
[6]
Austin G Fowler and Kovid Goyal. 2008. Topological cluster state quantum computing. arXiv preprint arXiv:0805.3202 (2008).
[7]
Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland. 2012. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A 86, 3 (2012), 032324.
[8]
Lov K Grover. 1996. A fast quantum mechanical algorithm for database search. In ACM Symposium on Theory of Computing.
[9]
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter. 2012. Surface code quantum computing by lattice surgery. New Journal of Physics 14, 12 (2012), 123011.
[10]
Chen-Hao Hsu, Wan-Hsuan Lin, Wei-Hsiang Tseng, and Yao-Wen Chang. 2021. A Bridge-based Compression Algorithm for Topological Quantum Circuits. In Proc. of DAC.
[11]
Yibo Lin, Bei Yu, Meng Li, and David Z Pan. 2017. Layout synthesis for topological quantum circuits with 1-D and 2-D architectures. IEEE Tran. on CAD 37, 8 (2017), 1574--1587.
[12]
L. McMurchie and C. Ebeling. 1995. PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs. In Proc. of FPGA.
[13]
The Boost organization. 2019. The Boost C++ Libraries. https://www.boost.org/users/history/version_1_72_0
[14]
Adam Paetznick and Austin G Fowler. 2013. Quantum circuit optimization by topological compaction in the surface code. arXiv preprint arXiv: 1304.2807 (2013).
[15]
Alexandru Paler, Simon J Devitt, and Austin G Fowler. 2016. Synthesis of arbitrary quantum circuits to topological assembly. Sci. Rep. 6, 1 (2016), 1--16.
[16]
Alexandru Paler, Austin G Fowler, and Robert Wille. 2017. Synthesis of arbitrary quantum circuits to topological assembly: Systematic, online and compact. Sci. Rep. 7, 1 (2017), 1--16.
[17]
Alexandru Paler, Ilia Polian, Kae Nemoto, and Simon J Devitt. 2015. A fully fault-tolerant representation of quantum circuits. In Reversible Computation.
[18]
Alexandru Paler, Ilia Polian, Kae Nemoto, and Simon J Devitt. 2017. Fault-tolerant, high-level quantum circuits: form, compilation and description. Quantum Science and Technology 2, 2 (2017), 025003.
[19]
Kovacs Peter, El-Kebir Mohammed, Juttner Alpar, and Dezso Balazs. 2017. The LEMON Graph Library. https://lemon.cs.elte.hu/trac/lemon
[20]
Robert Raussendorf, Jim Harrington, and Kovid Goyal. 2007. Topological fault-tolerance in cluster state quantum computation. New J. Phys. 9, 6 (2007), 199.
[21]
Peter W Shor. 1999. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review 41, 2 (1999), 303--332.
[22]
Robert Wille, Daniel Große, Lisa Teuber, Gerhard W Dueck, and Rolf Drechsler. 2008. RevLib: An online resource for reversible functions and reversible circuits. In Proc. of ISMVL.

Cited By

View all
  • (2023)Late Breaking Results: An Efficient Bridge-based Compression Algorithm for Topologically Quantum Error Corrected Circuits2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247656(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
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 ACM 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 August 2022

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

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)26
  • Downloads (Last 6 weeks)1
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Late Breaking Results: An Efficient Bridge-based Compression Algorithm for Topologically Quantum Error Corrected Circuits2023 60th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC56929.2023.10247656(1-2)Online publication date: 9-Jul-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media