Yaoyun Shi

Orcid: 0000-0001-5523-6166

Affiliations:

University of Michigan, Ann Arbor, USA

According to our database¹, Yaoyun Shi authored at least 39 papers between 2000 and 2023.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

A Classical Architecture For Digital Quantum Computers.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Efficient parallelization of tensor network contraction for simulating quantum computation.

[BibT_eX]

[DOI]

Nat. Comput. Sci., 2021

2020

Parallel Device-Independent Quantum Key Distribution.

[BibT_eX]

[DOI]

Rahul Jain

Carl A. Miller

Yaoyun Shi

IEEE Trans. Inf. Theory, 2020

2018

Limitations on transversal computation through quantum homomorphic encryption.

[BibT_eX]

[DOI]

Michael Newman

Yaoyun Shi

Quantum Inf. Comput., 2018

2017

Universal Security for Randomness Expansion from the Spot-Checking Protocol.

[BibT_eX]

[DOI]

Carl A. Miller

Yaoyun Shi

SIAM J. Comput., 2017

Randomness in nonlocal games between mistrustful players.

[BibT_eX]

[DOI]

Carl A. Miller

Yaoyun Shi

Quantum Inf. Comput., 2017

2016

Quantum Algorithm for the Parity Problem.

[BibT_eX]

[DOI]

Yaoyun Shi

Encyclopedia of Algorithms, 2016

Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices.

[BibT_eX]

[DOI]

Carl A. Miller

Yaoyun Shi

J. ACM, 2016

2015

Epsilon-net method for optimizations over separable states.

[BibT_eX]

[DOI]

Yaoyun Shi

Xiaodi Wu

Theor. Comput. Sci., 2015

2013

Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Optimal Robust Self-Testing by Binary Nonlocal XOR Games.

[BibT_eX]

[DOI]

Carl A. Miller

Yaoyun Shi

Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013

2012

Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities

[BibT_eX]

[DOI]

Yaoyun Shi

CoRR, 2012

Correlation/Communication complexity of generating bipartite states

[BibT_eX]

[DOI]

CoRR, 2012

2011

Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states.

[BibT_eX]

[DOI]

Eric Chitambar

Carl A. Miller

Yaoyun Shi

Quantum Inf. Comput., 2011

Constant-Degree Graph Expansions that Preserve Treewidth.

[BibT_eX]

[DOI]

Igor L. Markov

Yaoyun Shi

Algorithmica, 2011

2010

On the parity complexity measures of Boolean functions.

[BibT_eX]

[DOI]

Zhiqiang Zhang

Yaoyun Shi

Theor. Comput. Sci., 2010

Path auctions with multiple edge ownership.

[BibT_eX]

[DOI]

Ye Du

Rahul Sami

Yaoyun Shi

Theor. Comput. Sci., 2010

When is there a multipartite maximum entangled state?

[BibT_eX]

[DOI]

Runyao Duan

Yaoyun Shi

Quantum Inf. Comput., 2010

2009

Characterizing locally indistinguishable orthogonal product states.

[BibT_eX]

[DOI]

Yuan Feng

Yaoyun Shi

IEEE Trans. Inf. Theory, 2009

Communication complexities of symmetric XOR functions.

[BibT_eX]

[DOI]

Zhiqiang Zhang

Yaoyun Shi

Quantum Inf. Comput., 2009

Quantum communication complexity of block-composed functions.

[BibT_eX]

[DOI]

Yaoyun Shi

Yufan Zhu

Quantum Inf. Comput., 2009

2008

Quantum Algorithm for the Parity Problem.

[BibT_eX]

[DOI]

Yaoyun Shi

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement.

[BibT_eX]

[DOI]

Yaoyun Shi

Yufan Zhu

SIAM J. Comput., 2008

Simulating Quantum Computation by Contracting Tensor Networks.

[BibT_eX]

[DOI]

Igor L. Markov

Yaoyun Shi

SIAM J. Comput., 2008

Communication Complexities of XOR functions

[BibT_eX]

[DOI]

Yaoyun Shi

Zhiqiang Zhang

CoRR, 2008

2007

Using Spam Farm to Boost PageRank.

[BibT_eX]

[DOI]

Ye Du

Yaoyun Shi

Xin Zhao

Proceedings of the AIRWeb 2007, 2007

2006

The communication complexity of the Hamming distance problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

On Multicast in Quantum Networks.

[BibT_eX]

[DOI]

Yaoyun Shi

Emina Soljanin

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005

Quantum and classical tradeoffs.

[BibT_eX]

[DOI]

Yaoyun Shi

Theor. Comput. Sci., 2005

Tensor norms and the classical communication complexity of nonlocal quantum measurement.

[BibT_eX]

[DOI]

Yaoyun Shi

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

Distributed construction of quantum fingerprints.

[BibT_eX]

[DOI]

Andris Ambainis

Yaoyun Shi

Quantum Inf. Comput., 2004

Quantum lower bounds for the collision and the element distinctness problems.

[BibT_eX]

[DOI]

Scott Aaronson

Yaoyun Shi

J. ACM, 2004

2003

Both Toffoli and controlled-NOT need little help to do universal quantum computing.

[BibT_eX]

[DOI]

Yaoyun Shi

Quantum Inf. Comput., 2003

2002

Entropy lower bounds for quantum decision tree complexity.

[BibT_eX]

[DOI]

Yaoyun Shi

Inf. Process. Lett., 2002

Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.

[BibT_eX]

[DOI]

Peter Høyer

Jan Neerbek

Yaoyun Shi

Algorithmica, 2002

Quantum Lower Bounds for the Collision and the Element Distinctness Problems.

[BibT_eX]

[DOI]

Yaoyun Shi

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Evasiveness of Subgraph Containment and Related Properties.

[BibT_eX]

[DOI]

Amit Chakrabarti

Subhash Khot

Yaoyun Shi

SIAM J. Comput., 2001

Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables.

[BibT_eX]

[DOI]

Yaoyun Shi

Inf. Process. Lett., 2000

Yaoyun Shi

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...