Some upper and lower bounds on PSD-rank-Reference-Cited by-同舟云学术

Some upper and lower bounds on PSD-rank

Published:2016-07-16 Issue:1-2 Volume:162 Page:495-521
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Lee Troy,Wei Zhaohui^ORCID,de Wolf Ronald

Funder

Singapore National Research Foundation

ERC Consolidator Grant QPROGRESS

EU STREP project QALGO

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10107-016-1052-0.pdf

Reference17 articles.

1. Gouveia, J., Parrilo, P., Thomas, R.: Lifts of convex sets and cone factorizations. Math. Oper. Res. 38(2), 248–264 (2013). arXiv:1111.3164

2. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R. and de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM, 16(2), 2015. Earlier version in STOC’12. arXiv:1111.0837

3. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441–466 (1991)

4. Rothvoß, T.: The matching polytope has exponential extension complexity. In: Proceedings of 46th ACM STOC, pp. 263–272 (2014)

5. Lee, J., Steurer, D. and Raghavendra, P.: Lower bounds on the size of semidefinite programming relaxations. In: Proceedings of 47th ACM STOC, pp. 567–576 (2015). arXiv:1411.6317

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Can a qudit carry more information than a dit?;Contemporary Physics;2024-09-04

2. The Generations of Classical Correlations via Quantum Schemes;IEEE Transactions on Information Theory;2024-06

3. Simple information-processing tasks with unbounded quantum advantage;Physical Review A;2024-03-29

4. Further $$\exists {\mathbb {R}}$$-Complete Problems with PSD Matrix Factorizations;Foundations of Computational Mathematics;2023-06-22

5. Complex psd-minimal polytopes in dimensions two and three;Journal of Algebra and Its Applications;2022-11-10