RH: An Architecture for Redesigning Quantum Circuits on Quantum Hardware Devices
Runhong He, Ji Guan, Xin Hong, Guolong Cui, Shengbin Wang, Shenggang Ying

TL;DR
This paper introduces a novel architecture using EQ-GAN with a random circuit module to enable large-scale quantum circuit redesign on hardware, improving optimization and validation in NISQ devices.
Contribution
The architecture extends EQ-GAN capabilities to unitary learning with a theoretical proof and practical enhancements, applied to circuit optimization tasks.
Findings
Successful application to circuit equivalence checking
Effective in variational quantum circuit reconstruction
Demonstrated feasibility on classical and NISQ hardware
Abstract
In this paper we present an architecture that enables the redesign of large-scale quantum circuits on quantum hardware based on the entangling quantum generative adversarial network (EQ-GAN). Specifically, by prepending a random quantum circuit module to the standard EQ-GAN framework, we extend its capability from quantum state learning to unitary transformation learning. The completeness of this architecture is theoretically proved. Moreover, an efficient local random circuit is proposed, which significantly enhances the practicality of our architecture. For concreteness, we apply this architecture to three crucial applications in circuit optimization, including the equivalence checking of (non-) parameterized circuits, as well as the variational reconstruction of quantum circuits. The feasibility of our approach is demonstrated by excellent results in both classical and noisy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
