Fig. 3: Determining the distance D(U1, U2) based on Theorem 3.
From: Equivalence checking of quantum circuits by nonlocality
Here U1 and U2 are randomly sampled, and m = 2. Every blue point corresponds to picking up a specific pair of U1 and U2 and then running the Monte Carlo process described in section The analysis of computational cost, where s = 100, 1000, 10,000, respectively. We sample U1 and U2 of 1, 2, or 3 qubits, which means the experiments are performed on two 2, 4, or 6-qubit circuits. The red solid line is given by Theorem 3.
