← Mathematical compendium

Published equation contexts

U(∣ψ⟩⊗∣0⟩)=∣ψ⟩⊗∣ψ⟩U\left(|\psi\rangle \otimes |0\rangle\right) = |\psi\rangle \otimes |\psi\rangle

Why this formula appears here

The classical repetition code is the first thing anyone reaches for, and quantum mechanics forbids it. A unitary machine that maps an arbitrary unknown state alongside a blank register onto two copies, U(∣ψ⟩⊗∣0⟩)=∣ψ⟩⊗∣ψ⟩U\left(|\psi\rangle \otimes |0\rangle\right) = |\psi\rangle \otimes |\psi\rangle . cannot exist for all |ψ\psi⟩\rangle , because unitarity preserves inner products and the required map does not. Wootters and Zurek established the point in 1982, in a paper whose title remains the cleanest statement of it [ 1 ] . There is no backup copy, no parity check computed by reading the data, no majority vote over three inspected replicas.

Read the full article-specific guide →

Read the representative guide

ψ\psi

Symbol psi

psi is an argument of the function-like quantity on the left; its role is set by that function’s stated inputs.

Read this term in its guide →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

U(∣ψ⟩⊗∣0⟩)=∣ψ⟩⊗∣ψ⟩,U\left(|\psi\rangle \otimes |0\rangle\right) = |\psi\rangle \otimes |\psi\rangle ,

Equation 1 · Quantum Information

Error Correction Is the Whole Problem in Quantum Computing

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

The classical repetition code is the first thing anyone reaches for, and quantum mechanics forbids it. A unitary machine that maps an arbitrary unknown state alongside a blank register onto two copies, U(∣ψ⟩⊗∣0⟩)=∣ψ⟩⊗∣ψ⟩U\left(|\psi\rangle \otimes |0\rangle\right) = |\psi\rangle \otimes |\psi\rangle . cannot exist for all |ψ\psi⟩\rangle , because unitarity preserves inner products and the required map does not. Wootters and Zurek established the point in 1982, in a paper whose title remains the cleanest statement of it [ 1 ] . There is no backup copy, no parity check computed by reading the data, no majority vote over three inspected replicas.

Equation guide → · Article →