Fetching the paper…
Reading the bibliography…
Consider a bipartite system, of which one subsystem, A, undergoes a physical evolution separated from the other subsystem, R.
Linear transformations which preserve trace and positive semidefiniteness of operators
A. Jamiolkowski · 1972
Earlier work this paper cites.
Completely positive linear maps on complex matrices
M.-D. Choi · 1975
Earlier work this paper cites.
Concavity of certain maps on positive definite matrices and applications to hadamard products
T. Ando · 1979
Earlier work this paper cites.
Universal Classes of Hash Functions
J. L. Carter and M. N. Wegman · 1979
Earlier work this paper cites.
Black Holes, Demons and the Loss of Coherence
S. Lloyd · 1988
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1996
Earlier work this paper cites.
Stabilizer codes and quantum error correction
D. Gottesman · 1997
Earlier work this paper cites.
Quantum computations: algorithms and error correction
A. Kitaev · 1997
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Quantum data hiding
D. DiVincenzo, D. Leung, and B. Terhal · 2002
Earlier work this paper cites.
Completely bounded maps and operator algebras
V. I. Paulsen · 2002
Earlier work this paper cites.
Quantum Thermodynamics
J. Gemmer, M. Michel, and G. Mahler · 2004
Earlier work this paper cites.
Efficient simulation of random quantum states and operators
C. Dankert · 2005
Cited alongside, same era.
Standard forms of noisy quantum operations via depolarization
W. Dür, M. Hein, J. Cirac, and H.-J. Briegel · 2005
Cited alongside, same era.
Quantum state merging and negative information
M. Horodecki, J. Oppenheim, and A. Winter · 2005
Cited alongside, same era.
Security of quantum key distribution
R. Renner · 2005
Cited alongside, same era.
Universally Composable Privacy Amplification Against Quantum Adversaries
R. Renner and R. König · 2005
Cited alongside, same era.
The mother of all protocols: Restructuring quantum information’s family tree
P. Hayden, A. Abeyesinghe, I. Devetak, and A. Winter · 2006
Cited alongside, same era.
Random quantum circuits are approximate 2-designs
A. Harrow and R. Low · 2009
Later among the works it cites.
Pseudo-Randomness and Learning in Quantum Computation
R. Low · 2009
Later among the works it cites.
Duality between smooth min- and max-entropies
M. Tomamichel, R. Colbeck, and R. Renner · 2009
Later among the works it cites.
A fully quantum asymptotic equipartition property
M. Tomamichel, R. Colbeck, and R. Renner · 2009
Later among the works it cites.
Entropy and the Quantum: Trace Inequalities and Quantum Entropy
E. Carlen · 2010
Later among the works it cites.
F. Dupuis, M. Berta, J. Wullschleger, and R. Renner · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Entanglement and the foundations of statistical mechanics
S. Popescu, A. Short, and A. Winter · 2006
Cited alongside, same era.
Emergence of typical entanglement in two-party random processes
O. Dahlsten, R. Oliveira, and M. Plenio · 2007
Cited alongside, same era.
Black holes as mirrors: quantum information in random subsystems
P. Hayden and J. Preskill · 2007
Cited alongside, same era.
A decoupling approach to the quantum capacity
P. Hayden, M. Horodecki, J. Yard, and A. Winter · 2008
Cited alongside, same era.
Exact and approximate unitary 2-designs and their application to fidelity estimation
C. Dankert, R. Cleve, J. Emerson, and E. Livine · 2009
Cited alongside, same era.
The decoupling approach to quantum information theory
F. Dupuis · 2009
Cited alongside, same era.
The foundations of statistical physics from first principles of quantum mechanics: deriving equipartition from the decoupling approach
A. Hutter · 2010
Later among the works it cites.
The Smooth Entropy Formalism on von Neumann Algebras
M. Berta, F. Furrer, and V. Scholz · 2011
Closest in time.
The thermodynamic meaning of negative entropy
L. del Rio, J. Åberg, R. Renner, O. Dahlsten, and V. Vedral · 2011
Closest in time.
Comment on “Random Quantum Circuits are Approximate 2-designs” by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257–302 (2009))
I. Diniz and D. Jonathan · 2011
Closest in time.
Min- and max-entropy in infinite dimensions
F. Furrer, J. Aberg, and R. Renner · 2011
Closest in time.
Leftover hashing against quantum side information
M. Tomamichel, C. Schaffner, A. Smith, and R. Renner · 2011
Closest in time.