#### Filter Results:

#### Publication Year

2004

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Monitoring threats to information security is increasingly becoming important to protecting secured organizational documents. There is increasing number of threats to information security, which originates from the internal users of the system. Insider is defined as a trusted person and has access to classified documents. Our focus here is on understanding… (More)

We give a quantum multiprover interactive proof system for the local Hamiltonian problem in which there is a constant number of provers, questions are classical of length polynomial in the number of qubits, and answers are of constant length. The main novelty of our protocol is that the gap between completeness and soundness is directly proportional to the… (More)

We present a stronger version of the Doherty-Parrilo-Spedalieri (DPS) hierarchy of approximations for the set of separable states. Unlike DPS, our hierarchy converges exactly at a finite number of rounds for any fixed input dimension. This yields an algorithm for sep-arability testing which is singly exponential in dimension and polylogarithmic in accuracy.… (More)

We introduce a method for using reductions to prove limitations on the ability of semidefinite programs (SDPs) to approximately solve optimization problems. We use this to show specifically that SDPs have limited ability to approximate two particularly important sets in quantum information theory: 1. The set of separable (i.e. unentangled) states. 2. The… (More)

Semidefinite programs (SDPs) are a framework for exact or approximate optimization with widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs, meaning instances where the SDP value is far from the true optimum. These are based on new limitations on the sum-of-squares (SoS)… (More)

Nash equilibria always exist, but are widely conjectured to require time to find that is exponential in the number of strategies, even for two-player games. By contrast, a simple quasi-polynomial time algorithm, due to Lipton, Markakis and Mehta (LMM), can find approximate Nash equilibria, in which no player can improve their utility by more than by… (More)

We introduce a method for using reductions to construct integrality gaps for semidefinite programs (SDPs). These imply new limitations on the sum-of-squares (SoS) hierarchy in two settings where previously no ω(1)-round integrality gaps were known: 1. The 2 → 4 norm of a matrix, or equivalently, the set of separable (i.e. unentangled) quantum states. 2. The… (More)

We introduce a simple two-player test which certifies that the players apply tensor products of Pauli σ X and σ Z observables on the tensor product of n EPR pairs. The test has constant robustness: any strategy achieving success probability within an additive ǫ of the optimal must be poly(ǫ)-close, in the appropriate distance measure, to the honest n-qubit… (More)

* QIP is the most prestigious and competitive conference in theoretical aspects of quantum information science. Annually out of ∼220 submissions, ∼9 are selected as featured talks, ∼25 as contributed talks and the ∼4 best results as plenary talks.

- Alex Fandrianto, Anand Natarajan, Hanzhi Zhu
- 2012