UB Paderborn / Katalog / Suche / in CDI

Necessary and sufficient quantum information characterization of Einstein-Podolsky-Rosen steering

Physical review letters, 2015-02, Vol.114 (6), p.060404-060404, Article 060404

2015

Volltextzugriff (PDF)

All entangled states are useful for channel discrimination

Physical review letters, 2009-06, Vol.102 (25), p.250501-250501, Article 250501

2009

Volltextzugriff (PDF)

Limitations on Separable Measurements by Convex Optimization

IEEE transactions on information theory, 2015-06, Vol.61 (6), p.3593-3604

2015

Volltextzugriff (PDF)

Closed timelike curves make quantum and classical computing equivalent

Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences, 2009-02, Vol.465 (2102), p.631-647

2009

Volltextzugriff (PDF)

QIP = PSPACE

Journal of the ACM, 2011-12, Vol.58 (6), p.1-27

2011

Volltextzugriff (PDF)

Zero-Knowledge against Quantum Attacks

SIAM journal on computing, 2009-01, Vol.39 (1), p.25-58

Watrous, John

2009

Volltextzugriff (PDF)

Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity

Journal of computer and system sciences, 2001-03, Vol.62 (2), p.376-391

Watrous, John

2001

Volltextzugriff (PDF)

Matchgate and space-bounded quantum computations are equivalent

Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences, 2010-03, Vol.466 (2115), p.809-830

2010

Volltextzugriff (PDF)

Revisiting the simulation of quantum Turing machines by quantum circuits

Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences, 2019-06, Vol.475 (2226), p.20180767-20180767

2019

Volltextzugriff (PDF)

Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money

Theory of Quantum Computation, Communication, and Cryptography, p.45-64

Volltextzugriff (PDF)

Complexity Limitations on One-turn Quantum Refereed Games

Theory of computing systems, 2023-04, Vol.67 (2), p.383-412

2023

Volltextzugriff (PDF)

Bipartite subspaces having no bases distinguishable by local operations and classical communication

Physical review letters, 2005-08, Vol.95 (8), p.080505-080505, Article 080505

WATROUS, John

2005

Volltextzugriff (PDF)

Revisiting the simulation of quantum Turing machines by quantum circuits

Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences, 2019-06, Vol.475 (2226), p.1-22

2019

Volltextzugriff (PDF)

Operational meaning of quantum measures of recovery

Physical review. A, 2016-08, Vol.94 (2), Article 022310

2016

Volltextzugriff (PDF)

Ancilla Dimension in Quantum Channel Discrimination

Annales Henri Poincaré, 2017-04, Vol.18 (4), p.1153-1184

2017

Volltextzugriff (PDF)

Toward a general theory of quantum games

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, p.565-574

2007

Volltextzugriff (PDF)

Zero-Knowledge Proof Systems for QMA

SIAM journal on computing, 2020-01, Vol.49 (2), p.245-283

2020

Volltextzugriff (PDF)

Design and simulation of an S-band cloverleaf amplifier using ICEPIC

2015 IEEE International Conference on Plasma Sciences (ICOPS), 2015, p.1-1

2015

Volltextzugriff (PDF)

Hedging bets with correlated quantum strategies

Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences, 2012-09, Vol.468 (2145), p.2614-2629

2012

Volltextzugriff (PDF)

On the complexity of simulating space-bounded quantum computations

Computational complexity, 2003-06, Vol.12 (1-2), p.48-84

Watrous, John

2003

Volltextzugriff (PDF)

Extended non-local games and monogamy-of-entanglement games

Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences, 2016-05, Vol.472 (2189), p.20160003-20160003

2016

Volltextzugriff (PDF)

On the Mixed-Unitary Rank of Quantum Channels

Communications in mathematical physics, 2022-09, Vol.394 (2), p.919-951

2022

Volltextzugriff (PDF)

Quantum fingerprinting

Physical review letters, 2001-10, Vol.87 (16), p.167902-167902, Article 167902

2001

Volltextzugriff (PDF)

Many copies may be required for entanglement distillation

Physical review letters, 2004-07, Vol.93 (1), p.010502.1-010502.4, Article 010502

WATROUS, John

2004

Volltextzugriff (PDF)

Quantum Arthur–Merlin games

Computational complexity, 2005-06, Vol.14 (2), p.122-152

2005

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Necessary and sufficient quantum information characterization of Einstein-Podolsky-Rosen steering

All entangled states are useful for channel discrimination

Limitations on Separable Measurements by Convex Optimization

Closed timelike curves make quantum and classical computing equivalent

QIP = PSPACE

Zero-Knowledge against Quantum Attacks

Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity

Matchgate and space-bounded quantum computations are equivalent

Revisiting the simulation of quantum Turing machines by quantum circuits

Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money

Complexity Limitations on One-turn Quantum Refereed Games

Bipartite subspaces having no bases distinguishable by local operations and classical communication

Revisiting the simulation of quantum Turing machines by quantum circuits

Operational meaning of quantum measures of recovery

Ancilla Dimension in Quantum Channel Discrimination

Toward a general theory of quantum games

Zero-Knowledge Proof Systems for QMA

Design and simulation of an S-band cloverleaf amplifier using ICEPIC

Hedging bets with correlated quantum strategies

On the complexity of simulating space-bounded quantum computations

Extended non-local games and monogamy-of-entanglement games

On the Mixed-Unitary Rank of Quantum Channels

Quantum fingerprinting

Many copies may be required for entanglement distillation

Quantum Arthur–Merlin games

Suchergebnisse filtern