Error avoiding quantum codes and dynamical stabilization of Grover's algorithm

From MaRDI portal
Publication:4435342

DOI10.1088/1367-2630/2/1/319zbMATH Open1033.81018arXivquant-ph/0003141OpenAlexW2067105238MaRDI QIDQ4435342FDOQ4435342


Authors: M. Mussinger, Aldo Delgado, Gernot Alber Edit this on Wikidata


Publication date: 30 November 2003

Published in: New Journal of Physics (Search for Journal in Brave)

Abstract: An error avoiding quantum code is presented which is capable of stabilizing Grover's quantum search algorithm against a particular class of coherent errors. This error avoiding code consists of states only which are factorizable in the computational basis. Furthermore, its redundancy is smaller than the one which is achievable with a general error correcting quantum code saturating the quantum Hamming bound. The fact that this code consists of factorizable states only may offer advantages for the implementation of quantum gates in the error free subspace.


Full work available at URL: https://arxiv.org/abs/quant-ph/0003141




Recommendations





Cited In (6)





This page was built for publication: Error avoiding quantum codes and dynamical stabilization of Grover's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435342)