Fetching the paper…
Reading the bibliography…
Suppose that a polynomial-time mixed-state quantum circuit, described as a sequence of local unitary interactions followed by a partial trace, generates a quantum state shared between two parties.
Positive functions on C*-algebras
W. F. Stinespring · 1955
Earlier work this paper cites.
On the Einstein-Podolsky-Rosen paradox
John Stewart Bell · 1964
Earlier work this paper cites.
Quantum detection and estimation theory
Carl W. Helstrom · 1969
Earlier work this paper cites.
An analog of the theory of statistical decisions in noncommutative theory of probability
Alexander S. Holevo · 1972
Earlier work this paper cites.
Quantum Detection and Estimation Theory
Carl W. Helstrom · 1976
Earlier work this paper cites.
The “transition probability” in the state space of a *-algebra
Armin Uhlmann · 1976
Earlier work this paper cites.
Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
Reinhard F. Werner · 1989
Earlier work this paper cites.
Quantum cryptography based on Bell’s theorem
Artur K. Ekert · 1991
Earlier work this paper cites.
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Charles H. Bennett and Stephen J. Wiesner · 1992
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters · 1993
Earlier work this paper cites.
Quantum measurements and the abelian stabilizer problem
Alexei Kitaev · 1995
Earlier work this paper cites.
Approximation by quantum circuits
Emmanuel Knill · 1995
Earlier work this paper cites.
Stabilization of quantum computations by symmetrization
Adriano Barenco, Andre Berthiaume, David Deutsch, Artur Ekert, Richard Jozsa, and Chiara Macchiavello · 1997
Earlier work this paper cites.
Separability criterion and inseparable mixed states with positive partial transposition
Pawel Horodecki · 1997
Earlier work this paper cites.
A complete promise problem for statistical zero-knowledge
Amit Sahai and Salil Vadhan · 1997
Earlier work this paper cites.
Quantum circuits with mixed states
Dorit Aharonov, Alexei Kitaev, and Noam Nisan · 1998
Earlier work this paper cites.
Quantum algorithms: Entanglement enhanced information processing
Artur Ekert and Richard Jozsa · 1998
Earlier work this paper cites.
Entanglement-assisted classical capacity of noisy quantum channels
Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal · 1999
Earlier work this paper cites.
Cryptographic distinguishability measures for quantum-mechanical states
Christopher A. Fuchs and Jeroen van de Graaf · 1999
Earlier work this paper cites.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Alexei Kitaev and John Watrous · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Cited alongside, same era.
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal · 2002
Cited alongside, same era.
Distinguishing separable and entangled states
Andrew C. Doherty, Pablo A. Parrilo, and Federico M. Spedalieri · 2002
Cited alongside, same era.
Limits on the power of quantum statistical zero-knowledge
John Watrous · 2002
Cited alongside, same era.
Classical deterministic complexity of Edmonds’ problem and quantum entanglement
Leonid Gurvits · 2003
Cited alongside, same era.
PSPACE has constant-round quantum interactive proof systems
John Watrous · 2003
Cited alongside, same era.
William Matthews, Stephanie Wehner, and Andreas Winter · 2009
Later among the works it cites.
Computational Distinguishability of Quantum Channels
Bill Rosgen · 2009
Later among the works it cites.
Quantum computational complexity
John Watrous · 2009
Later among the works it cites.
Zero-knowledge against quantum attacks
John Watrous · 2009
Later among the works it cites.
Salman Beigi · 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…
Consequences and limits of nonlocal strategies
Richard Cleve, Peter Hoyer, Ben Toner, and John Watrous · 2004
Cited alongside, same era.
“Squashed entanglement”: An additive entanglement measure
Matthias Christandl and Andreas Winter · 2004
Cited alongside, same era.
Complete family of separability criteria
Andrew C. Doherty, Pablo A. Parrilo, and Federico M. Spedalieri · 2004
Cited alongside, same era.
Lecture 17: LOCC distinguishability of sets of states
John Watrous · 2004
Cited alongside, same era.
The private classical capacity and quantum capacity of a quantum channel
Igor Devetak · 2005
Cited alongside, same era.
Detecting multipartite entanglement
Andrew C. Doherty, Pablo A. Parrilo, and Federico M. Spedalieri · 2005
Cited alongside, same era.
Toby S. Cubitt, Debbie Leung, William Matthews, and Andreas Winter · 2010
Later among the works it cites.
Strong NP-hardness of the quantum separability problem
Sevag Gharibian · 2010
Later among the works it cites.
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous · 2010
Later among the works it cites.
Faithful squashed entanglement
Fernando G. S. L. Brandão, Matthias Christandl, and Jon Yard · 2011
Later among the works it cites.
A quasipolynomial-time algorithm for the quantum separability problem
Fernando G. S. L. Brandão, Matthias Christandl, and Jon Yard · 2011
Later among the works it cites.
Entanglement-enhanced classical communication over a noisy classical channel
R. Prevedel, Y. Lu, W. Matthews, R. Kaltenbaek, and K. J. Resch · 2011
Later among the works it cites.
Detection of multiparticle entanglement: Quantifying the search for symmetric extensions
Fernando G. S. L. Brandão and Matthias Christandl · 2012
Closest in time.
Fully device independent quantum key distribution
Umesh Vazirani and Thomas Vidick · 2012
Closest in time.
Quantum de Finetti theorems under local measurements with applications
Fernando G. S. L. Brandão and Aram W. Harrow · 2013
Closest in time.
Testing product states, quantum Merlin-Arthur games and tensor optimization
Aram W. Harrow and Ashley Montanaro · 2013
Closest in time.
Two-message quantum interactive proofs and the quantum separability problem
Patrick Hayden, Kevin Milner, and Mark M. Wilde · 2013
Closest in time.
Two-message quantum interactive proofs and the quantum separability problem
Patrick Hayden, Kevin Milner, and Mark M. Wilde · 2013
Closest in time.
Quantum interactive proofs and the complexity of entanglement detection
Kevin Milner, Gus Gutoski, Patrick Hayden, and Mark M. Wilde · 2013
Closest in time.
The efficiency of quantum identity testing of multiple states
Masaru Kada, Harumichi Nishimura, and Tomoyuki Yamakami · 2037
Closest in time.