| Publication | Date of Publication | Type |
|---|
| Sample efficient identity testing and independence testing of quantum states | 2026-04-15 | Paper |
Checking continuous stochastic logic against quantum continuous-time Markov chains
Logical Methods in Computer Science | 2026-02-13 | Paper |
Optimal tomography of quantum Markov chains via continuity of Petz recovery states
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
The quantum repeater network saturates the entanglement distribution asymptotically
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
Quantum temporal logic and reachability problems of matrix semigroups
Information and Computation | 2024-10-08 | Paper |
Almost tight sample complexity analysis of quantum identity testing by Pauli measurements
IEEE Transactions on Information Theory | 2024-07-18 | Paper |
Optimal implementation of quantum gates with two controls
Linear Algebra and its Applications | 2024-05-17 | Paper |
| A probabilistic logic for verifying continuous-time Markov chains | 2024-02-01 | Paper |
Discrimination of quantum states under locality constraints in the many-copy setting
Communications in Mathematical Physics | 2023-10-25 | Paper |
scientific article; zbMATH DE number 7730615 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem
Journal of Mathematical Physics | 2023-03-17 | Paper |
Comments on and Corrections to “When Is the Chernoff Exponent for Quantum Operations Finite?”
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
LOCC protocols with bounded width per round optimize convex functions
Reviews in Mathematical Physics | 2021-10-14 | Paper |
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
When is the Chernoff Exponent for Quantum Operations Finite?
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Multipartite Entanglement Certification, With or Without Tomography
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Strassen's theorem for quantum couplings
Theoretical Computer Science | 2019-11-22 | Paper |
Capacity approaching coding for low noise interactive quantum communication
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Sample-optimal tomography of quantum states
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
Sample-optimal tomography of quantum states
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Exponential separation of quantum communication and classical information
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Bounds on the Distance Between a Unital Quantum Channel and the Convex Hull of Unitary Channels
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Limitations on Separable Measurements by Convex Optimization
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Maximum privacy without coherence, zero-error
Journal of Mathematical Physics | 2016-10-13 | Paper |
Model-checking linear-time properties of quantum systems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Generalized graph states based on Hadamard matrices
Journal of Mathematical Physics | 2015-08-10 | Paper |
Continuous-time orbit problems are decidable in polynomial-time
Information Processing Letters | 2014-10-07 | Paper |
Termination of nondeterministic quantum programs
Acta Informatica | 2014-06-12 | Paper |
Model checking quantum Markov chains
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Determinantal complexities and field extensions
Algorithms and Computation | 2014-01-14 | Paper |
Reachability analysis of recursive quantum Markov chains
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Reachability Probabilities of Quantum Markov Chains
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Reachability and termination analysis of concurrent quantum programs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Bounds on the distance between a unital quantum channel and the convex hull of unitary channels, with applications to the asymptotic quantum Birkhoff conjecture | 2012-01-05 | Paper |
