Chengkai Zhu

We relate our problem to the quantum signal processing (QSP) and developed an algorithm to simultaneously realize a poly regardless which signal unitary (from two choices) is chosen for the QSP, to do the optimal ternary Hamiltonian recognition.

Essentially, it is a composite unitary discrimination problem that can bridge quantum hypothesis testing and metrology! We developed an optimal protocol for identifying H for an unknown qubit quantum evolution exp(-iHt) with unknown t, from two or three orthogonal Hamiltonians.

Excited to share our new paper on Hamiltonian recognition! We explore the task of guessing which Hamiltonian is governing the unknown unitary evolution by multiple queries to the unitary. Joint work with Shuyu He, Yu-Ao Chen, Lei Zhang and @wangxinfelix arxiv.org/pdf/2412.13067

New work on the limits to the scalability of circuit knitting in distributed q. computing. The sampling overhead is exponentially bounded by the exact entanglement cost of the target bipartite channel, even asymptotically. With @MingruiJing @chengkai_z scirate.com/arxiv/2404.036…

This result reveals intrinsic similarities and distinctions between the quantum resource theory of magic states and entanglement in QSD. It highlights the operational advantage realized by the quantum resource of magic states. 5/5

Our research demonstrates that any pure magic state and its orthogonal complement of odd prime dimension cannot be unambiguously distinguished by non-magic POVMs, regardless of how many copies of the states are supplied. This is similar to entanglement theory. 4/5

Excited to introduce our latest paper, “Limitations of Classically-Simulable Measurements for Quantum State Discrimination” scirate.com/arxiv/2310.113… which explores the utility and role of magic in extracting classical information from quantum states. 1/5

@cenk_tuysuz @wangxinfelix @zhkphys @BaiduResearch @AndrewArrasmit2 Actually we mentioned the earlier work from the same authors (arXiv:2011.12245) as Ref.[30] in our preprint, which presents relevant results as you may concern.(3/3)

@wangxinfelix @zhkphys @chengkai_z @BaiduResearch Hi! I think your results are very similar to the work of @AndrewArrasmit2 et al. Are you aware of their work? I couldn't see a mention of it so wanted to ask if there are any different implications of the cost landscapes. arxiv.org/abs/2104.05868

Here goes our new work today! arxiv.org/abs/2205.05056 We show a new scaling theorem for generic variational quantum algorithms beyond vanishing gradients! Joint work with our interns @zhkphys @chengkai_z, and Geng @BaiduResearch

@cenk_tuysuz @wangxinfelix @zhkphys @BaiduResearch @AndrewArrasmit2 Whereas we consider the difference between the maximum and minimum within the whole subspace w.r.t. a local unitary. The process of taking extreme values in our work is not involved there. Their relation is further clarified in Eq.(11) in our work.(2/3)

@cenk_tuysuz @wangxinfelix @zhkphys @BaiduResearch @AndrewArrasmit2 Thanks for your notice! The work you mentioned considers the cost function difference between two points either both randomly chosen, or one random and the other has a deterministically chosen distance with it. (1/3)