The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs.
Reading the bibliography…
The ”transition probability” in the state space of a ∗ \ast -algebra
A. Uhlmann · 1976
Earlier work this paper cites.
A note on the transition probability over C ∗ C^{\ast} -algebras
P. Alberti · 1983
Earlier work this paper cites.
The complexity of promise problems with applications to public-key cryptography
S. Even, A. Selman, and Y. Yacobi · 1984
Earlier work this paper cites.
Geometric Algorithms and Combinatorial Optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1993
Earlier work this paper cites.
Interior point methods in semidefinite programming with applications to combinatorial optimization
F. Alizadeh · 1995
Earlier work this paper cites.
Semidefinite programming
L. Vandenberghe and S. Boyd · 1996
Earlier work this paper cites.
Quantum computations: algorithms and error correction
A. Kitaev · 1997
Earlier work this paper cites.
Quantum circuits with mixed states
D. Aharonov, A. Kitaev, and N. Nisan · 1998
Earlier work this paper cites.
Quantum information and precision measurement
A. Childs, J. Preskill, and J. Renes · 2000
Earlier work this paper cites.
Parallelization, amplification, and exponential time simulation of quantum interactive proof system
A. Kitaev and J. Watrous · 2000
Earlier work this paper cites.
Statistical distinguishability between unitary operations
A. Acín · 2001
Earlier work this paper cites.
Using entanglement improves the precision of quantum measurements
G. D’Ariano, P. Presti, and M. Paris · 2001
Cited alongside, same era.
Aspects of Semidefinite Programming – Interior Point Algorithms and Selected Applications
E. de Klerk · 2002
Cited alongside, same era.
Classical and Quantum Computation
A. Kitaev, A. Shen, and M. Vyalyi · 2002
Cited alongside, same era.
Completely Bounded Maps and Operator Algebras
V. Paulsen · 2002
Cited alongside, same era.
Semidefinite programs and combinatorial optimization
L. Lovasz · 2003
Cited alongside, same era.
Approximation by Algebraic Numbers
Y. Bugeaud · 2004
Cited alongside, same era.
Distance measures to compare real and ideal quantum processes
A. Gilchrist, N. Langford, and M. Nielsen · 2005
Cited alongside, same era.
On the hardness of distinguishing mixed-state quantum computations
B. Rosgen and J. Watrous · 2005
Cited alongside, same era.
Entanglement can enhance the distinguishability of entanglement-breaking channels
M. Sacchi · 2005
Cited alongside, same era.
Optimal discrimination of quantum operations
M. Sacchi · 2005
Cited alongside, same era.
Notes on super-operator norms induced by Schatten norms
J. Watrous · 2005
Cited alongside, same era.
Multiplicativity of completely bounded p-norms implies a new additivity result
I. Devetak, M. Junge, C. King, and M. B. Ruskai · 2006
Later among the works it cites.
A relation between completely bounded norms and conjugate channels
A. Jenčová · 2006
Later among the works it cites.
Alternating-projection algorithms for operator-theoretic calculation
V. Zarikian · 2006
Later among the works it cites.
Toward a general theory of quantum games
G. Gutoski and J. Watrous · 2007
Later among the works it cites.
Unbounded violation of tripartite Bell inequalities
D. Pérez-García, M. Wolf, C. Palazuelos, I. Villanueva, and M. Junge · 2008
Later among the works it cites.
Distinguishing short quantum computations
B. Rosgen · 2008
Later among the works it cites.
Distinguishing quantum operations with few Kraus operators
J. Watrous · 2008
Later among the works it cites.
On the complexity of approximating the diamond norm
A. Ben-Aroya and A. Ta-Shma · 2009
Closest in time.
Computing stabilized norms for quantum operations
N. Johnston, D. Kribs, and V. Paulsen · 2009
Closest in time.
All entangled states are useful for channel discrimination
M. Piani and J. Watrous · 2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…