We investigate the performance of a quantum error-correcting code when pushed beyond its intended capacity to protect against errors, presenting formulae for the probability of failure when the errors affect more qudits than that specified by the code’s minimum distance. Such formulae provide a means to rank different codes of the same minimum distance. We consider both error detection and error correction, treating explicit examples in the case of stabilizer codes constructed from qubits and encoding a single qubit
Quantum Information Processing – Springer Journals
Published: Oct 12, 2005
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud