25
Classifying Beamsplitters Adam Bouland

Classifying Beamsplitters

  • Upload
    dulcea

  • View
    46

  • Download
    0

Embed Size (px)

DESCRIPTION

Classifying Beamsplitters. Adam Bouland. Boson/Fermion Model. M modes. Boson/Fermion Model. Boson/Fermion Model. Beamsplitters. Def: A set of beamsplitters is universal if it densely generates SU(m) or SO(m) on m modes. Beamsplitters. - PowerPoint PPT Presentation

Citation preview

Page 1: Classifying Beamsplitters

Classifying Beamsplitters

Adam Bouland

Page 2: Classifying Beamsplitters

Boson/Fermion Model

M modes

Page 3: Classifying Beamsplitters

Boson/Fermion Model

Page 4: Classifying Beamsplitters

Boson/Fermion Model

Page 5: Classifying Beamsplitters

Beamsplitters

• Def: A set of beamsplitters is universal if it densely generates SU(m) or SO(m) on m modes.

Page 6: Classifying Beamsplitters

Beamsplitters

• Def: A set of beamsplitters is universal if it densely generates SU(m) or SO(m) on m modes.

Q: Which sets of beamsplitters are universal?

Page 7: Classifying Beamsplitters

Beamsplitters

• Obviously not universal:

Page 8: Classifying Beamsplitters

Beamsplitters

• Obviously not universal:

• Not obvious:

Page 9: Classifying Beamsplitters

Real Beamsplitters

Thm: [B. Aaronson ’12] Any real nontrivial

beamsplitter is universal on ≥3

modes.

Page 10: Classifying Beamsplitters

Real Beamsplitters

Thm: [B. Aaronson ’12] Any real nontrivial

beamsplitter is universal on ≥3

modes.

What about complex beamsplitters?

Page 11: Classifying Beamsplitters

Complex Beamsplitters

Goal: Any non-trivial (complex) beamsplitter is universal on ≥3 modes.

Page 12: Classifying Beamsplitters

Complex Beamsplitters

Goal: Any non-trivial (complex) beamsplitter is universal on ≥3 modes.

Can show: Any non-trivial beamsplitter generates a continuous group on ≥3 modes.

Page 13: Classifying Beamsplitters

Complex Beamsplitters

Determinant ±1

Page 14: Classifying Beamsplitters

Complex Beamsplitters

Page 15: Classifying Beamsplitters

Complex BeamsplittersLet G=<R1,R2,R3>

Page 16: Classifying Beamsplitters

Complex Beamsplitters

Page 17: Classifying Beamsplitters

Complex Beamsplitters

Subgroups of SU(3):

6 infinite families

12 exceptional groups

Page 18: Classifying Beamsplitters

Complex Beamsplitters

Subgroups of SU(3):

6 infinite families

12 exceptional groups

Page 19: Classifying Beamsplitters

Complex BeamsplittersLet G=<R1,R2,R3>

Lemma: If G is discrete, R1,R2,R3 form an irreducible representation of G.

Page 20: Classifying Beamsplitters

Complex Beamsplitters

Page 21: Classifying Beamsplitters

Complex Beamsplitters

Page 22: Classifying Beamsplitters

Complex Beamsplitters

Δ(6n2)

Page 23: Classifying Beamsplitters

Complex Beamsplitters

Δ(6n2)Algebraic Number Theory

Page 24: Classifying Beamsplitters

Open questions

• Can we complete the proof to show any beamsplitter is universal?

• Can we extend this to multi-mode beamsplitters?

• What if the beamsplitter applies a phase as well?

Page 25: Classifying Beamsplitters

Questions

?