Quantum gate identification: Error analysis, numerical results and optical experiment

Loading...
Thumbnail Image
File version

Accepted Manuscript (AM)

Author(s)
Wang, Y
Yin, Q
Dong, D
Qi, B
Petersen, IR
Hou, Z
Yonezawa, H
Xiang, GY
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2019
Size
File type(s)
Location
Abstract

The identification of an unknown quantum gate is a significant issue in quantum technology. In this paper, we propose a quantum gate identification method within the framework of quantum process tomography. In this method, a series of pure states are applied to the gate and then a fast state tomography on the output states is performed and the data are used to reconstruct the quantum gate. The algorithm has computational complexity with the system dimension . The identification approach is compared with the maximum likelihood estimation method for the running time, which shows an efficiency advantage of our method. An error upper bound is established for the identification algorithm and the robustness of the algorithm against impurities in the input states is also tested. We perform a quantum optical experiment on a single-qubit Hadamard gate to verify the effectiveness of the identification algorithm.

Journal Title

Automatica

Conference Title
Book Title
Edition
Volume

101

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2019 Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International Licence, which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited.

Item Access Status
Note
Access the data
Related item(s)
Subject

Mathematical sciences

Engineering

Persistent link to this record
Citation

Wang, Y; Yin, Q; Dong, D; Qi, B; Petersen, IR; Hou, Z; Yonezawa, H; Xiang, GY, Quantum gate identification: Error analysis, numerical results and optical experiment, Automatica, 2019, 101, pp. 269-279

Collections