Abstract structure of unitary oracles for quantum algorithms

Transcription

1 Abstract structure o unitary oracles or quantum algorithms William Zeng 1 Jamie Vicary 2 1 Department o Computer Science University o Oxord 2 Centre or Quantum Technologies, University o Singapore and Department o Computer Science, University o Oxord Quantum Physics and Logic, 2014

2 Unitary Oracles Oracles are common structures in algorithms. They are blackboxes with unknown internal structure.

3 Unitary Oracles Oracles are common structures in algorithms. They are blackboxes with unknown internal structure. Most known quantum algorithms are constructed using quantum oracles, the Deutsch-Josza algorithm, Shor s algorithm, Grover s algorithm...

4 Unitary Oracles Oracles are common structures in algorithms. They are blackboxes with unknown internal structure. Most known quantum algorithms are constructed using quantum oracles, the Deutsch-Josza algorithm, Shor s algorithm, Grover s algorithm... Physical realizations o oracles place conditions on their unknown structure. (Unitarity in the quantum case)

5 Unitary Oracles Oracles are common structures in algorithms. They are blackboxes with unknown internal structure. Most known quantum algorithms are constructed using quantum oracles, the Deutsch-Josza algorithm, Shor s algorithm, Grover s algorithm... Physical realizations o oracles place conditions on their unknown structure. (Unitarity in the quantum case) Main questions:

6 Unitary Oracles Oracles are common structures in algorithms. They are blackboxes with unknown internal structure. Most known quantum algorithms are constructed using quantum oracles, the Deutsch-Josza algorithm, Shor s algorithm, Grover s algorithm... Physical realizations o oracles place conditions on their unknown structure. (Unitarity in the quantum case) Main questions: What is the abstract structure o these oracles?

7 Unitary Oracles Oracles are common structures in algorithms. They are blackboxes with unknown internal structure. Most known quantum algorithms are constructed using quantum oracles, the Deutsch-Josza algorithm, Shor s algorithm, Grover s algorithm... Physical realizations o oracles place conditions on their unknown structure. (Unitarity in the quantum case) Main questions: What is the abstract structure o these oracles? Can we take advantage o this abstract setting to gain new insights?

8 Unitary Oracles The traditional Deutsch-Joza circuit is: s {0, 1} F {0,1} N m Oracle U F {0,1} N 0 F {0,1} σ 1

9 Unitary Oracles Here is its abstract structure: {0, 1} {0, 1} s 1 S F {0,1} N m Oracle U Oracle F {0,1} N F {0,1} σ S 1 2 σ

10 Unitary Oracles This is the oracle s internal structure: x (x) y Oracle x y

11 Unitary Oracles This is the oracle s internal structure: x (x) y Oracle x y Theorem Oracles with this abstract structure are unitary in general.

12 Categorical Quantum Inormation Deinition: A special -Frobenius algebra obeys: = = = = = = =

13 Categorical Quantum Inormation Deinition: A special -Frobenius algebra obeys: = = = = = = = This represents the abstract structure o an observable.

14 Complementary observables Deinition [Coecke & Duncan]: Two -Frobenius algebras on the same object are complementary when: d(a) =

15 Complementary observables Complementary observables in FHilb come rom inite abelian groups Copying Group multiplication :: g g g :: g 1 :: g 1 g 2 1 D g 1 g 2 :: 1 D 0

16 Classical Maps Deinition: A classical map : (A,, ) (B,, ) obeys: = =

17 Classical Maps Deinition: A classical map : (A,, ) (B,, ) obeys: = = These are sel-conjugate comonoid homomorphisms.

18 Unitarity Theorem Three -Frobenius algebras, (,, )

19 Unitarity Theorem Three -Frobenius algebras, (,, ) A pair are complementary ( and )

20 Unitarity Theorem Three -Frobenius algebras, (,, ) A pair are complementary ( and ) A classical map : (A,, ) (B,, ) Produce the unitary morphism: d(a)

21 Abstract proo o unitarity d(a)

22 Abstract proo o unitarity d(a)

23 Abstract proo o unitarity d(a)

24 Abstract proo o unitarity Frob. Hom. d(a)

25 Abstract proo o unitarity d(a)

26 Abstract proo o unitarity d(a)

27 Abstract proo o unitarity d(a)

28 Abstract proo o unitarity d(a)

29 Abstract proo o unitarity d(a)

30 Abstract proo o unitarity

31 Abstract proo o unitarity

32 Abstract proo o unitarity

33 Unitary Oracles We have deined (diagrammatically) an abstract structure required to make oracles physical.

34 Unitary Oracles We have deined (diagrammatically) an abstract structure required to make oracles physical. This lits the property o unitarity or quantum oracles to the more abstract setting o dagger monoidal categories.

35 Unitary Oracles We have deined (diagrammatically) an abstract structure required to make oracles physical. This lits the property o unitarity or quantum oracles to the more abstract setting o dagger monoidal categories. Can we take advantage o this abstract setting to gain new insights?

36 Unitary Oracles We have deined (diagrammatically) an abstract structure required to make oracles physical. This lits the property o unitarity or quantum oracles to the more abstract setting o dagger monoidal categories. Can we take advantage o this abstract setting to gain new insights? Yes. To develop a new group theoretic quantum algorithm To apply result in signal-low calculus

37 The group homomorphism identiication problem Deinition. (Group homomorphism identiication problem) Given inite groups G and A where A is abelian, and a blackbox unction : G A promised to be a group homomorphism, identiy.

38 The group homomorphism identiication problem Deinition. (Group homomorphism identiication problem) Given inite groups G and A where A is abelian, and a blackbox unction : G A promised to be a group homomorphism, identiy. Group representations are ρ : G Mat(n) Abelian C ρ Non-abelian Mat(n) ρ G G

39 The group homomorphism identiication problem Deinition. (Group homomorphism identiication problem) Given inite groups G and A where A is abelian, and a blackbox unction : G A promised to be a group homomorphism, identiy. Group representations are ρ : G Mat(n) Abelian C ρ Non-abelian Mat(n) ρ G G Group Representations as measurements: projections onto a subspace

40 The group homomorphism identiication problem Deinition. (Group homomorphism identiication problem) Given inite groups G and A where A is abelian, and a blackbox unction : G A promised to be a group homomorphism, identiy. Graphical rules or group representations: Mat(n) Mat(n) Mat(n) Mat(n) ρ = ρ ρ ρ = G G G G G G

41 The group homomorphism identiication algorithm Case: Let A be a cyclic group Z n. σ Measure the let system G A G Apply a unitary map 1 G ρ Prepare initial states

42 The group homomorphism identiication algorithm σ G A G 1 G ρ

43 The group homomorphism identiication algorithm G σ ρ A G ρ 1 G

44 The group homomorphism identiication algorithm σ ρ A G ρ

45 The group homomorphism identiication algorithm σ G A ρ ρ

46 The group homomorphism identiication algorithm σ G A ρ ρ ρ is an irreducible representation o A.

47 The group homomorphism identiication algorithm σ G A ρ ρ ρ is an irreducible representation o A. Choose ρ to be a aithul representation o A.

48 The group homomorphism identiication algorithm σ ρ G A ρ ρ is an irreducible representation o A. Choose ρ to be a aithul representation o A. Then measuring ρ identiies (up to isomorphism)

49 The group homomorphism identiication algorithm σ ρ G A ρ ρ is an irreducible representation o A. Choose ρ to be a aithul representation o A. Then measuring ρ identiies (up to isomorphism) One-dimensional representations are isomorphic only i they are equal.

50 The group homomorphism identiication algorithm Homomorphism : G A We generalize with proo by induction via the Structure Theorem. A = Z p1... Z pk Can identiy the group homomorphism in k oracle queries. The naive classical solution requires a number o queries equal to the number o actors o G rather than A.

51 Comparison to the hidden subgroup algorithm Group ID Hidden Subgroup σ σ G A G X G G 1 G ρ 1 G

52 Comparison to the hidden subgroup algorithm Group ID Hidden Subgroup σ σ G A G X G G 1 G ρ 1 G = i ρ i

53 FinRel k [Baez, Erlebe, Fong 2014] Deinition The category FinRel k o linear relations is deined in the ollowing way, or any ield k: Objects are inite dimensional k-vector spaces

54 FinRel k [Baez, Erlebe, Fong 2014] Deinition The category FinRel k o linear relations is deined in the ollowing way, or any ield k: Objects are inite dimensional k-vector spaces A morphism : V W is a linear relation, deined as a subspace S V W

55 FinRel k [Baez, Erlebe, Fong 2014] Deinition The category FinRel k o linear relations is deined in the ollowing way, or any ield k: Objects are inite dimensional k-vector spaces A morphism : V W is a linear relation, deined as a subspace S V W Composition o linear relations : U V and g : V W is deined as the ollowing subspace o U W : {(u, w) v V with (u, v) S and (v, w) S g } This deines a linear subspace o U W.

56 The signal-low calculus FinRel k r Addition Zero Copying Deletion Multiplier : k k k : {0} k : k k k : k {0} r : k k (a, b, a + b) (0, 0) (a, a, a) (a, 0) (a, ra) r

57 The signal-low calculus FinRel k r Addition Zero Copying Deletion Multiplier : k k k : {0} k : k k k : k {0} r : k k (a, b, a + b) (0, 0) (a, a, a) (a, 0) (a, ra) r Resistor i v + ir r i v

58 Conclusions (arxiv: ) Theorem A pair o complementary dagger-frobenius algebras, equipped with a classical map onto one o the algebras, produce a unitary morphism: d(a)

59 Conclusions (arxiv: ) Theorem A pair o complementary dagger-frobenius algebras, equipped with a classical map onto one o the algebras, produce a unitary morphism: d(a) Abstract understanding o oracle in quantum computation

60 Conclusions (arxiv: ) Theorem A pair o complementary dagger-frobenius algebras, equipped with a classical map onto one o the algebras, produce a unitary morphism: d(a) Abstract understanding o oracle in quantum computation Apply this to develop a new algorithm or the deterministic identiication o group homomorphisms into abelian groups.

61 Conclusions (arxiv: ) Theorem A pair o complementary dagger-frobenius algebras, equipped with a classical map onto one o the algebras, produce a unitary morphism: d(a) Abstract understanding o oracle in quantum computation Apply this to develop a new algorithm or the deterministic identiication o group homomorphisms into abelian groups. Find the same structure in the theory o signal-low networks.

62 Conclusions (arxiv: ) Theorem A pair o complementary dagger-frobenius algebras, equipped with a classical map onto one o the algebras, produce a unitary morphism: d(a) Abstract understanding o oracle in quantum computation Apply this to develop a new algorithm or the deterministic identiication o group homomorphisms into abelian groups. Find the same structure in the theory o signal-low networks. Big Idea: Symmetric monoidal categorical setting productively uniies process theories at an abstract level.

63 The Non-Abelian Case σ σ ρ G = 1 G ρ ψ ρ ψ