| Publication | Date of Publication | Type |
|---|
| Decidability of fully quantum nonlocal games with noisy maximally entangled states | 2024-11-14 | Paper |
| On the Gaussian surface area of spectrahedra | 2024-09-20 | Paper |
The generations of classical correlations via quantum schemes
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Communication complexity of common randomness generation with isotropic states
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
| Polynomial-time approximation of zero-free partition functions | 2024-06-24 | Paper |
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Positive spectrahedra: invariance principles and pseudorandom generators
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Nonlocal Games with Noisy Maximally Entangled States are Decidable
SIAM Journal on Computing | 2022-08-17 | Paper |
Quantum and Classical Hybrid Generations for Classical Correlations
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| On the Gaussian surface area of spectrahedra | 2021-12-02 | Paper |
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
On the Compression of Messages in the Multi-Party Setting
IEEE Transactions on Information Theory | 2020-09-29 | 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 |
Expected Communication Cost of Distributed Quantum Tasks
IEEE Transactions on Information Theory | 2018-12-19 | 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 |
Multipartite quantum correlation and communication complexities
Computational Complexity | 2017-07-28 | Paper |
| Lower bound on expected communication cost of quantum Huffman coding | 2017-07-19 | Paper |
New One Shot Quantum Protocols With Application to Communication Complexity
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A direct product theorem for two-party bounded-round public-coin communication complexity
Algorithmica | 2016-11-29 | Paper |
Parity decision tree complexity and 4-party communication complexity of XOR-functions are polynomially equivalent
Chicago Journal of Theoretical Computer Science | 2016-10-07 | Paper |
A Parallel Approximation Algorithm for Positive Semidefinite Programming
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Adversary lower bounds for nonadaptive quantum algorithms
Journal of Computer and System Sciences | 2010-07-08 | Paper |
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
Logic, Language, Information and Computation | 2008-07-10 | Paper |
