Quantum Computing

Welcome to Quantum Computing at CS Stony Brook

 Research interests: Distributed Quantum Computing, Quantum Programming, Quantum Tomography

 Publications:

• August 2025. Accepted to QUANTUM journal - Adaptivity is not helpful for Pauli channel learning

Published in pre-print arxiv.org/abs/2403.09033.

We prove that adaptivity does not offer any additional advantage (compared to non-adaptive strategies) in learning and testing Pauli channel if entangled resources are available.

• August 2025. Accepted to OOPSLA25: Scalable Equivalence Checking and Verification of Shallow Quantum Circuits

arXiv:2504.01558 This paper address the problem of checking if two shallow (i.e., constant-depth) quantum circuits are equivalent using efficient their classical description.

• Accepted to IEEE Transactions on Information Theory - Optimal Tomography of Quantum Markov Chains via Continuity of Petz Recovery States

arXiv:2209.02240

• Published in STOC 2025 — Pauli Measurements Are Not Optimal for Single-Copy Tomography

arXiv:2502.18170, DOI We show that Pauli measurements, while popular in practice, are not optimal for single-copy quantum state tomography, and we characterize the gap between Pauli and optimal measurements.

• Accepted to IEEE Transactions on Information Theory (TIT) — Quantum Max-Flow Min-Cut Theorem

arXiv:2110.00905 This paper establishes a quantum analog of the classical max-flow min-cut theorem, with implications for quantum network theory and communication complexity.

• Published in Information and Computation — Quantum Temporal Logic and Reachability Problems of Matrix Semigroups

Science Direct We develop a temporal logic framework for reasoning about quantum systems and analyze the complexity of reachability problems in matrix semigroups.