Dimension Independent Disentanglers from Unentanglement and Applications

Quantum entanglement is a key enabling ingredient in diverse applications. However, the presence of unwanted adversarial entanglement also poses challenges in many applications. In this paper, we explore methods to "break" quantum entanglement. Specifically, we construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show: For every d, k, there is an efficient channel: C^d C^d C^dk such that for every bipartite separable state ₁ ₂, the output (₁₂) is close to a k-partite separable state. Concretely, for some distribution on states from Cᵈ, \| (₁ ₂) - | |^ k d () \|₁ O ( (k^3) ^1/4). Moreover, (| |^ | |^) = | |^ k. Without the bipartite unentanglement assumption, the above bound is conjectured to be impossible. Leveraging our disentanglers, we show that unentangled quantum proofs of almost general real amplitudes capture NEXP, greatly relaxing the nonnegative amplitudes assumption in the recent work of QMA^+ (2) =NEXP. Specifically, our findings show that to capture NEXP, it suffices to have unentangled proofs of the form | = a | _+ + 1-a | _- where | _+ has non-negative amplitudes, | _- only has negative amplitudes and | a- (1-a) | 1/poly (n) with a 0, 1. Additionally, we present a protocol achieving an almost largest possible gap before obtaining QMAR (k) =NEXP, namely, a 1/poly (n) additive improvement to the gap results in this equality.