A simple formula for the average gate fidelity of a quantum dynamical operation
From MaRDI portal
Publication:1847722
DOI10.1016/S0375-9601(02)01272-0zbMath0999.81012arXivquant-ph/0205035OpenAlexW2030467629WikidataQ55193751 ScholiaQ55193751MaRDI QIDQ1847722
Publication date: 23 October 2002
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0205035
Related Items
Time-optimal control with finite bandwidth ⋮ Entanglement Purification of Nonlocal Quantum‐Dot‐Confined Electrons Assisted by Double‐Sided Optical Microcavities ⋮ Exact performance of the five-qubit code with coherent errors ⋮ Fast synthesis of the Fredkin gate via quantum Zeno dynamics ⋮ A Random Coding Based Proof for the Quantum Coding Theorem ⋮ Macroscopic instructions vs microscopic operations in quantum circuits ⋮ The distribution of quantum fidelities ⋮ Quantum reference frames and the classification of rotationally invariant maps ⋮ Dissipative and non-dissipative single-qubit channels: dynamics and geometry ⋮ Bulk private curves require large conditional mutual information ⋮ Simulation of \(n\)-qubit quantum systems. III. Quantum operations ⋮ Fidelity of quantum operations ⋮ Unnamed Item ⋮ Quantum entanglement ⋮ Bipartite entanglement of decohered mixed states generated from maximally entangled cluster states ⋮ Randomized benchmarking with confidence ⋮ Reduced coupling with global pulses in quantum registers ⋮ Decoding quantum information via the Petz recovery map ⋮ One-step implementation of the Toffoli gate via quantum Zeno dynamics ⋮ Average fidelity between random quantum states ⋮ Comparing the randomized benchmarking figure with the average infidelity of a quantum gate-set ⋮ Approximate randomized benchmarking for finite groups ⋮ Bounding quantum gate error rate based on reported average fidelity ⋮ Optimal quantum networks and one-shot entropies ⋮ Randomized dynamical decoupling techniques for coherent quantum control ⋮ On quantum network coding
Cites Work
