Experimental realization of self-guided quantum process tomography

Characterization of quantum processes is a preliminary step necessary in the development of quantum technology. The conventional method uses standard quantum process tomography, which requires \(d^2\) input states and \(d^4\) quantum measurements for a \(d\)-dimensional Hilbert space. These experime...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Hou, Zhibo, Jun-Feng, Tang, Ferrie, Christopher, Guo-Yong, Xiang, Chuan-Feng, Li, Guo, Guang-Can
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 02.08.2019
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Characterization of quantum processes is a preliminary step necessary in the development of quantum technology. The conventional method uses standard quantum process tomography, which requires \(d^2\) input states and \(d^4\) quantum measurements for a \(d\)-dimensional Hilbert space. These experimental requirements are compounded by the complexity of processing the collected data, which can take several orders of magnitude longer than the experiment itself. In this paper we propose an alternative self-guided algorithm for quantum process tomography, tuned for the task of finding an unknown unitary process. Our algorithm is a fully automated and adaptive process characterization technique. The advantages of our algorithm are: inherent robustness to both statistical and technical noise; requires less space and time since there is no post-processing of the data; requires only a single input state and measurement; and, provides on-the-fly diagnostic information while the experiment is running. Numerical results show our algorithm achieves the same \(1/n\) scaling as standard quantum process tomography when \(n\) uses of the unknown process are used. We also present experimental results wherein the algorithm, and its advantages, are realized for the task of finding an element of \(SU(2)\).
ISSN:2331-8422
DOI:10.48550/arxiv.1908.01082