Iterative Optimization of Quantum Error Correcting Codes
M. Reimpell, R. F. Werner
Abstract
We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit "channel fidelity" in every step.
Create a lesson
Related papers
Towards the Geometry of Quantum Optical Measurements: Kraus Trajectories in the Instrumental Weyl-Heisenberg Group Manifold
Tzula B. Propp, Chris S. Jackson
Bell's go theorem: regaining local causality with a new notion of realism
Lorenzo Catani, Nesta van der Schaaf, Rui Soares Barbosa
Quantum state texture of maximal-resource Fourier states under Hawking radiation
Shengyan Ma, Yiding Wang, Xiaofen Huang et al.
Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits
Gebrat Porta-San Miguel, Shahram Panahiyan, Dieter Jaksch
QBFF: Deep Quantum Bottleneck for Automatic Speaker Verification Anti-Spoofing
Anton Firc, Nouhaila Innan, Vojtěch Staněk et al.
Entanglement and parametric resonance in coupled oscillator systems
Roxane Thériault, George Zahariade