Time-sliced quantum circuit partitioning for modular architectures

Baker, Jonathan M.; Duckering, Casey; Hoover, Alexander; Chong, Frederic T.

doi:10.1145/3387902.3392617

Cited by 30 publications

(44 citation statements)

References 80 publications

(87 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some approaches in the past have attempted to solve the first of these problems, for example by using lookahead when choosing routing strategies [7,39] and while this helps to treat the symptoms of pre-decomposing all operations it does not remedy the underlying problem.…”

Section: Motivation: Conventional Compilationmentioning

confidence: 99%

Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

Duckering

Baker

Litteken

et al. 2021

Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

Self Cite

View full text Add to dashboard Cite

Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one-and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates.This significantly reduces communication overhead by giving the routing pass access to the higher-level structure of the circuit instead of discarding it. A second benefit is the ability to now select an architecture-tuned Toffoli decomposition such as the 8-CNOT Toffoli for the specific hardware qubits now known after the routing pass. We perform real experiments on IBM Johannesburg showing an average 35% decrease in two-qubit gate count and 23% increase in success rate of a single Toffoli over Qiskit. We additionally compile many near-term benchmark algorithms showing an average 344% increase in (or 4.44x) simulated success rate on the Johannesburg architecture and compare with other architecture types. CCS CONCEPTS• Computer systems organization → Quantum computing; • Software and its engineering → Compilers.

show abstract

Section: Motivation: Conventional Compilationmentioning

confidence: 99%

Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

Duckering

Baker

Litteken

et al. 2021

Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…In DQC, remote communication involving qubits in different computing nodes is essential yet far more expensive than the local communication on qubits within the same node (e.g., 5-100x time consumption and up to 40x accuracy degradation [11,12]). There are two major schemes for remote quantum communication: one built upon the cat-entangler and cat-disentangler protocol [13], and the other based on the quantum teleportation [3].…”

Section: Introductionmentioning

confidence: 99%

AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs

Wu¹,

Zhang²,

Li³

et al. 2022

Preprint

View full text Add to dashboard Cite

Distributed quantum computing (DQC) is a promising approach to extending the computational power of near-term quantum devices. However, the non-local quantum communication between quantum devices is much more expensive and error-prone than the local quantum communication within each quantum device. Previous work on the DQC communication optimization focus on optimizing the communication protocol for each individual non-local gate and then adopt quantum compilation designs which are designed for local multi-qubit gates (such as controlled-x or CX gates) in a single quantum computer. The communication patterns in distributed quantum programs are not yet well studied, leading to a far-from-optimal communication cost. In this paper, we identify burst communication, a specific qubit-node communication pattern that widely exists in many distributed programs and can be leveraged to guide communication overhead optimization. We then propose AutoComm, an automatic compiler framework to first extract the burst communication patterns from the input programs, and then optimize the communication steps of burst communication discovered. Experimental results show that our proposed AutoComm can reduce the communication resource consumption and the program latency by 75.6% and 71.4% on average, respectively.

show abstract

“…Distributed quantum architectures have been proposed in [24][25][26]. Related works present techniques for targeting a network of quantum chips for unified computing tasks [27,28]. Major players in quantum computing have noted the potential of distribution for scaling quantum computers [15,29].…”

Section: Introductionmentioning

confidence: 99%

Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation

LaRacuente¹,

Smith²,

Imany³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

A core challenge for superconducting quantum computers is to scale up the number of qubits in each processor without increasing noise or cross-talk. Distributing a quantum computer across nearby small qubit arrays, known as chiplets, could solve many problems associated with size. We propose a chiplet architecture over microwave links with potential to exceed monolithic performance on near-term hardware. We model and evaluate the chiplet architecture in a way that bridges the physical and network layers. We find concrete evidence that distributed quantum computing may accelerate the path toward useful and ultimately scalable quantum computers. In the long-term, short-range networks may underlie quantum computers just as local area networks underlie classical datacenters and supercomputers today.

show abstract

Time-sliced quantum circuit partitioning for modular architectures

Cited by 30 publications

References 80 publications

Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs

Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation

Contact Info

Product

Resources

About