Year: 2020
Type: conference-paper
Abstract: Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahead scheme to reduce the cost to move to future time slices. We compare our approach to a traditional statically-mapped, owner-computes model. Our results show strict improvement over the static mapping baseline. We reduce the non-local communication overhead by 89.8% in the best case and by 60.9% on average. Our techniques, unlike many exact solver methods, are computationally tractable.
Authors: Jonathan M. Baker, Casey Duckering, Alexander Hoover, Frederic T. Chong
Institution: University of Chicago
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Awards: PFCQC: STAQ: Software-Tailored Architecture for Quantum co-design, ADVANCING INTEGRATED DEVELOPMENT ENVIRONMENTS FOR QUANTUM COMPUTING THROUGH FUNDAMENTAL RESEARCH (AIDE-QC), TOUGH ERRORS ARE NO MATCH (TEAM): OPTIMIZING THE QUANTUM COMPILER FOR NOISE RESILIENCE, Collaborative Research: EPiQC: Enabling Practical-Scale Quantum Computation, G8154830554, Collaborative Research: EPiQC: Enabling Practical-Scale Quantum Computation
OpenAlex ID: W3027825264
