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 20:07, 8 August 2007 editSkippydo (talk | contribs)848 editsNo edit summary← Previous edit Revision as of 00:49, 9 August 2007 edit undoFinngall (talk | contribs)Extended confirmed users, New page reviewers, Rollbackers34,312 edits still needs contextNext edit →
Line 1: Line 1:
{{context}}
The '''Shor Code''' is an ] technique used to protect a ] against single ] errors. The '''Shor Code''' is an ] technique used to protect a ] against single ] errors.


Revision as of 00:49, 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.

The code

We map the qubit α | 0 ⟩ + β | 1 ⟩ {\displaystyle \alpha |0\rangle +\beta |1\rangle } to the nine qubit state

α 2 2 ( | 000 ⟩ + | 111 ⟩ ) ( | 000 ⟩ + | 111 ⟩ ) ( | 000 ⟩ + | 111 ⟩ ) {\displaystyle {\frac {\alpha }{2{\sqrt {2}}}}(|000\rangle +|111\rangle )(|000\rangle +|111\rangle )(|000\rangle +|111\rangle )}
+ β 2 2 ( | 000 ⟩ − | 111 ⟩ ) ( | 000 ⟩ − | 111 ⟩ ) ( | 000 ⟩ − | 111 ⟩ ) {\displaystyle +{\frac {\beta }{2{\sqrt {2}}}}(|000\rangle -|111\rangle )(|000\rangle -|111\rangle )(|000\rangle -|111\rangle )}

External links

The original article by Peter Shor

Category:
Shor code: Difference between revisions Add topic