Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userProcess fidelity estimation of linear optical quantum CZ gate: A comparative study
347
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We present a systematic comparison of different methods of fidelity estimation of a linear optical quantum controlled-Z gate implemented by two-photon interference on a partially polarizing beam splitter. We have utilized a linear fidelity estimator based on the Monte Carlo sampling technique as well as a non-linear estimator based on maximum likelihood reconstruction of a full quantum process matrix. In addition, we have also evaluated lower bound on quantum gate fidelity determined by average quantum state fidelities for two mutually unbiased bases. In order to probe various regimes of operation of the gate we have introduced a tunable delay line between the two photons. This allowed us to move from high-fidelity operation to a regime where the photons become distinguishable and the success probability of the scheme significantly depends on input state. We discuss in detail possible systematic effects that could influence the gate fidelity estimation.
rate research
Read More
We present a detailed error analysis of a Rydberg blockade mediated controlled-NOT quantum gate between two neutral atoms as demonstrated recently in Phys. Rev. Lett. 104, 010503 (2010) and Phys. Rev. A 82, 030306 (2010). Numerical solutions of a master equation for the gate dynamics, including all known sources of technical error, are shown to be in good agreement with experiments. The primary sources of gate error are identified and suggestions given for future improvements. We also present numerical simulations of quantum process tomography to find the intrinsic fidelity, neglecting technical errors, of a Rydberg blockade controlled phase gate. The gate fidelity is characterized using trace overlap and trace distance measures. We show that the trace distance is linearly sensitive to errors arising from the finite Rydberg blockade shift and introduce a modified pulse sequence which corrects the linear errors. Our analysis shows that the intrinsic gate error extracted from simulated quantum process tomography can be under 0.002 for specific states of $^{87}$Rb or Cs atoms. The relation between the process fidelity and the gate error probability used in calculations of fault tolerance thresholds is discussed.
We investigate the effect of variations in beam splitter transmissions and path length differences in the nonlinear sign gate that is used for linear optical quantum computing. We identify two implementations of the gate, and show that the sensitivity to variations in their components differs significantly between them. Therefore, circuits that require a precision implementation may benefit from additional circuit analysis of component variations to identify the most practical implementation. We suggest possible routes to efficient circuit analysis in terms of quantum parameter estimation.
A significant problem for optical quantum computing is inefficient, or inaccurate photo-detectors. It is possible to use CNOT gates to improve a detector by making a large cat state then measuring every qubit in that state. In this paper we develop a code that compares five different schemes for making multiple measurements, some of which are capable of detecting loss and some of which are not. We explore how each of these schemes performs in the presence of different errors, and derive a formula to find at what probability of qubit loss is it worth detecting loss, and at what probability does this just lead to further errors than the loss introduces.
For two unknown quantum states $rho$ and $sigma$ in an $N$-dimensional Hilbert space, computing their fidelity $F(rho,sigma)$ is a basic problem with many important applications in quantum computing and quantum information, for example verification and characterization of the outputs of a quantum computer, and design and analysis of quantum algorithms. In this Letter, we propose a quantum algorithm that solves this problem in $text{poly}(log (N), r)$ time, where $r$ is the lower rank of $rho$ and $sigma$. This algorithm exhibits an exponential improvement over the best-known algorithm (based on quantum state tomography) in $text{poly}(N, r)$ time.
We propose $mathrm{SQiSW}$, the matrix square root of the standard $mathrm{iSWAP}$ gate, as a native two-qubit gate for superconducting quantum computing. We show numerically that it has potential for an ultra-high fidelity implementation as its gate time is half of that of $mathrm{iSWAP}$, but at the same time it possesses powerful information processing capabilities in both the compilation of arbitrary two-qubit gates and the generation of large-scale entangled W-like states. Even though it is half of an $mathrm{iSWAP}$ gate, its capabilities surprisingly rival and even surpass that of $mathrm{iSWAP}$ or other incumbent native two-qubit gates such as $mathrm{CNOT}$. To complete the case for its candidacy, we propose a detailed compilation, calibration and benchmarking framework. In particular, we propose a variant of randomized benchmarking called interleaved fully randomized benchmarking (iFRB) which provides a general and unified solution for benchmarking non-Clifford gates such as $mathrm{SQiSW}$. For the reasons above, we believe that the $mathrm{SQiSW}$ gate is worth further study and consideration as a native two-qubit gate for both fault-tolerant and noisy intermediate-scale quantum (NISQ) computation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
