# Penghui Yao (姚鹏晖) --- **E-mail:** pyao at nju dot edu dot cn **Office:** Room #502, Department of Computer Science and Technology, Xianlin Campus of Nanjing University --- I am faculty member in [Department of Computer Science and Technology](http://cs.nju.edu.cn/) at [Nanjing University](http://cs.nju.edu.cn/). I am a member of [CS Theory group](http://tcs.nju.edu.cn/). --- ## Research Interests * **Information Theory** * **Computational Complexity** * **Communication Complexity** * **Fourier analysis in Theoretical Computer Science and Quantum Computation** ## Brief Bio I obtained Bsc. from [East China Normal University](https://www.ecnu.edu.cn/) majored in mathematics and Ph.D. degree from [Centre for Quantum Technologies](https://www.quantumlah.org/), [National University of Singapore](http://www.nus.edu.sg) fortunately supervised by [Rahul Jain](https://www.comp.nus.edu.sg/~rahul/) and [Miklos Santha](https://www.irif.fr/~santha/). Prior to joining Nanjing University, I was a postdocotral researcher at [Centrum Wiskunde & Informatica(CWI)](https://www.cwi.nl/), then [Institute for Quantum Computing (IQC)](https://uwaterloo.ca/institute-for-quantum-computing/) at [University of Waterloo](https://uwaterloo.ca/), then Hartree postoral research fellow at [Joint Center for Quantum Information and Computer Science (QuICS)](https://quics.umd.edu/), [University of Maryland](http://www.umd.edu/). My full cv is [here](cv/cv.pdf). ## Teaching * [Fall 2018, Nanjing University] [*Computational Complexity*](http://tcs.nju.edu.cn/wiki/index.php/%E8%AE%A1%E7%AE%97%E5%A4%8D%E6%9D%82%E6%80%A7_%28Fall_2018%29) ## Students * 2019.4- : Minglong Qin (Ph.D.) * 2019.4- : Yangjing Dong (Undergraduate) ** I am Hiring! ** I am looking for self-motivated students who are interested in pursuing a PhD. degree with me. Please feel free to contact me. ## Publications and preprints [DBLP](https://dblp.org/pers/hd/y/Yao:Penghui), [Scholar](https://scholar.google.com/citations?hl=en&user=iFxJ6XIAAAAJ&view_op=list_works&sortby=pubdate) * **A doubly exponential upper bound on noisy EPR states for binary games**,[\[arxiv\]](https://arxiv.org/abs/1904.08832) * **Quantum Insertion-Deletion Channels**, with [Dave Touchette](https://www.perimeterinstitute.ca/people/dave-touchette).[\[arxiv\]](https://arxiv.org/abs/1901.00984) * **Expected communication cost of distributed quantum tasks**, with [Anurag Anshu](https://services.iqc.uwaterloo.ca/people/profile/aanshu/) and Ankit Garg and [Aram Harrow](http://web.mit.edu/aram/www/) . *IEEE Transaction on Information Theory 2018*. [\[link\]](https://ieeexplore.ieee.org/document/8388256) [\[arxiv\]](https://arxiv.org/abs/1605.04601v3) * **Capacity approaching coding for low noise interactive quantum communication**, with [Debbie Leung](http://www.math.uwaterloo.ca/~wcleung/) and [Ashwin Nayak](http://www.math.uwaterloo.ca/~anayak/Site/Home.html) and Ala Shayeghi and [Dave Touchette](https://www.perimeterinstitute.ca/people/dave-touchette) and [Nengkun Yu](https://www.uts.edu.au/staff/nengkun.yu). *ACM Symposium on Theory of Computing (STOC), 2018. QIP 2018*. [\[link\]](https://dl.acm.org/citation.cfm?doid=3188745.3188908) * **Exponential separation of quantum communication and classical information**, with [Anurag Anshu](https://services.iqc.uwaterloo.ca/people/profile/aanshu/) and [Dave Touchette](https://www.perimeterinstitute.ca/people/dave-touchette) and [Nengkun Yu](https://www.uts.edu.au/staff/nengkun.yu). *ACM Symposium on Theory of Computing (STOC), 2017. Plenary talk QIP 2017*. [\[link\]](https://dl.acm.org/citation.cfm?id=3055401) [\[arxiv\]](https://arxiv.org/abs/1611.08946) * **Multipartite quantum correlation and communication complexities**, with [Rahul Jain](https://www.comp.nus.edu.sg/~rahul/) and [Zhaohui Wei](https://iiis.tsinghua.edu.cn/en/weizh/) and [Shengyu Zhang](http://www.cse.cuhk.edu.hk/~syzhang/) *Computational Complexity 2017*. [\[link\]](https://link.springer.com/article/10.1007/s00037-016-0126-y) [\[arxiv\]](https://arxiv.org/abs/1405.6015v3) * **New one shot quantum protocols with application to communication complexity**, with [Anurag Anshu](https://services.iqc.uwaterloo.ca/people/profile/aanshu/) and [Rahul Jain](https://www.comp.nus.edu.sg/~rahul/) and Priyanka Mukhopadhyay and Ala Shayeghi. *IEEE Transaction on Information Theory 2016*. [\[link\]](https://ieeexplore.ieee.org/document/7587434/) [\[arxiv\]](https://arxiv.org/abs/1404.1366) * **A direct product theorem for two-party bounded-round public-coin communication complexity**, with [Rahul Jain](https://www.comp.nus.edu.sg/~rahul/) and Attila Pereszlenyi. *IEEE Symposium on Foundations of Computer Science (FOCS) 2012, special issue in Algorithmica 2016*. [\[link\]](https://ieeexplore.ieee.org/document/6375294) [\[arxiv\]](https://arxiv.org/abs/1201.1666) * **Lower bound on expected communication cost of quantum huffman coding**, with [Anurag Anshu](https://services.iqc.uwaterloo.ca/people/profile/aanshu/) and Ankit Garg and [Aram Harrow](http://web.mit.edu/aram/www/). *Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 2016*. [\[link\]](http://drops.dagstuhl.de/opus/volltexte/2016/6684/) * **A parallel repetition theorem for entangled two-player one-round games under product distributions**, with [Rahul Jain](https://www.comp.nus.edu.sg/~rahul/) and Attila Pereszlenyi. *IEEE Conference on Computational Complexity (CCC) 2014*. [\[link\]](https://ieeexplore.ieee.org/abstract/document/6875490) [\[arxiv\]](https://arxiv.org/abs/1311.6309) * **A parallel approximation algorithm for positive semidefinite programming**, with [Rahul Jain](https://www.comp.nus.edu.sg/~rahul/). *IEEE Symposium on Foundations of Computer Science (FOCS) 2011*. [\[link\]](https://ieeexplore.ieee.org/abstract/document/6108207/) [\[arxiv\]](https://arxiv.org/abs/1104.2502) ## Resources A collection of references that I think may be useful for the students and reseachers who are interested in the theory aspect of quantum information and quantum computation. * [The theory of Quantum Information](https://www.cambridge.org/core/books/theory-of-quantum-information/AE4AA5638F808D2CFEB070C55431D897) by John Watrous. * [Quantum Computation and Quantum Information](https://www.amazon.com/Quantum-Computation-Information-10th-Anniversary/dp/1107002176) by Michael Nielsen and Isaac Chuang. * [Quantum Computing since Democritus](https://www.amazon.com/Quantum-Computing-since-Democritus-Aaronson/dp/0521199565/ref=pd_sim_14_2?_encoding=UTF8&pd_rd_i=0521199565&pd_rd_r=PFA6E1AADD13EF42CMPZ&pd_rd_w=Zx9Gs&pd_rd_wg=O132x&psc=1&refRID=PFA6E1AADD13EF42CMPZ) by Scott Aaronson. * [Quantum Proofs](https://arxiv.org/abs/1610.01664) by Thomas Vidick and John Watrous. * [Lecture Notes on Quantum Algorithms](http://www.cs.umd.edu/~amchilds/qa/) by Andrew Childs. * Ronald de Wolf's course at CWI [\[link\]](https://homepages.cwi.nl/~rdewolf/qc11.html) * Ryan O'Donnell's course at CMU [\[link\]](http://www.cs.cmu.edu/~odonnell/quantum15/)