Semidefinite programming

Entanglement cost of bipartite quantum channel discrimination under positive partial transpose operations
Quantum channel discrimination is a fundamental task in quantum information processing. In the one-shot regime, discrimination between …
PDF Cite DOI
Entanglement cost of bipartite quantum channel discrimination under positive partial transpose operations
Computable and Faithful Lower Bound for Entanglement Cost
Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum …
PDF Cite DOI
Computable and Faithful Lower Bound for Entanglement Cost
Information recoverability of noisy quantum states
Extracting classical information from quantum systems is an essential step of many quantum algorithms. However, this information could …
PDF Cite DOI
Information recoverability of noisy quantum states
Exact entanglement cost of quantum states and channels under positive-partial-transpose-preserving operations
This paper establishes single-letter formulas for the exact entanglement cost of simulating quantum channels under free quantum …
PDF Cite DOI
Exact entanglement cost of quantum states and channels under positive-partial-transpose-preserving operations
Copyright © 2018, arXiv, All rights reserved. This paper establishes single-letter formulas for the exact entanglement cost of …
PDF Cite DOI
Cost of Quantum Entanglement Simplified
Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such …
PDF Cite DOI
Efficiently Computable Bounds for Magic State Distillation
Magic state manipulation is a crucial component in the leading approaches to realizing scalable, fault-tolerant, and universal quantum …
PDF Cite DOI
Semidefinite Programming Converse Bounds for Quantum Communication
We study the one-shot and asymptotic quantum communication assisted with the positive-partial-transpose-preserving (PPT) and …
PDF Cite DOI
Semidefinite programming strong converse bounds for classical capacity
We show a meaningful theory of classical communication over quantum channels when assisted by no-signalling (NS) and PPT-preserving …
PDF Cite DOI
Semidefinite programming converse bounds for classical communication over quantum channels
PDF Cite DOI