default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaoyun Shi
Person information
- affiliation: University of Michigan, Ann Arbor, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i8]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:
A Classical Architecture For Digital Quantum Computers. CoRR abs/2305.14304 (2023)- 2021
- [j27]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:
Efficient parallelization of tensor network contraction for simulating quantum computation. Nat. Comput. Sci. 1(9): 578-587 (2021) - 2020
- [j26]Rahul Jain, Carl A. Miller, Yaoyun Shi:
Parallel Device-Independent Quantum Key Distribution. IEEE Trans. Inf. Theory 66(9): 5567-5584 (2020)
2010 – 2019
- 2018
- [j25]Michael Newman, Yaoyun Shi:
Limitations on transversal computation through quantum homomorphic encryption. Quantum Inf. Comput. 18(11&12): 927-948 (2018) - 2017
- [j24]Carl A. Miller, Yaoyun Shi:
Randomness in nonlocal games between mistrustful players. Quantum Inf. Comput. 17(7&8): 595-610 (2017) - [j23]Carl A. Miller, Yaoyun Shi:
Universal Security for Randomness Expansion from the Spot-Checking Protocol. SIAM J. Comput. 46(4): 1304-1335 (2017) - [i7]Michael Newman, Yaoyun Shi:
Limitations on Transversal Computation through Quantum Homomorphic Encryption. CoRR abs/1704.07798 (2017) - 2016
- [j22]Carl A. Miller, Yaoyun Shi:
Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices. J. ACM 63(4): 33:1-33:63 (2016) - [r2]Yaoyun Shi:
Quantum Algorithm for the Parity Problem. Encyclopedia of Algorithms 2016: 1667-1669 - 2015
- [j21]Yaoyun Shi, Xiaodi Wu:
Epsilon-net method for optimizations over separable states. Theor. Comput. Sci. 598: 51-63 (2015) - 2014
- [c11]Carl A. Miller, Yaoyun Shi:
Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices. STOC 2014: 417-426 - 2013
- [j20]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States. IEEE Trans. Inf. Theory 59(8): 5171-5178 (2013) - [c10]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Efficient protocols of generating bipartite classical distributions and quantum states. SODA 2013: 1503-1512 - [c9]Carl A. Miller, Yaoyun Shi:
Optimal Robust Self-Testing by Binary Nonlocal XOR Games. TQC 2013: 254-262 - 2012
- [c8]Yaoyun Shi, Xiaodi Wu:
Epsilon-Net Method for Optimizations over Separable States. ICALP (1) 2012: 798-809 - [i6]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Correlation/Communication complexity of generating bipartite states. CoRR abs/1203.1153 (2012) - [i5]Yaoyun Shi:
Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities. CoRR abs/1203.2675 (2012) - 2011
- [j19]Igor L. Markov, Yaoyun Shi:
Constant-Degree Graph Expansions that Preserve Treewidth. Algorithmica 59(4): 461-470 (2011) - [j18]Eric Chitambar, Carl A. Miller, Yaoyun Shi:
Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states. Quantum Inf. Comput. 11(9&10): 813-819 (2011) - 2010
- [j17]Runyao Duan, Yaoyun Shi:
When is there a multipartite maximum entangled state? Quantum Inf. Comput. 10(11&12): 925-935 (2010) - [j16]Ye Du, Rahul Sami, Yaoyun Shi:
Path auctions with multiple edge ownership. Theor. Comput. Sci. 411(1): 293-300 (2010) - [j15]Zhiqiang Zhang, Yaoyun Shi:
On the parity complexity measures of Boolean functions. Theor. Comput. Sci. 411(26-28): 2612-2618 (2010) - [i4]Zhiqiang Zhang, Yaoyun Shi:
On the parity complexity measures of Boolean functions. CoRR abs/1004.0436 (2010)
2000 – 2009
- 2009
- [j14]Zhiqiang Zhang, Yaoyun Shi:
Communication complexities of symmetric XOR functions. Quantum Inf. Comput. 9(3&4): 255-263 (2009) - [j13]Yaoyun Shi, Yufan Zhu:
Quantum communication complexity of block-composed functions. Quantum Inf. Comput. 9(5&6): 444-460 (2009) - [j12]Yuan Feng, Yaoyun Shi:
Characterizing locally indistinguishable orthogonal product states. IEEE Trans. Inf. Theory 55(6): 2799-2806 (2009) - 2008
- [j11]Yaoyun Shi, Yufan Zhu:
Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement. SIAM J. Comput. 38(3): 753-766 (2008) - [j10]Igor L. Markov, Yaoyun Shi:
Simulating Quantum Computation by Contracting Tensor Networks. SIAM J. Comput. 38(3): 963-981 (2008) - [r1]Yaoyun Shi:
Quantum Algorithm for the Parity Problem. Encyclopedia of Algorithms 2008 - [i3]Yaoyun Shi, Zhiqiang Zhang:
Communication Complexities of XOR functions. CoRR abs/0808.1762 (2008) - 2007
- [c7]Ye Du, Yaoyun Shi, Xin Zhao:
Using Spam Farm to Boost PageRank. AIRWeb 2007: 29-36 - [i2]Igor L. Markov, Yaoyun Shi:
Constant-degree graph expansions that preserve the treewidth. CoRR abs/0707.3622 (2007) - 2006
- [j9]Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu:
The communication complexity of the Hamming distance problem. Inf. Process. Lett. 99(4): 149-153 (2006) - [c6]Yaoyun Shi, Emina Soljanin:
On Multicast in Quantum Networks. CISS 2006: 871-876 - 2005
- [j8]Yaoyun Shi:
Quantum and classical tradeoffs. Theor. Comput. Sci. 344(2-3): 335-345 (2005) - [c5]Yaoyun Shi:
Tensor norms and the classical communication complexity of nonlocal quantum measurement. STOC 2005: 460-467 - 2004
- [j7]Scott Aaronson, Yaoyun Shi:
Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4): 595-605 (2004) - [j6]Andris Ambainis, Yaoyun Shi:
Distributed construction of quantum fingerprints. Quantum Inf. Comput. 4(2): 146-151 (2004) - [i1]Yaoyun Shi:
Quantum and Classical Tradeoffs. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j5]Yaoyun Shi:
Both Toffoli and controlled-NOT need little help to do universal quantum computing. Quantum Inf. Comput. 3(1): 84-92 (2003) - 2002
- [j4]Peter Høyer, Jan Neerbek, Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Algorithmica 34(4): 429-448 (2002) - [j3]Yaoyun Shi:
Entropy lower bounds for quantum decision tree complexity. Inf. Process. Lett. 81(1): 23-27 (2002) - [c4]Yaoyun Shi:
Quantum Lower Bounds for the Collision and the Element Distinctness Problems. FOCS 2002: 513-519 - 2001
- [j2]Amit Chakrabarti, Subhash Khot, Yaoyun Shi:
Evasiveness of Subgraph Containment and Related Properties. SIAM J. Comput. 31(3): 866-875 (2001) - [c3]Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao:
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. FOCS 2001: 270-278 - [c2]Peter Høyer, Jan Neerbek, Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ICALP 2001: 346-357 - [c1]Amit Chakrabarti, Subhash Khot, Yaoyun Shi:
Evasiveness of Subgraph Containment and Related Properties. STACS 2001: 110-120 - 2000
- [j1]Yaoyun Shi:
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. Inf. Process. Lett. 75(1-2): 79-83 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
