NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (29)

quant-ph2009

Comment on "Matrix Pencils and Entanglement Classification"

Eric Chitambar, Carl A. Miller, Yaoyun Shi

quant-ph2015

Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions

Kai-Min Chung, Yaoyun Shi, Xiaodi Wu

quant-ph2001

Quantum lower bound for sorting

Yaoyun Shi

quant-ph2009

Matrix Pencils and Entanglement Classification

Eric Chitambar, Carl A. Miller, Yaoyun Shi

quant-ph2013

Optimal robust quantum self-testing by binary nonlocal XOR games

Carl A. Miller, Yaoyun Shi

quant-ph2011

Epsilon-net method for optimizations over separable states

Yaoyun Shi, Xiaodi Wu

quant-ph2003

Quantum and Classical Tradeoffs

Yaoyun Shi

quant-ph2008

Quantum communication complexity of block-composed functions

Yaoyun Shi, Yufan Zhu

quant-ph2006

The Communication Complexity of the Hamming Distance Problem

Wei Huang, Yaoyun Shi, Shengyu Zhang +1

quant-ph2007

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

Yaoyun Shi, Yufan Zhu

quant-ph2006

Classical simulation of quantum many-body systems with a tree tensor network

Yaoyun Shi, Luming Duan, Guifre Vidal

quant-ph2009

When is there a multipartite maximum entangled state?

Runyao Duan, Yaoyun Shi

cs.CC2012

Correlation/Communication complexity of generating bipartite states

Rahul Jain, Yaoyun Shi, Zhaohui Wei +1

quant-ph1999

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

Yaoyun Shi

quant-ph2007

Entanglement between Two Uses of a Noisy Multipartite Quantum Channel Enables Perfect Transmission of Classical Information

Runyao Duan, Yaoyun Shi

quant-ph2012

Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities

Yaoyun Shi

quant-ph2012

On optimal entanglement assisted one-shot classical communication

Brett Hemenway, Carl A. Miller, Yaoyun Shi +1

quant-ph2009

Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing

Eric Chitambar, Runyao Duan, Yaoyun Shi

quant-ph2009

Simulating quantum computation by contracting tensor networks

Igor L. Markov, Yaoyun Shi

quant-ph2010

Deciding Unitary Equivalence Between Matrix Polynomials and Sets of Bipartite Quantum States

Eric Chitambar, Carl A. Miller, Yaoyun Shi

quant-ph2002

Both Toffoli and Controlled-NOT need little help to do universal quantum computation

Yaoyun Shi

quant-ph2001

Quantum lower bounds for the collision and the element distinctness problems

Yaoyun Shi

quant-ph2003

Distributed construction of quantum fingerprints

Andris Ambainis, Yaoyun Shi

cs.DM2007

Constant-degree graph expansions that preserve the treewidth

Igor Markov, Yaoyun Shi

quant-ph2007

Characterizing locally distinguishable orthogonal product states

Yuan Feng, Yaoyun Shi

cs.CC2010

On the parity complexity measures of Boolean functions

Zhiqiang Zhang, Yaoyun Shi

quant-ph2000

Entropy lower bounds of quantum decision tree complexity

Yaoyun Shi

quant-ph2008

Communication Complexities of XOR functions

Yaoyun Shi, Zhiqiang Zhang

quant-ph2008

Tripartite entanglement transformations and tensor rank

Eric Chitambar, Runyao Duan, Yaoyun Shi