季铮锋

季铮锋

教授

清华大学

研究概况

  1. 量子复杂性理论:量子交互证明系统是量子算法复杂性理论的一个中心问题,与复杂性理论的其他分支和密码学有着重要联系。我们的研究给出了这个领域中两个重要复杂性类 QIP和 MIP*的完整刻划。部分相关结果产生了跨领域的影响力,解决了理论物理和纯数学中的重要开放性问题。

  2. 量子密码学:量子计算与密码学有着深刻的联系。在量子密码方面的工作中,我们把伪随机性概念引入量子态空间,给出了伪随机量子态的概念,并建立了它的最基本的性质和应用。相关结果不仅在量子密码领域产生影响,最近也被应用在量子引力和黑洞的相关研究中。我们首次给 NP 的量子对应 QMA 中的语言构造了量子零知识证明,最早研究了零知识证明中关于量子化知识的相关研究。此外,我们提出一种基于张量等价性的后量子密码假设,并基于此设计了后量子安全的数字签名协议。

  3. 量子信息:量子信息与量子纠缠理论是量子计算的基础语言。与合作者一起,我们解决了量子信息论和量子纠缠理论中的几个基本问题,包括把可编程性引入量子信道参数估计问题、解决量子态层析的采样复杂度问题和量子纠缠和编码的理论中的 LU-LC 等价性问题。

  4. 量子软件:量子软件是与量子硬件的研发具有同等重要性的关键技术。与合作者一起,我们提出并发展了量子通信并发系统演算(CCS)的互模拟理论、量子程序的最弱前置条件理论、量子电路的符号表示方法等。

研究方向
  • 量子计算

  • 计算理论

教育经历
  • 本科 · 清华大学计算机科学与技术系

  • 博士 · 清华大学计算机科学与技术系

最新发表

(2025). Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis. ACM Transactions on Quantum Computing.

引用 DOI URL

(2025). Quantum Network Optimization: From Optimal Routing to Fair Resource Allocation. Proc. ACM Meas. Anal. Comput. Syst..

引用 DOI URL

(2025). Quantum Approximate k-Minimum Finding. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

引用 DOI URL

(2023). Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games. Advances in Neural Information Processing Systems.

PDF 引用

(2022). Quantum Parameterized Complexity.

引用 arXiv URL

(2022). Quantum soundness of testing tensor codes. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).

引用 DOI

(2021). MIP* = RE. Commun. ACM.

引用 DOI URL

(2020). Quantum soundness of the classical low individual degree test.

引用 arXiv URL

(2020). Zero-Knowledge Proof Systems for QMA. SIAM Journal on Computing.

引用 DOI URL

(2019). Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA).

引用 DOI URL

(2019). Minimum entangling power is close to its maximum. Journal of Physics A: Mathematical and Theoretical.

引用 DOI URL

(2019). General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography. Theory of Cryptography.

引用

(2019). Quantum proof systems for iterated exponential time, and beyond. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing.

引用 DOI URL

(2018). Pseudorandom Quantum States. Advances in Cryptology – CRYPTO 2018.

引用

(2018). Separability-entanglement classifier via machine learning. Physical Review A.

引用

(2017). Compression of quantum multi-prover interactive proofs. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing.

引用 DOI URL

(2017). Joint product numerical range and geometry of reduced density matrices. Science China Physics, Mechanics & Astronomy.

引用

(2017). Quantum State Tomography via Reduced Density Matrices. Phys. Rev. Lett..

引用 DOI URL

(2016). Physical origins of ruled surfaces on the reduced density matrices geometry. Science China Physics, Mechanics & Astronomy.

引用 DOI URL

(2016). Entanglement depth for symmetric states. Phys. Rev. A.

引用 DOI URL

(2016). Quantum state and process tomography via adaptive measurements. Science China Physics, Mechanics & Astronomy.

引用 DOI URL

(2016). Tomography is Necessary for Universal Entanglement Detection with Single-Copy Observables. Phys. Rev. Lett..

引用 DOI URL

(2016). Pure-state tomography with the expectation value of Pauli operators. Phys. Rev. A.

引用 DOI URL

(2016). Classical verification of quantum proofs. Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing.

引用 DOI URL

(2016). Quantum capacities for entanglement networks. 2016 IEEE International Symposium on Information Theory (ISIT).

引用 DOI

(2016). Sample-optimal tomography of quantum states. Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing.

引用 DOI URL

(2016). Zero-Knowledge Proof Systems for QMA. 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

引用 DOI

(2015). Discontinuity of maximum entropy inference and quantum phase transitions. New Journal of Physics.

引用 DOI URL

(2014). Symmetric extension of two-qubit states. Phys. Rev. A.

引用 DOI URL

(2013). Symmetry of Codeword Stabilized Quantum Codes. In TQC.

引用

(2013). Uniqueness of quantum states compatible with given measurement results. Phys. Rev. A.

引用 DOI URL

(2012). Ground-state spaces of frustration-free Hamiltonians. Journal of Mathematical Physics.

引用 DOI URL

(2012). Comment on some results of Erdahl and the convex structure of reduced density matrices. Journal of Mathematical Physics.

引用 DOI URL

(2012). Rank reduction for the local consistency problem. Journal of Mathematical Physics.

引用 DOI URL

(2011). QIP = PSPACE. J. ACM.

引用 DOI URL

(2011). Quantum Codes Give Counterexamples to the Unique Preimage Conjecture of the $N$-Representability Problem. Phys. Rev. Lett..

引用 DOI URL

(2011). On the Solution Space of Quantum 2-SAT Problems. In QIP.

引用

(2010). Quantum-capacity-approaching codes for the detected-jump channel. Phys. Rev. A.

引用 DOI URL

(2010). Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States. Phys. Rev. Lett..

引用 DOI URL

(2010). Multi-error-correcting amplitude damping codes. 2010 IEEE International Symposium on Information Theory.

引用 DOI

(2008). Existence of universal entangler. Journal of Mathematical Physics.

引用 DOI URL

(2008). Parameter Estimation of Quantum Channels. IEEE Transactions on Information Theory.

引用 DOI

(2006). Some Issues in Quantum Information Theory. Journal of Computer Science and Technology.

引用 DOI URL