quantum Shannon theory, quantum information theory, quantum error correction, quantum communication, quantum algorithms, quantum computational complexity theory, quantum machine learning
arxiv.org/abs/2509.08965
This paper identifies the communication capacity for sending information from the future to the past through a noisy closed timelike curve. The formula is reminiscent of mutual info but in general can be larger.
arxiv.org/abs/2509.08965
This paper identifies the communication capacity for sending information from the future to the past through a noisy closed timelike curve. The formula is reminiscent of mutual info but in general can be larger.
arxiv.org/abs/2508.09103
All students in attached image are in 1st year undergrad or high school. Due to frozen funds, some volunteered & others were funded by Cornell Engineering. Thanks for your dedication & thx to other coauthors for helping to complete the work
arxiv.org/abs/2508.09103
All students in attached image are in 1st year undergrad or high school. Due to frozen funds, some volunteered & others were funded by Cornell Engineering. Thanks for your dedication & thx to other coauthors for helping to complete the work
arxiv.org/abs/2412.02134
New title: Sample-based Hamiltonian and Lindbladian simulation: Non-asymptotic analysis of sample complexity
Updated results summarized in attached table
arxiv.org/abs/2412.02134
New title: Sample-based Hamiltonian and Lindbladian simulation: Non-asymptotic analysis of sample complexity
Updated results summarized in attached table
arxiv.org/abs/2503.22823
Main changes consist of an expanded section 8.5 on mixing, indistinguishability, & decoupling times of quantum Markov chains. See attached images
arxiv.org/abs/2503.22823
Main changes consist of an expanded section 8.5 on mixing, indistinguishability, & decoupling times of quantum Markov chains. See attached images
arxiv.org/abs/2504.12989
Building on arxiv.org/abs/2506.13686, we gave a tight characterization of sample complexity of state discrimination & query complexity of cq channels. See images
arxiv.org/abs/2504.12989
Building on arxiv.org/abs/2506.13686, we gave a tight characterization of sample complexity of state discrimination & query complexity of cq channels. See images
arxiv.org/search/quant...
arxiv.org/search/quant...
arxiv.org/search/quant...
arxiv.org/search/quant...
arxiv.org/search/quant...
arxiv.org/search/quant...
arxiv.org/abs/2503.22823
Great collaboration & enjoyable project!
Interpretations of q. Doeblin coefficients in attached tables
arxiv.org/abs/2503.22823
Great collaboration & enjoyable project!
Interpretations of q. Doeblin coefficients in attached tables
arxiv.org/abs/2409.06659
arxiv.org/abs/2409.06659
arxiv.org/abs/2411.04035
arxiv.org/abs/2502.15659
arxiv.org/abs/2411.04035
arxiv.org/abs/2502.15659