Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Distributed quantum architecture search

Haozhen Situ, Zhimin He, Shenggen Zheng, and Lvzhou Li
Phys. Rev. A 110, 022403 – Published 1 August 2024
This article was published on 1 August 2024. Please update your links.

Abstract

Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. However, designing efficient parameterized quantum circuits remains a challenge. Quantum architecture search tackles this by adjusting circuit structures along with gate parameters to automatically discover high-performance circuit structures. In this study, we propose an end-to-end distributed quantum architecture search framework, where we aim to automatically design distributed quantum circuit structures for interconnected quantum processing units with specific qubit connectivity. We devise a circuit generation algorithm which incorporates TeleGate and TeleData methods to enable nonlocal gate implementation across quantum processing units. While taking into account qubit connectivity, we also incorporate qubit assignment from logical to physical qubits within our quantum architecture search framework. A two-stage progressive training-free strategy is employed to evaluate extensive circuit structures without circuit training costs. Through numerical experiments on three VQE tasks, the efficacy and efficiency of our scheme is demonstrated. Our research into discovering efficient structures for distributed quantum circuits is crucial for near-term quantum computing where a single quantum processing unit has a limited number of qubits. Distributed quantum circuits allow for breaking down complex computations into manageable parts that can be processed across multiple quantum processing units.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
1 More
  • Received 4 April 2024
  • Accepted 8 July 2024

DOI:https://doi.org/10.1103/PhysRevA.110.022403

©2024 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Haozhen Situ1, Zhimin He2, Shenggen Zheng3, and Lvzhou Li4,3,*

  • 1College of Mathematics and Informatics, South China Agricultural University, Guangzhou 510642, China
  • 2School of Electronic and Information Engineering, Foshan University, Foshan 528000, China
  • 3Quantum Science Center of Guangdong-Hong Kong-Macao Greater Bay Area (Guangdong), Shenzhen 518045, China
  • 4Institute of Quantum Computing and Software, School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, China

  • *Contact author: lilvzh@mail.sysu.edu.cn

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 110, Iss. 2 — August 2024

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×

Images

  • Figure 1
    Figure 1

    Two IBM Yorktown quantum processors are interconnected via a quantum link. Circles with solid lines represent data qubits, while circles with dash-dotted lines represent communication qubits. Solid lines denote local couplings, while the wavy line represents the quantum link for distributing pairs of entangled qubits to two communication qubits.

    Reuse & Permissions
  • Figure 2
    Figure 2

    The virtual connectivity graph is derived from the distributed architecture depicted in Fig. 1. Local two-qubit gates can be directed performed on qubits connected by solid lines. The two dashed lines represent virtual edges added through the cat-entangler primitive operation on qubits q2q4q5.

    Reuse & Permissions
  • Figure 3
    Figure 3

    Examples of redundant gates.

    Reuse & Permissions
  • Figure 4
    Figure 4

    Histograms depicting the number of paths and expressibility of generated circuits with 50 gates using the TeleGate method. (a) The number of paths for all Ka circuits. (b) The expressibility of Kp circuits filtered based on the number of paths.

    Reuse & Permissions
  • Figure 5
    Figure 5

    Histograms depicting the number of ebits in generated circuits using the TeleGate method. The left, middle, and right column represent all Ka circuits, Kp circuits filtered by the number of paths, and Ke circuits filtered by expressibility, respectively. The top, middle, and bottom row represent circuits with 40, 50, and 60 gates, respectively.

    Reuse & Permissions
  • Figure 6
    Figure 6

    Histograms depicting the lowest energy achieved for the BeH2 problem by Ke candidate circuits using the TeleGate method. Plots (a)–(c) represent circuits with 40, 50, and 60 gates, respectively. The red dashed line denotes the ground-state energy of BeH2, while the green solid line indicates the energy within the chemical accuracy threshold of 0.0016.

    Reuse & Permissions
  • Figure 7
    Figure 7

    Lowest energy achieved versus number of queries for BeH2 problem. Panel (b) is a magnification of the first 50 queries in panel (a).

    Reuse & Permissions
  • Figure 8
    Figure 8

    Number of optimal solutions versus number of queries for BeH2 problem.

    Reuse & Permissions
×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×