Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. - Yaoyun Shi (Inf. Process. Lett., 2000)

Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. - Amit Chakrabarti; Yaoyun Shi; Anthony Wirth; Andrew Chi-Chih Yao (FOCS, 2001)

Evasiveness of Subgraph Containment and Related Properties. - Amit Chakrabarti; Subhash Khot; Yaoyun Shi (SIAM J. Comput., 2001)

Quantum Lower Bounds for the Collision and the Element Distinctness Problems. - Yaoyun Shi (FOCS, 2002)

Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. - Peter Høyer; Jan Neerbek; Yaoyun Shi (Algorithmica, 2002)

Entropy lower bounds for quantum decision tree complexity. - Yaoyun Shi (Inf. Process. Lett., 2002)

Both Toffoli and controlled-NOT need little help to do universal quantum computing. - Yaoyun Shi (Quantum Inf. Comput., 2003)

Quantum lower bounds for the collision and the element distinctness problems. - Scott Aaronson; Yaoyun Shi (J. ACM, 2004)

Distributed construction of quantum fingerprints. - Andris Ambainis; Yaoyun Shi (Quantum Inf. Comput., 2004)

Tensor norms and the classical communication complexity of nonlocal quantum measurement. - Yaoyun Shi (STOC, 2005)

Quantum and classical tradeoffs. - Yaoyun Shi (Theor. Comput. Sci., 2005)

On Multicast in Quantum Networks. - Yaoyun Shi; Emina Soljanin (CISS, 2006)

The communication complexity of the Hamming distance problem. - Wei Huang; Yaoyun Shi; Shengyu Zhang 002; Yufan Zhu (Inf. Process. Lett., 2006)

Using Spam Farm to Boost PageRank. - Ye Du; Yaoyun Shi; Xin Zhao 016 (AIRWeb, 2007)

Communication Complexities of XOR functions - Yaoyun Shi; Zhiqiang Zhang (CoRR, 2008)

Simulating Quantum Computation by Contracting Tensor Networks. - Igor L. Markov; Yaoyun Shi (SIAM J. Comput., 2008)

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement. - Yaoyun Shi; Yufan Zhu (SIAM J. Comput., 2008)

Quantum Algorithm for the Parity Problem. - Yaoyun Shi (Encyclopedia of Algorithms, 2008)

Quantum communication complexity of block-composed functions. - Yaoyun Shi; Yufan Zhu (Quantum Inf. Comput., 2009)

Communication complexities of symmetric XOR functions. - Zhiqiang Zhang; Yaoyun Shi (Quantum Inf. Comput., 2009)

Characterizing locally indistinguishable orthogonal product states. - Yuan Feng 001; Yaoyun Shi (IEEE Trans. Inf. Theory, 2009)

When is there a multipartite maximum entangled state? - Runyao Duan; Yaoyun Shi (Quantum Inf. Comput., 2010)

Path auctions with multiple edge ownership. - Ye Du; Rahul Sami; Yaoyun Shi (Theor. Comput. Sci., 2010)

On the parity complexity measures of Boolean functions. - Zhiqiang Zhang; Yaoyun Shi (Theor. Comput. Sci., 2010)

Constant-Degree Graph Expansions that Preserve Treewidth. - Igor L. Markov; Yaoyun Shi (Algorithmica, 2011)

Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states. - Eric Chitambar; Carl A. Miller; Yaoyun Shi (Quantum Inf. Comput., 2011)

Correlation/Communication complexity of generating bipartite states - Rahul Jain 001; Yaoyun Shi; Zhaohui Wei; Shengyu Zhang 002 (CoRR, 2012)

Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities - Yaoyun Shi (CoRR, 2012)

Optimal Robust Self-Testing by Binary Nonlocal XOR Games. - Carl A. Miller; Yaoyun Shi (TQC, 2013)

Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States. - Rahul Jain 001; Yaoyun Shi; Zhaohui Wei; Shengyu Zhang 002 (IEEE Trans. Inf. Theory, 2013)

Epsilon-net method for optimizations over separable states. - Yaoyun Shi; Xiaodi Wu 001 (Theor. Comput. Sci., 2015)

Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices. - Carl A. Miller; Yaoyun Shi (J. ACM, 2016)

Quantum Algorithm for the Parity Problem. - Yaoyun Shi (Encyclopedia of Algorithms, 2016)

Randomness in nonlocal games between mistrustful players. - Carl A. Miller; Yaoyun Shi (Quantum Inf. Comput., 2017)

Universal Security for Randomness Expansion from the Spot-Checking Protocol. - Carl A. Miller; Yaoyun Shi (SIAM J. Comput., 2017)

Limitations on transversal computation through quantum homomorphic encryption. - Michael Newman; Yaoyun Shi (Quantum Inf. Comput., 2018)

Parallel Device-Independent Quantum Key Distribution. - Rahul Jain 001; Carl A. Miller; Yaoyun Shi (IEEE Trans. Inf. Theory, 2020)

Efficient parallelization of tensor network contraction for simulating quantum computation. - Cupjin Huang; Fang Zhang; Michael Newman; Xiaotong Ni; Dawei Ding 002; Junjie Cai; Xun Gao; Tenghui Wang; Feng Wu; Gengyan Zhang; Hsiang-Sheng Ku; Zhengxiong Tian; et al. (Nat. Comput. Sci., 2021)

A Classical Architecture For Digital Quantum Computers. - Fang Zhang; Xing Zhu; Rui Chao; Cupjin Huang; Linghang Kong; Guoyang Chen; Dawei Ding 002; Haishan Feng; Yihuai Gao; Xiaotong Ni; Liwei Qiu; Zhe Wei; et al. (CoRR, 2023)