Comparison of the Kitaev-Webb and Klco-Savage Algorithms on IBM Q Systems
POSTER
Abstract
Recent advancements in quantum algorithms have been significant, yet there is still much to be done in terms of benchmarking noisy quantum computing hardware. Utilizing IBM’s Qiskit software development kit and quantum hardware, we have streamlined a novel way of benchmarking and characterizing error on noisy qubits. We tested the noise levels of IBM’s quantum hardware by implementing the Kitaev-Webb state preparation algorithm (Kitaev, Webb 2008) and the Klco-Savage (Klco, Savage 2019) algorithm to prepare a 1D discrete Gaussian and a symmetric exponential distribution as a pseudo-Gaussian. Error data is then analyzed using KL divergence to quantify disparities between noiseless simulations and experimental runs on IBM Q processors. Such simulations provide insight into dominant sources of noise on quantum chips, and were subsequently compared to randomized benchmarking in order to evaluate how they compete with industry standard methods.
Authors
-
Aurelia Brook
New York University (NYU)
-
Dries Sels
New York University (NYU)
-
Javad Shabani
New York University (NYU)
-
Andreas Tsantilas
New York University (NYU)