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

TL;DR

This paper introduces a quantum gate identification method using quantum process tomography, demonstrating efficiency, robustness, and experimental validation on a single-qubit Hadamard gate.

Contribution

The paper presents a novel quantum gate identification algorithm with computational complexity $O(d^3)$, comparing favorably with existing methods and validated through optical experiments.

Findings

The algorithm achieves efficient quantum gate reconstruction.

It provides an error upper bound and robustness analysis.

Experimental results confirm effectiveness on a Hadamard gate.

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 inputted 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. Our algorithm has computational complexity $O(d^3)$ with the system dimension $d$. The algorithm is compared with maximum likelihood estimation method for the running time, which shows the efficiency advantage of our method. An error upper bound is established for the identification algorithm and the robustness of the algorithm against the purity of input states is also tested. We perform quantum optical experiment on single-qubit Hadamard gate to verify the effectiveness of the identification algorithm.