A theory of computation based on quantum logic (I)
- 作者Mingsheng Ying
- 卷第344卷
- 印刷ISSN0304-3975
- 文件大小497.71KB
- 发表时间2005
- DOI10.1016/j.tcs.2005.04.001
- 页码134-207
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space TradeoffsKlauck, Hartmut; Špalek, Robert; de Wolf, Ronald · SIAM Journal on Computing · 2007
[IEEE 45th Annual IEEE Symposium on Foundations of Computer Science - Rome, Italy (17-19 Oct. 2004)] 45th Annual IEEE Symposium on Foundations of Computer Science - Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space TradeoffsKlauck, H.; Spalek, R.; de Wolf, R. · 2004
Characterizing Locally Indistinguishable Orthogonal Product StatesYuan Feng; Yaoyun Shi · 2009
Matrix pencils and entanglement classificationChitambar, Eric; Miller, Carl A.; Shi, Yaoyun · Journal of Mathematical Physics · 2010
Path auctions with multiple edge ownershipYe Du; Rahul Sami; Yaoyun Shi · 2010
Tripartite Entanglement Transformations and Tensor RankChitambar, Eric; Duan, Runyao; Shi, Yaoyun · Physical Review Letters · 2008
Keyring models: An approach to steerabilityMiller, Carl A.; Colbeck, Roger; Shi, Yaoyun · Journal of Mathematical Physics · 2018
Simulating Quantum Computation by Contracting Tensor NetworksMarkov, Igor L.; Shi, Yaoyun · SIAM Journal on Computing · 2008
Entropy lower bounds for quantum decision tree complexityYaoyun Shi · 2002