Bulletin of the American Physical Society
2023 APS March Meeting
Volume 68, Number 3
Las Vegas, Nevada (March 5-10)
Virtual (March 20-22); Time Zone: Pacific Time
Session F69: Building the Quantum Computing Software StackInvited Session
|
Hide Abstracts |
Sponsoring Units: DQI Chair: Pranav Gokhale, ColdQuanta Room: Room 421 |
Tuesday, March 7, 2023 8:00AM - 8:36AM |
F69.00001: A Compiler Framework for Enabling Collective Communication in Distributed Quantum Programs Invited Speaker: Yufei Ding 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 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 talk, we will introduce our recent work on compiler support for distributed quantum computers. First, 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. To this end, we 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 AutoComm can reduce the communication resource consumption and the program latency by 75.6% and 71.4% on average, respectively. Second, we discover that the efficiency of quantum communication, especially collective communication, can be significantly boosted by decoupling communication resources from remote operations, that is, the communication hardware would be used only for preparing remote entanglement, and the computational hardware, the component used to store program information, would be used for conducting remote gates. We develop a compiler framework to optimize the collective communication happening in distributed quantum programs. We decouple the communication preparation process in communication hardware from the remote gates conducted in computational hardware by buffering EPR pairs generated by communication hardware in qubits of the computational hardware. Experimental results show that the proposed framework can halve the communication cost of various distributed quantum programs. |
Tuesday, March 7, 2023 8:36AM - 9:12AM |
F69.00002: Improving quantum circuits with heterogenous gatesets Invited Speaker: Ali Javadi-Abhari It is well known that a very small set of gates achieves universal quantum computation. This has enabled programmable quantum computers with minimal calibration overhead. |
Tuesday, March 7, 2023 9:12AM - 9:48AM |
F69.00003: Architecture and System-Level Solutions for Real-Time Decoding in Fault-Tolerant Quantum Computers Invited Speaker: Das Poulami The error rates of quantum devices are orders of magnitude higher than what is needed to run most practical quantum applications. Quantum error correction (QEC) enables us to close this gap by encoding logical qubits using several physical qubits. By periodically identifying errors in real-time using a decoder, QEC prevents errors from accumulating and achieves a logical error rate lower than the error rate of the physical qubits. Unfortunately, software decoding algorithms are often too slow to enable real-time decoding (within a latency of a few micro-seconds). In this talk, I will discuss the role of micro-architecture and system-level optimizations to improve the performance and scalability of decoders. First, I will describe LILLIPUT, a lightweight reconfigurable practical lookup table decoder for small QEC codes that programs Look-Up Tables on FPGAs with the error assignments offline and decodes online during actual experiments. Second, I will discuss the AFS decoder that focuses on accelerating the Union-Find decoding algorithm using specialized hardware and leverages contention-aware resource sharing to design the system level architecture and organization of decoders in fault-tolerant quantum computers with multiple logical qubits for enhanced scalability. |
Tuesday, March 7, 2023 9:48AM - 10:24AM |
F69.00004: Quantum computing with differentiable quantum transforms Invited Speaker: Olivia Di Matteo As quantum computing increases in scale and scope, the manner in which we write quantum algorithms is necessarily changing. While many situations still require a gate-level approach and knowledge of the finer details of both software and hardware, higher-level abstractions are being developed that enable programmers to redirect focus to algorithms and applications rather than what happens under the hood. This talk will focus on the concept of differentiable quantum transforms, which are metaprograms that manipulate quantum programs in a way that preserves their differentiability. We will explore how transforms can be used to think about quantum programs in a different way, and showcase their practical implementation for three applications: differentiable compilation, noise characterization, and error mitigation. We conclude by highlighting a recent application in condensed-matter physics, the computation of fidelity susceptibility, in which transforms are used to facilitate the study of the effects of error mitigation on physical quantities computed from quantum gradients. |
Tuesday, March 7, 2023 10:24AM - 11:00AM |
F69.00005: Surface code compilation via edge-disjoint paths Invited Speaker: Eddie Schoute We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit's qubits in surface codes can result in long-range two-qubit operations across the grid. We show how to prepare many long-range Bell pairs on qubits connected by edge-disjoint paths of ancillas in constant depth that can be used to perform these long-range operations. This forms one core part of our Edge-Disjoint Paths Compilation (EDPC) algorithm, by easily performing many parallel long-range Clifford operations in constant depth. It also allows us to establish a connection between surface code compilation and several well-studied edge-disjoint paths problems. Similar techniques allow us to perform non-Clifford single-qubit rotations far from magic state distillation factories. In this case, we can easily find the maximum set of paths by a max-flow reduction, which forms the other major part of EDPC. EDPC has the best asymptotic worst-case performance guarantees on the circuit depth for compiling parallel operations when compared to related compilation methods based on swaps and network coding. EDPC also shows a quadratic depth improvement over sequential Pauli-based compilation for parallel rotations requiring magic resources. We implement EDPC and find significantly improved performance for circuits built from parallel cnots, and for circuits which implement the multi-controlled X gate. |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2025 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700