Synthetiq: Fast and Versatile Quantum Circuit Synthesis

Author:

Paradis Anouk1ORCID,Dekoninck Jasper1ORCID,Bichsel Benjamin1ORCID,Vechev Martin1ORCID

Affiliation:

1. ETH Zurich, Zurich, Switzerland

Abstract

To implement quantum algorithms on quantum computers it is crucial to decompose their operators into the limited gate set supported by those computers. Unfortunately, existing works automating this essential task are generally slow and only applicable to narrow use cases.We present Synthetiq, a method to synthesize quantum circuits implementing a given specification over arbitrary finite gate sets, which is faster and more versatile than existing works. Synthetiq utilizes Simulated Annealing instantiated with a novel, domain-specific energy function that allows developers to leverage partial specifications for better efficiency. Synthetiq further couples this synthesis method with a custom simplification pass, to ensure efficiency of the found circuits. We experimentally demonstrate that Synthetiq can generate better implementations than were previously known for multiple relevant quantum operators including RCCCX, CCT, CCiSWAP, C√SWAP, and C√iSWAP. Our extensive evaluation also demonstrates Synthetiq frequently outperforms a wide variety of more specialized tools in their own domains, including (i) ‍the well-studied task of synthesizing fully specified operators in the Clifford+T gate set, (ii) ‍є-approximate synthesis of multi-qubit operators in the same gate set, and (iii) ‍synthesis tasks with custom gate sets. On all those tasks, Synthetiq is typically one to two orders of magnitude faster than previous state-of-the-art and can tackle problems that were previously out of the reach of any synthesis tool.

Funder

Swiss National Science Foundation SNSF

Publisher

Association for Computing Machinery (ACM)

Reference57 articles.

1. Quantum Artificial Life in an IBM Quantum Computer

2. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

3. Verified Compilation of Space-Efficient Reversible Circuits

4. A divide-and-conquer algorithm for quantum state preparation

5. Frank Arute Kunal Arya Ryan Babbush Dave Bacon Joseph C. Bardin Rami Barends Rupak Biswas Sergio Boixo Fernando G. S. L. Brandao David A. Buell Brian Burkett Yu Chen Zijun Chen Ben Chiaro Roberto Collins William Courtney Andrew Dunsworth Edward Farhi Brooks Foxen Austin Fowler Craig Gidney Marissa Giustina Rob Graff Keith Guerin Steve Habegger Matthew P. Harrigan Michael J. Hartmann Alan Ho Markus Hoffmann Trent Huang Travis S. Humble Sergei V. Isakov Evan Jeffrey Zhang Jiang Dvir Kafri Kostyantyn Kechedzhi Julian Kelly Paul V. Klimov Sergey Knysh Alexander Korotkov Fedor Kostritsa David Landhuis Mike Lindmark Erik Lucero Dmitry Lyakh Salvatore Mandrà Jarrod R. McClean Matthew McEwen Anthony Megrant Xiao Mi Kristel Michielsen Masoud Mohseni Josh Mutus Ofer Naaman Matthew Neeley Charles Neill Murphy Yuezhen Niu Eric Ostby Andre Petukhov John C. Platt Chris Quintana Eleanor G. Rieffel Pedram Roushan Nicholas C. Rubin Daniel Sank Kevin J. Satzinger Vadim Smelyanskiy Kevin J. Sung Matthew D. Trevithick Amit Vainsencher Benjamin Villalonga Theodore White Z. Jamie Yao Ping Yeh Adam Zalcman Hartmut Neven and John M. Martinis. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574 7779 (2019) Oct. 505–510. issn:1476-4687 https://doi.org/10.1038/s41586-019-1666-5 10.1038/s41586-019-1666-5

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. T-Count Optimizing Genetic Algorithm for Quantum State Preparation;2024 IEEE International Conference on Quantum Software (QSW);2024-07-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3