Misplaced Pages

Shor code: Difference between revisions

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 08:41, 9 August 2007 editSkippydo (talk | contribs)848 editsNo edit summary← Previous edit Revision as of 08:43, 9 August 2007 edit undoSkippydo (talk | contribs)848 editsNo edit summaryNext edit →
Line 1: Line 1:
{{context}} {{context}}
The '''Shor Code''' is an ] technique used to protect a ] against single ] errors. Published in by ] it is the first example of a quantum error correcting code.<ref name="Sh95"> The '''Shor Code''' is an ] technique used to protect a ] against single ] errors. Published in ] by ], it is the first example of a quantum error correcting code.<ref name="Sh95">
{{cite journal {{cite journal
| author = ] | author = ]
Line 10: Line 10:
| url = http://www.theory.caltech.edu/people/preskill/ph229/shor_error.ps | url = http://www.theory.caltech.edu/people/preskill/ph229/shor_error.ps
| format = PS}}} | format = PS}}}
</ref> Due to the ] classical error correction, which relies on duplicating classical information, could not be applied. This limitation was overcome with the Shor code. </ref> Classical error correction techniques, which rely on redundancy, are not applicable to ] due to the ]. This limitation was overcome with the Shor code.


== The code == == The code ==

Revision as of 08:43, 9 August 2007

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (Learn how and when to remove this message)

The Shor Code is an error correction technique used to protect a quantum computer against single qubit errors. Published in 1995 by Peter Shor, it is the first example of a quantum error correcting code. Classical error correction techniques, which rely on redundancy, are not applicable to quantum information due to the No-cloning theorem. This limitation was overcome with the Shor code.

The code

We map the basis states | 0 ⟩ {\displaystyle |0\rangle } , | 1 ⟩ {\displaystyle |1\rangle } as follows

| 0 ⟩ → 1 2 2 ( | 000 ⟩ + | 111 ⟩ ) ( | 000 ⟩ + | 111 ⟩ ) ( | 000 ⟩ + | 111 ⟩ ) {\displaystyle |0\rangle \rightarrow {\frac {1}{2{\sqrt {2}}}}(|000\rangle +|111\rangle )(|000\rangle +|111\rangle )(|000\rangle +|111\rangle )}
| 1 ⟩ → 1 2 2 ( | 000 ⟩ − | 111 ⟩ ) ( | 000 ⟩ − | 111 ⟩ ) ( | 000 ⟩ − | 111 ⟩ ) {\displaystyle |1\rangle \rightarrow {\frac {1}{2{\sqrt {2}}}}(|000\rangle -|111\rangle )(|000\rangle -|111\rangle )(|000\rangle -|111\rangle )}

References

  1. Peter Shor (1995). "Scheme for reducing decoherence in quantum computer memory" (PS). Physical Review A. 52: R2493 – R2496.}
Category:
Shor code: Difference between revisions Add topic