No-Cloning Theorem

In classical computing, copying data is fundamental and trivial. It's so basic we rarely think about it:

Classical copying operations:

• Copy-paste: Duplicate files, text, or data structures
• Backup systems: Create redundant copies for safety
• Error correction: Replicate bits to detect/correct errors
• Parallel processing: Copy data to multiple processors
• Communication: Send copies while keeping the original

The classical $\text{COPY}$ operation:

• Input: One bit in state $x \in \{0,1\}$
• Output: Two bits, both in state $x$
• Notation: $\text{COPY}(x) = (x, x)$

This works because classical bits have definite values. We can always:

1. Read the bit value (0 or 1)
2. Write that value to a new bit
3. Keep the original unchanged

Why copying matters:

• Reliability: Multiple copies protect against loss
• Distribution: Share information without losing it
• Computation: Many algorithms require duplicating data

...