Abstract
Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.
| Original language | English |
|---|---|
| Title of host publication | Quantum Communications and Quantum Imaging XVII |
| Editors | Keith S. Deacon |
| Publisher | SPIE |
| ISBN (Electronic) | 9781510629615 |
| DOIs | |
| State | Published - 2019 |
| Event | Quantum Communications and Quantum Imaging XVII 2019 - San Diego, United States Duration: Aug 11 2019 → Aug 12 2019 |
Publication series
| Name | Proceedings of SPIE - The International Society for Optical Engineering |
|---|---|
| Volume | 11134 |
| ISSN (Print) | 0277-786X |
| ISSN (Electronic) | 1996-756X |
Conference
| Conference | Quantum Communications and Quantum Imaging XVII 2019 |
|---|---|
| Country/Territory | United States |
| City | San Diego |
| Period | 08/11/19 → 08/12/19 |
Funding
This work is supported by the Department of Energy, Office of Science, Early Career Research Program. This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-00OR22725.