.png){kind=icon}
Return
Suppressing Quantum Circuit Errors Due to System Variability
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.4.010327.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present-day noisy quantum computing platforms. This method can be run after qubit routing or postcompilation and consists of computing isomorphic subgraphs to input circuits and scoring each using heuristic cost functions derived from system calibration data. Using an independent standard algorithmic test suite, we show that it is possible to recover on average nearly 40% of missing fidelity using better qubit selection via efficient to compute cost functions. We demonstrate additional performance gains by considering qubit placement over multiple quantum processors. The overhead from these tools is minimal with respect to other compilation steps, such as qubit routing, as the number of qubits increases. As such, our method can be used to find qubit mappings for problems at the scale of quantum advantage and beyond.
Journal
P
IF:
11
Papers:
919
Citations:
9.0K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveFree and Forced Vibration of Laminated and Sandwich Plates by Zig-Zag Theories Differently Accounting for Transverse Shear and Normal Deformability.png)
Aerospace
OAAI
AerospaceIF0
OAAIShareSaveShareSave
View more