daowen qiu - aqis confaqis-conf.org/2017/wp-content/uploads/2017/09/d1_05_1a01_daowe… ·...
TRANSCRIPT
![Page 1: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/1.jpg)
Characterizations of symmetric partial Boolean functions with exact quantum query complexity
——Deutsch-Jozsa Problem
1
Daowen Qiu School of Data and Computer Science
Sun Yat-sen University, China
Joint work with Shenggen Zheng
arXiv:1603.06505(Qiu and Zheng)
2017AQIS
September 4-8, 2017, NUS, Singapore
2017AQIS
![Page 2: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/2.jpg)
Abstract In this talk, I would like to report a recent work regarding: 1. An optimal exact quantum query algorithm for generalized Deutsch-Jozsa problem 2. The characterization of all symmetric partial Boolean functions with exact quantum 1-query complexity
2
2017AQIS
![Page 3: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/3.jpg)
Basic background Discover more problems to show that
quantum computing is more powerful than classical computing These problems have the potential of
applications in other areas such as cryptography.
3
2017AQIS
![Page 4: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/4.jpg)
1. Motivations, Problems, Results 2. Preliminaries 3. Main Results 4. Methods of Proofs 5. Conclusions & Further Problems
4
2017AQIS
![Page 5: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/5.jpg)
1. Motivations, Problems, Results
(1) Generalized Deutsch-Jozsa (2) Problems with exact quantum 1-query
complexity
5 2017AQIS
![Page 6: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/6.jpg)
Motivation I
6
The Deutsch-Jozsa promise problem [DJ’92]: 𝑥 ∈ 0,1 𝑛, |x| is the Hamming weight of 𝑥,
𝐷𝐷 𝑥 = �01 𝑖𝑖 x = 0 𝑜𝑜 |x| = 𝑛𝑖𝑖 |x| = 𝑛/2
𝑄𝐸 𝐷𝐷 = 1,𝐷 𝐷𝐷 =𝑛2
+ 1
𝐷𝐷𝑛1 = �01 𝑖𝑖|x| ≤ 1 𝑜𝑜|x| ≥ 𝑛 − 1
𝑖𝑖|x| = 𝑛/2 [MJM’15]
𝑄𝐸 𝐷𝐷𝑛1 ≤ 2 [DJ’92] D. Deutsch, R. Jozsa, Rapid solution of problems by quantum computation, In Proceedings of the Royal Society of London, 439A (1992): 553—558. [MJM’15] A. Montanaro, R. Jozsa, G. Mitchison, On exact quantum query complexity, Algorithmica419 (2015) 775--796.
2017AQIS
![Page 7: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/7.jpg)
Problem I
7
2017AQIS
![Page 8: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/8.jpg)
Motivation II Deutsch-Jozsa problem that is a symmetric partial Boolean function can be solved by DJ algorithm (exact quantum 1-query algorithm). Then how to characterize the other symmetric partial Boolean functions with exact quantum 1-query complexity? Can such functions be solved by DJ algorithm?
8
![Page 9: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/9.jpg)
Problem and Result II
9
2017AQIS
![Page 10: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/10.jpg)
Preliminaries Symmetric partial Boolean functions Classical query complexity Quantum query complexity Multilinear polynomials
10
2017AQIS
![Page 11: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/11.jpg)
Symmetrical partial Boolean functions
11
![Page 12: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/12.jpg)
Representation of symmetric partial Boolean functions
12
![Page 13: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/13.jpg)
Isomorphism of symmetric partial Boolean functions
13
![Page 14: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/14.jpg)
Classical query complexity
14
An exact classical (deterministic) query algorithm to compute a Boolean function 𝑖: {0,1}𝑛 → {0,1} can be described by a decision tree.
If the output of a decision tree is 𝑖(𝑥), for all 𝑥 ∈ {0,1}𝑛, the decision tree is said to "compute" 𝑖. The depthof a tree is the maximum number of queries that can happen before a leaf is reached and a result obtained.
𝐷(𝑖), the deterministic decision tree complexity of 𝑖 is the smallest depth among all deterministic decision trees that compute 𝑖.
2017AQIS
![Page 15: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/15.jpg)
Example
15
Deterministic query complexity (how many times we need to query the input bits)
Example: 𝑖 𝑥1, 𝑥2 = 𝑥1 ⊕ 𝑥2
Decision treeThe minimal depth over all decision trees computing 𝑖 is the exact classical query complexity (deterministic query complexity, decision tree complexity) 𝐷(𝑖).
2017/1/2 1
𝑥1
𝑥2
0 1
0 1
𝑥2
1 01 1
2017AQIS
![Page 16: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/16.jpg)
Quantum query algorithms
16
U0 Q Q U1 UT …
2017AQIS
![Page 17: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/17.jpg)
Black box
17
𝑄𝑥
𝑄𝑥
2017AQIS
![Page 18: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/18.jpg)
Quantum query complexity
18
2017AQIS
![Page 19: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/19.jpg)
Multilinear polynomials
19
2017AQIS
![Page 20: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/20.jpg)
Multilinear polynomials representing symmetric partial Boolean functions
20
![Page 21: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/21.jpg)
Methods of Proofs We would like to outline the basic ideas and methods for the proofs of main results.
21
2017AQIS
![Page 22: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/22.jpg)
𝑫𝑱𝒏𝒌 = �𝟎𝟏 𝒊𝒊 𝒙 ≤ 𝒌 𝒐𝒐 |𝐱| ≥ 𝒏 − 𝒌
𝒊𝒊|𝐱| = 𝒏/𝟐
22
![Page 23: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/23.jpg)
𝑄𝐸 𝐷𝐷𝑛𝑘 ≤ 𝑘 + 1
23
2017AQIS
![Page 24: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/24.jpg)
24
![Page 25: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/25.jpg)
deg 𝐷𝐷𝑛𝑘 ≥ 2𝑘 + 2
25
2017AQIS
![Page 26: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/26.jpg)
Theorem:𝑸𝑬(𝒊) = 𝟏 𝒊𝒊 𝒂𝒏𝒂 𝒐𝒏𝒐𝒐 𝒊𝒊 𝒊 can be computed by DJ algorithm
26
where 𝑛 − 1 ≥ 𝑘 ≥ ⌊𝑛/2⌋, and 𝑛/2 ≥ 𝑙 ≥ ⌊𝑛/2⌋.
![Page 27: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/27.jpg)
Two Lemmas
27
2017AQIS
![Page 28: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/28.jpg)
Equivalence transformation
28
2017AQIS
![Page 29: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/29.jpg)
𝐷𝐷𝑛𝑘 = �01 𝑖𝑖 x ≤ 𝑘 𝑜𝑜 |x| ≥ 𝑛 − 𝑘
𝑖𝑖|x| = 𝑛/2
Theorem. 𝑄𝐸 𝐷𝐷𝑛𝑘 = 𝑘 + 1 and 𝐷 𝐷𝐷𝑛𝑘 = 𝑛/2 + 𝑘 + 1. Theorem. Any symmetric partial Boolean function 𝑖 has 𝑄𝐸(𝑖) = 1 if and only if 𝑖 can be computed by the Deutsch-Jozsa algorithm. Theorem.Any classical deterministic algorithm that solves Simon's problem requires Ω( 𝟐𝐧) queries.
2017/9/14 29
Conclusions
2017AQIS
![Page 30: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/30.jpg)
Let 𝑖: {0,1}𝑛 → {0,1} be an 𝑛-bit symmetric partial Boolean function with domain of definition 𝐷, and let 0 ≤ 𝑘 < ⌊𝑛
2⌋ . Then, for 2𝑘 + 1 ≤ deg 𝑖 ≤ 2(𝑘 + 1),
how to characterize 𝑖by giving all functions with degrees from 2𝑘 + 1 to 2𝑘 + 2?
For the function 𝐷𝑊𝑛𝑘,𝑙defined as:
can we give optimal exact quantum query algorithms for any 𝑘 and 𝑙?
2017/9/14 30
Problems
2017AQIS
![Page 31: Daowen Qiu - AQIS Confaqis-conf.org/2017/wp-content/uploads/2017/09/D1_05_1A01_Daowe… · Characterizations of symmetric partial Boolean functions with exact quantum query complexity](https://reader036.vdocument.in/reader036/viewer/2022071214/6042da7d4ff86a7bbb73fc28/html5/thumbnails/31.jpg)
Thank you for your attention!
31