Abstract
In recent years we witness the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4] and even in complexity theory [7]. Examples to such bounds include the semidefinite relaxation for the maximal cut problem [5], and the quantum value of multi-prover interactive games [3,4]. The first semidefinite programming bound, which gained fame, arose in the late seventies and was due to László Lovász [11], who used his theta number to compute the Shannon capacity of the five cycle graph. As in Lovász’s upper bound proof for the Shannon capacity and in other situations the key observation is often the fact that the new parameter in question is multiplicative with respect to the product of the problem instances. In a recent result R. Cleve, W. Slofstra, F. Unger and S. Upadhyay show that the quantum value of XOR games multiply under parallel composition [4]. This result together with [3] strengthens the parallel repetition theorem of Ran Raz [12] for XOR games. Our goal is to classify those semidefinite programming instances for which the optimum is multiplicative under a naturally defined product operation. The product operation we define generalizes the ones used in [11] and [4]. We find conditions under which the product rule always holds and give examples for cases when the product rule does not hold.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Rao, S., Vazirani, U.: Expander Flows, Geometric Embeddings and Graph Partitioning. In: Proceedings of Symposium on the Theory of Computing (2004)
Barnum, H., Saks, M.E., Szegedy, M.: Quantum query complexity and semi-definite programming. In: IEEE Conference on Computational Complexity, pp. 179–193 (2003)
Cleve, R., Hoyer, P., Toner, B., Watrous, J.: Consequences and Limits of Nonlocal Strategies. In: IEEE Conference on Computational Complexity, pp. 236–249 (2004)
Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Strong parallel repetition Theorem for Quantum XOR Proof Systems, quant-ph (August 2006)
Goemans, M.X., Williamson, D.P.: Approximation Algorithms for MAX-3-CUT and Other Problems Via Complex Semidefinite Programming. Journal of Computer and System Sciences (Special Issue for STOC 2001), 68, 442–470, 2004. Preliminary version in Proceedings of 33rd STOC, Crete, pp. 443–452 (2001)
Hoyer, P., Lee, T., Spalek, R.: Negative weights makes adversaries stronger, quant-ph/06, 4 (1105)
Laplante, S., Lee, T., Szegedy, M.: The Quantum Adversary Method and Classical Formula Size Lower Bounds. Computational Complexity 15(2), 163–196 (2006)
Karger, D.R., Motwani, R., Sudan, M.: Approximate Graph Coloring by Semidefinite Programming. J. ACM 45(2), 246–265 (1998)
Kitaev(unpublished proof). Quantum Coin Tossing. Slides at the archive of MSRI Berkeley
Knuth, D.E.: The Sandwich Theorem: Electron. J. Combin (1994)
Lovász, L.: On the Shannon capacity of a graph. IEEE Transactions on Information Theory (January 1979)
Raz, R.: A Parallel Repetition Theorem. SIAM Journal of Computing 27(3), 763–803 (1998)
Szegedy, M.: A note on the theta number of Lovász and the generalized Delsarte bound: FOCS (1994)
Tsirelson, B.S.: Quantum analogues of the Bell inequalities: The case of two spatially separated domains. Journal of Soviet Mathematics 36, 557–570 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mittal, R., Szegedy, M. (2007). Product Rules in Semidefinite Programming. In: Csuhaj-Varjú, E., Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 2007. Lecture Notes in Computer Science, vol 4639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74240-1_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-74240-1_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74239-5
Online ISBN: 978-3-540-74240-1
eBook Packages: Computer ScienceComputer Science (R0)