Fetching the paper…
Reading the bibliography…
A channel is degradable if there exists a second channel that maps the output state of the channel to the environment state.
Additivity and distinguishability of random unitary channels
B. Rosgen · 1936
Earlier work this paper cites.
Quantum circuits with mixed states
D. Aharonov, A. Kitaev, and N. Nisan · 1998
Earlier work this paper cites.
Classical and Quantum Computation , volume 47 of Graduate Studies in Mathematics
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Earlier work this paper cites.
Optimal encryption of quantum bits
P. O. Boykin and V. Roychowdhury · 2003
Earlier work this paper cites.
The capacity of a quantum channel for simultaneous transmission of classical and quantum information
I. Devetak and P. W. Shor · 2005
Earlier work this paper cites.
Information-capacity description of spin-chain correlations
V. Giovannetti and R. Fazio · 2005
Earlier work this paper cites.
"Non-identity-check" is QMA-complete
D. Janzing, P. Wocjan, and T. Beth · 2005
Earlier work this paper cites.
On the hardness of distinguishing mixed-state quantum computations
B. Rosgen and J. Watrous · 2005
Cited alongside, same era.
Simplifying additivity problems using direct sum constructions
M. Fukuda and M. M. Wolf · 2007
Cited alongside, same era.
Complementary channels and the additivity problem
A. S. Holevo · 2007
Cited alongside, same era.
Properties of conjugate channels with applications to additivity and multiplicativity
C. King, K. Matsumoto, M. Nathanson, and M. B. Ruskai · 2007
Cited alongside, same era.
Quantum capacities of channels with small environment
M. M. Wolf and D. Pérez-García · 2007
Cited alongside, same era.
Distinguishing short quantum computations
B. Rosgen · 2008
Later among the works it cites.
Superadditivity of communication capacity using entangled inputs
M. B. Hastings · 2009
Closest in time.
R. Jain, Z. Ji, S. Upadhyay, and J. Watrous · 2009
Closest in time.
Non-identity check remains QMA-complete for short circuits, 2009
Z. Ji and X. Wu · 2009
Closest in time.
Semidefinite programs for completely bounded norms, 2009
J. Watrous · 2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. S. Cubitt, M. B. Ruskai, and G. Smith · 2008
Cited alongside, same era.
On the complexity of approximating the diamond norm
A. Ben-Aroya and A. Ta-Shma · 2010
Closest in time.