ArXiv:1304.1245 Hing Yin Tsang 1, Chung Hoi Wong 1, Ning Xie 2, Shengyu Zhang 1 1.The Chinese University of Hong Kong 2.Florida International University.

Slides:

Advertisements

Similar presentations

The Polynomial Method In Quantum and Classical Computing Scott Aaronson (MIT) OPEN PROBLEM.

Advertisements

Lower Bounds for Local Search by Quantum Arguments Scott Aaronson.

How to Solve Longstanding Open Problems In Quantum Computing Using Only Fourier Analysis Scott Aaronson (MIT) For those who hate quantum: The open problems.

Parikshit Gopalan Georgia Institute of Technology Atlanta, Georgia, USA.

Computing with Polynomials over Composites Parikshit Gopalan Algorithms, Combinatorics & Optimization. Georgia Tech.

Hardness Amplification within NP against Deterministic Algorithms Parikshit Gopalan U Washington & MSR-SVC Venkatesan Guruswami U Washington & IAS.

Ryan ODonnell Carnegie Mellon University Karl Wimmer CMU & Duquesne Amir Shpilka Technion Rocco Servedio Columbia Parikshit Gopalan UW & Microsoft SVC.

Mechanism Design, Machine Learning, and Pricing Problems Maria-Florina Balcan.

Voronoi Diagrams in n· 2 O(√lglg n ) Time Timothy M. ChanMihai Pătraşcu STOC’07.

Preparing Projected Entangled Pair States on a Quantum Computer Martin Schwarz, Kristan Temme, Frank Verstraete University of Vienna, Faculty of Physics,

List decoding Reed-Muller codes up to minimal distance: Structure and pseudorandomness in coding theory Abhishek Bhowmick (UT Austin) Shachar Lovett.

The Stable Circuit Problem A Short Introduction Brendan Juba.

Graph Vertex Colorability & the Hardness Mengfei Cao COMP-150 Graph Theory Tufts University Dec. 15 th, Presentation for Final Project.

Linear Systems With Composite Moduli Arkadev Chattopadhyay (University of Toronto) Joint with: Avi Wigderson TexPoint fonts used in EMF. Read the TexPoint.

Quantum Spectrum Testing Ryan O’Donnell John Wright (CMU)

Unified Access Bound 1 [M. B ă doiu, R. Cole, E.D. Demaine, J. Iacono, A unified access bound on comparison- based dynamic dictionaries, Theoretical Computer.

Chris Beck, Russell Impagliazzo, Shachar Lovett. History of Sampling Problems Earliest uses of randomness in algorithms were for sampling, not decision.

Barry C. Sanders Institute for Quantum Information Science, University of Calgary with G Ahokas (Calgary), D W Berry (Macquarie), R Cleve (Waterloo), P.

On the tightness of Buhrman- Cleve-Wigderson simulation Shengyu Zhang The Chinese University of Hong Kong On the relation between decision tree complexity.

On Uniform Amplification of Hardness in NP Luca Trevisan STOC 05 Paper Review Present by Hai Xu.

Undirected ST-Connectivity 2 DL Omer Reingold, STOC 2005: Presented by: Fenghui Zhang CPSC 637 – paper presentation.

Exact Learning of Boolean Functions with Queries Lisa Hellerstein Polytechnic University Brooklyn, NY AMS Short Course on Statistical Learning Theory,

Quantum Algorithms I Andrew Chi-Chih Yao Tsinghua University & Chinese U. of Hong Kong.

Hardness amplification proofs require majority Emanuele Viola Columbia University Work done at Harvard, IAS, and Columbia Joint work with Ronen Shaltiel.

Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.

Shengyu Zhang CSE CUHK. Roadmap Intro to theoretical computer science Intro to quantum computing Export of quantum computing –Formula Evaluation.

Shengyu Zhang The Chinese University of Hong Kong.

Beating the Union Bound by Geometric Techniques Raghu Meka (IAS & DIMACS)

1 Institute for Theoretical Computer Science, IIIS Tsinghua university, Beijing Iddo Tzameret Based on joint work with Sebastian Müller (Prague)

Correlation testing for affine invariant properties on Shachar Lovett Institute for Advanced Study Joint with Hamed Hatami (McGill)

Simple and Improved Parameterized Algorithms for Multiterminal Cuts Mingyu Xiao The Chinese University of Hong Kong Hong Kong SAR, CHINA CSR 2008 Presentation,

Applications of types of SATs Arash Ahadi What is SAT?

Problems and MotivationsOur ResultsTechnical Contributions Membership: Maintain a set S in the universe U with |S| ≤ n. Given an x in U, answer whether.

Equality Function Computation (How to make simple things complicated) Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Guanfeng.

Distributed Coloring Discrete Mathematics and Algorithms Seminar Melih Onus November

Pseudorandomness Emanuele Viola Columbia University April 2008.

Yang Liu Shengyu Zhang The Chinese University of Hong Kong Fast quantum algorithms for Least Squares Regression and Statistic Leverage Scores.

Communication Complexity Rahul Jain Centre for Quantum Technologies and Department of Computer Science National University of Singapore. TexPoint fonts.

One-way multi-party communication lower bound for pointer jumping with applications Emanuele Viola & Avi Wigderson Columbia University IAS work done while.

Shengyu Zhang The Chinese University of Hong Kong.

Information Complexity: an Overview Rotem Oshman, Princeton CCI Based on work by Braverman, Barak, Chen, Rao, and others Charles River Science of Information.

Polynomials Emanuele Viola Columbia University work partially done at IAS and Harvard University December 2007.

Massive Data Sets and Information Theory Ziv Bar-Yossef Department of Electrical Engineering Technion.

Exact quantum algorithms Andris Ambainis University of Latvia.

Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty protocols Emanuele Viola, IAS (Work partially done during postdoc at Harvard)

Unique Games Approximation Amit Weinstein Complexity Seminar, Fall 2006 Based on: “Near Optimal Algorithms for Unique Games" by M. Charikar, K. Makarychev,

Random Geometric Graph Model Model for ad hoc/sensor networks n nodes placed in d-dim space Connectivity threshold r Two nodes u,v connected iff ||u-v||

Hardness amplification proofs require majority Emanuele Viola Columbia University Work also done at Harvard and IAS Joint work with Ronen Shaltiel University.

Lower Bounds Emanuele Viola Columbia University February 2008.

Sketching and Embedding are Equivalent for Norms Alexandr Andoni (Columbia) Robert Krauthgamer (Weizmann Inst) Ilya Razenshteyn (MIT) 1.

An additive combinatorics approach to the log-rank conjecture in communication complexity Noga Zewi Technion – Israel Institute of Technology Joint work.

Additive Combinatorics in Theoretical Computer Science Shachar Lovett (UCSD)

Information Complexity Lower Bounds

List Order Maintenance

Degree and Sensitivity: tails of two distributions

Monomer-dimer model and a new deterministic approximation algorithm for computing a permanent of a 0,1 matrix David Gamarnik MIT Joint work with Dmitriy.

Joint work with Avishay Tal (IAS) and Jiapeng Zhang (UCSD)

Effcient quantum protocols for XOR functions

Structural Properties of Low Threshold Rank Graphs

Tight Fourier Tails for AC0 Circuits

Linear sketching with parities

Quantum Computing in Theoretical Computer Science Shengyu Zhang

Linear sketching over

Advances in Linear Sketching over Finite Fields

Gautam Kamath Simons Institute  University of Waterloo

Linear sketching with parities

طبقه بندی نشریات علمی و فنی

The Stable Circuit Problem

 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix

Shengyu Zhang The Chinese University of Hong Kong

Presentation transcript:

arXiv: Hing Yin Tsang 1, Chung Hoi Wong 1, Ning Xie 2, Shengyu Zhang 1 1.The Chinese University of Hong Kong 2.Florida International University 1

Motivation 1: Fourier analysis BoolFourier (sparsified) 2

Some known results *1. Kushilevitz, Mansour, SIAM J. on Computing, *2. Gopalan, O’Donnell, Servedio, Shpilka, Wimmer, SIAM J. on Computing, *3. Green and Sanders. Geometric and Functional Analysis,

Motivation 2: Communication complexity *1. Yao. STOC,

Log-rank conjecture *1. Melhorn, Schmidt. STOC, *2. Lovász, Saks. FOCS, *3. Lovász. Book Chapter, *4. Valiant. Info. Proc. Lett., *5. Ambainis, Schulman, Ta-Shma, Vazirani, Wigderson, SICOMP *6. Nisan and Wigderson. Combinatorica, *7. Kotlov. Journal of Graph Theory, *8. Ben-Sasson, Lovett, Ron-Zewi, FOCS, Log Rank Conjecture* 2 5

Special class of functions *1. Zhang and Shi. Theoretical Computer Science,

One easy case *1. Nisan and Smolensky. Unpublished. *2. Midrijanis. arXiv/quant-ph/ , *3. Zhang and Shi. Theoretical Computer Science,

Previous work *1. Zhang and Shi. Quantum Information & Computation, *2. Montanaro and Osborne. arXiv: v2, *3. Kulkarni and Santha. CIAC,

Our results: starting point *1. Bernasconi and Codenotti. IEEE Transactions on Computers,

Our results: constant degree 10

Our results: constant degree [GS08] Green and Sanders. Geometric and Functional Analysis,

Our results: small spectral norm [SV13] Shpilka and Volk. ECCC,

Our results: small spectral norm [Lov13] Lovett. ECCC,

Our results: small spectral norm [Gro97] Grolmusz. Theoretical Computer Science,

Our results: light tail 15

Techniques ResultsTechniques Main PDT Algorithm + bound by degree reduction Main PDT Algorithm + greedy folding Chang’s lemma * 1 + a rounding lemma * 2 *1. Chang. Duke Mathematical Journal, *2. Gopalan, O’Donnell, Servedio, Shpilka, Wimmer. SIAM Journal on Computing,

Approach: Degree reduction *1. Green and Tao. Contributions to Discrete Mathematics, *2. Kaufman and Lovett. FOCS,

A new rank 18

Main Protocol 19

Main conjecture 20

Sketch of proof of Thm 1, item (1) 21

Sketch of proof of Thm 1, item (1) 22

fResults Low degree Small spectral norm Light tail 23 Summary

Open 24

25