Yaoyun Shi

49 papers A* 6A 1Misc 1Journal 36Unranked 3
YearRankTypeTitle / Venue / Authors
2024 J jnl
A Classical Architecture for Digital Quantum Computers.
ACM Trans. Quantum Comput.
Fang Zhang, Xing Zhu, Rui Chao, Cupjin Huang, Linghang Kong, Guoyang Chen, Dawei Ding, Haishan Feng, Yihuai Gao, Xiaotong Ni, Liwei Qiu, Zhe Wei, Yueming Yang, Yang Zhao, Yaoyun Shi, Weifeng Zhang, Peng Zhou, Jianxin Chen
2023 J jnl
A Classical Architecture For Digital Quantum Computers.
CoRR
Fang Zhang, Xing Zhu, Rui Chao, Cupjin Huang, Linghang Kong, Guoyang Chen, Dawei Ding, Haishan Feng, Yihuai Gao, Xiaotong Ni, Liwei Qiu, Zhe Wei, Yueming Yang, Yang Zhao, Yaoyun Shi, Weifeng Zhang, Peng Zhou, Jianxin Chen
2021 J jnl
Efficient parallelization of tensor network contraction for simulating quantum computation.
Nat. Comput. Sci.
Cupjin Huang, Fang Zhang, Michael Newman, Xiaotong Ni, Dawei Ding, Junjie Cai, Xun Gao, Tenghui Wang, Feng Wu, Gengyan Zhang, Hsiang-Sheng Ku, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, Mario Szegedy, Yaoyun Shi, Hui-Hai Zhao, Chunqing Deng, Jianxin Chen
2020 J jnl
Parallel Device-Independent Quantum Key Distribution.
IEEE Trans. Inf. Theory
Rahul Jain, Carl A. Miller, Yaoyun Shi
2018 J jnl
Limitations on transversal computation through quantum homomorphic encryption.
Quantum Inf. Comput.
Michael Newman, Yaoyun Shi
2017 J jnl
Limitations on Transversal Computation through Quantum Homomorphic Encryption.
CoRR
Michael Newman, Yaoyun Shi
2017 J jnl
Randomness in nonlocal games between mistrustful players.
Quantum Inf. Comput.
Carl A. Miller, Yaoyun Shi
2017 J jnl
Universal Security for Randomness Expansion from the Spot-Checking Protocol.
SIAM J. Comput.
Carl A. Miller, Yaoyun Shi
2016 — ch.
Quantum Algorithm for the Parity Problem.
Encyclopedia of Algorithms
Yaoyun Shi
2016 J jnl
Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices.
J. ACM
Carl A. Miller, Yaoyun Shi
2015 J jnl
Epsilon-net method for optimizations over separable states.
Theor. Comput. Sci.
Yaoyun Shi, Xiaodi Wu
2014 A* conf
Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices.
STOC
Carl A. Miller, Yaoyun Shi
2013 J jnl
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States.
IEEE Trans. Inf. Theory
Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang
2013 A* conf
Efficient protocols of generating bipartite classical distributions and quantum states.
SODA
Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang
2013 — conf
Optimal Robust Self-Testing by Binary Nonlocal XOR Games.
TQC
Carl A. Miller, Yaoyun Shi
2012 J jnl
Correlation/Communication complexity of generating bipartite states
CoRR
Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang
2012 — conf
Epsilon-Net Method for Optimizations over Separable States.
ICALP (1)
Yaoyun Shi, Xiaodi Wu
2012 J jnl
Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities
CoRR
Yaoyun Shi
2011 J jnl
Constant-Degree Graph Expansions that Preserve Treewidth.
Algorithmica
Igor L. Markov, Yaoyun Shi
2011 J jnl
Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states.
Quantum Inf. Comput.
Eric Chitambar, Carl A. Miller, Yaoyun Shi
2010 J jnl
On the parity complexity measures of Boolean functions
CoRR
Zhiqiang Zhang, Yaoyun Shi
2010 J jnl
On the parity complexity measures of Boolean functions.
Theor. Comput. Sci.
Zhiqiang Zhang, Yaoyun Shi
2010 J jnl
Path auctions with multiple edge ownership.
Theor. Comput. Sci.
Ye Du, Rahul Sami, Yaoyun Shi
2010 J jnl
When is there a multipartite maximum entangled state?
Quantum Inf. Comput.
Runyao Duan, Yaoyun Shi
2009 J jnl
Characterizing locally indistinguishable orthogonal product states.
IEEE Trans. Inf. Theory
Yuan Feng, Yaoyun Shi
2009 J jnl
Communication complexities of symmetric XOR functions.
Quantum Inf. Comput.
Zhiqiang Zhang, Yaoyun Shi
2009 J jnl
Quantum communication complexity of block-composed functions.
Quantum Inf. Comput.
Yaoyun Shi, Yufan Zhu
2008 J jnl
Communication Complexities of XOR functions
CoRR
Yaoyun Shi, Zhiqiang Zhang
2008 — ch.
Quantum Algorithm for the Parity Problem.
Encyclopedia of Algorithms
Yaoyun Shi
2008 J jnl
Simulating Quantum Computation by Contracting Tensor Networks.
SIAM J. Comput.
Igor L. Markov, Yaoyun Shi
2008 J jnl
Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement.
SIAM J. Comput.
Yaoyun Shi, Yufan Zhu
2007 J jnl
Constant-degree graph expansions that preserve the treewidth
CoRR
Igor L. Markov, Yaoyun Shi
2007 — conf
Using Spam Farm to Boost PageRank.
AIRWeb
Ye Du, Yaoyun Shi, Xin Zhao
2006 Misc conf
On Multicast in Quantum Networks.
CISS
Yaoyun Shi, Emina Soljanin
2006 J jnl
The communication complexity of the Hamming distance problem.
Inf. Process. Lett.
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
2005 J jnl
Quantum and classical tradeoffs.
Theor. Comput. Sci.
Yaoyun Shi
2005 A* conf
Tensor norms and the classical communication complexity of nonlocal quantum measurement.
STOC
Yaoyun Shi
2004 J jnl
Distributed construction of quantum fingerprints.
Quantum Inf. Comput.
Andris Ambainis, Yaoyun Shi
2004 J jnl
Quantum and Classical Tradeoffs
Electron. Colloquium Comput. Complex.
Yaoyun Shi
2004 J jnl
Quantum lower bounds for the collision and the element distinctness problems.
J. ACM
Scott Aaronson, Yaoyun Shi
2003 J jnl
Both Toffoli and controlled-NOT need little help to do universal quantum computing.
Quantum Inf. Comput.
Yaoyun Shi
2002 J jnl
Entropy lower bounds for quantum decision tree complexity.
Inf. Process. Lett.
Yaoyun Shi
2002 J jnl
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.
Algorithmica
Peter Høyer, Jan Neerbek, Yaoyun Shi
2002 A* conf
Quantum Lower Bounds for the Collision and the Element Distinctness Problems.
FOCS
Yaoyun Shi
2001 A conf
Evasiveness of Subgraph Containment and Related Properties.
STACS
Amit Chakrabarti, Subhash Khot, Yaoyun Shi
2001 J jnl
Evasiveness of Subgraph Containment and Related Properties.
SIAM J. Comput.
Amit Chakrabarti, Subhash Khot, Yaoyun Shi
2001 A* conf
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity.
FOCS
Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao
2001 A* conf
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.
ICALP
Peter Høyer, Jan Neerbek, Yaoyun Shi
2000 J jnl
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables.
Inf. Process. Lett.
Yaoyun Shi