Semidefinite programming relaxations for quantum correlations
Semidefinite programs are convex optimization problems involving a linear objective
function and a domain of positive-semidefinite matrices. Over the past two decades, they …
function and a domain of positive-semidefinite matrices. Over the past two decades, they …
The power of unentangled quantum proofs with non-negative amplitudes
FG Jeronimo, P Wu - Proceedings of the 55th Annual ACM Symposium …, 2023 - dl.acm.org
Quantum entanglement is a fundamental property of quantum mechanics and it serves as a
basic resource in quantum computation and information. Despite its importance, the power …
basic resource in quantum computation and information. Despite its importance, the power …
Non-asymptotic entanglement distillation
Entanglement distillation, an essential quantum information processing task, refers to the
conversion from multiple copies of noisy entangled states to a smaller number of highly …
conversion from multiple copies of noisy entangled states to a smaller number of highly …
Semidefinite programming strong converse bounds for classical capacity
We investigate the classical communication over quantum channels when assisted by no-
signaling and positive-partial-transpose-preserving (PPT) codes, for which both the optimal …
signaling and positive-partial-transpose-preserving (PPT) codes, for which both the optimal …
Quantifying high dimensional entanglement with two mutually unbiased bases
We derive a framework for quantifying entanglement in multipartite and high dimensional
systems using only correlations in two unbiased bases. We furthermore develop such …
systems using only correlations in two unbiased bases. We furthermore develop such …
Quantum interior point methods for semidefinite optimization
We present two quantum interior point methods for semidefinite optimization problems,
building on recent advances in quantum linear system algorithms. The first scheme, more …
building on recent advances in quantum linear system algorithms. The first scheme, more …
Complete hierarchy of linear systems for certifying quantum entanglement of subspaces
We introduce a hierarchy of linear systems for showing that a given subspace of pure
quantum states is entangled (ie, contains no product states). This hierarchy outperforms …
quantum states is entangled (ie, contains no product states). This hierarchy outperforms …
Dimension-free entanglement detection in multipartite Werner states
Werner states are multipartite quantum states that are invariant under the diagonal
conjugate action of the unitary group. This paper gives a complete characterization of their …
conjugate action of the unitary group. This paper gives a complete characterization of their …
Efficient bipartite entanglement detection scheme with a quantum adversarial solver
The recognition of entanglement states is a notoriously difficult problem when no prior
information is available. Here, we propose an efficient quantum adversarial bipartite …
information is available. Here, we propose an efficient quantum adversarial bipartite …