Error avoiding quantum codes and dynamical stabilization of Grover's algorithm
From MaRDI portal
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.
Recommendations
- Grover's search with local and total depolarizing channel errors: complexity analysis
- Nonbinary stabilizer codes
- A possible strategy to defeat decoherence in quantum computation: the role of symmetries, dynamical algebras, and all that.
- Grover's algorithm with errors
- Quantum error-avoiding code based on the decoherence-free subspace
Cited in
(6)- Target-generating quantum error correction coding scheme based on generative confrontation network
- A possible strategy to defeat decoherence in quantum computation: the role of symmetries, dynamical algebras, and all that.
- A Hybrid Quantum-Classical Approach to Mitigating Measurement Errors in Quantum Algorithms
- High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping
- Manifold algorithmic errors in quantum computers with static internal imperfections
- Burst error-correcting quantum stabilizer codes designed from idempotents
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)
