default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZheng-Feng Ji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j14]Zhaozhen Wang
, Xingang Shi, Zhengfeng Ji, Xia Yin:
Quantum Network Optimization: From Optimal Routing to Fair Resource Allocation. Proc. ACM Meas. Anal. Comput. Syst. 9(2): 1-26 (2025)- [c20]Ziyuan Wang, Bin Cheng, Longxiang Yuan, Zhengfeng Ji:
FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams. CAV (4) 2025: 28-52 - [c19]Minbo Gao, Zhengfeng Ji, Qisheng Wang:
Quantum Approximate k-Minimum Finding. ESA 2025: 51:1-51:15 - [c18]Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu:
Quantum Speedup for Sampling Random Spanning Trees. ICALP 2025: 13:1-13:21 - [c17]Chenghua Liu, Minbo Gao, Zhengfeng Ji, Mingsheng Ying:
Quantum Speedup for Hypergraph Sparsification. ICML 2025 - [c16]Huiping Lin, Ruixuan Deng, Chris Z. Yao, Zhengfeng Ji, Mingsheng Ying:
Control Flow Adaption: An Efficient Simulation Method for Noisy Quantum Networks. INFOCOM 2025: 1-10 - [c15]Zhaozhen Wang, Xingang Shi, Zhengfeng Ji, Xia Yin:
Quantum Network Optimization: From Optimal Routing to Fair Resource Allocation. SIGMETRICS (Abstracts) 2025: 142-144 - [i31]Xin Hong, Aochu Dai, Dingchao Gao, Sanjiang Li, Zhengfeng Ji, Mingsheng Ying:
LimTDD: A Compact Decision Diagram Integrating Tensor and Local Invertible Map Representations. CoRR abs/2504.01168 (2025) - [i30]Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu:
Quantum Speedup for Sampling Random Spanning Trees. CoRR abs/2504.15603 (2025) - [i29]Chenghua Liu, Minbo Gao, Zhengfeng Ji, Mingsheng Ying:
Quantum Speedup for Hypergraph Sparsification. CoRR abs/2505.01763 (2025) - [i28]Ziyuan Wang, Bin Cheng, Longxiang Yuan, Zhengfeng Ji:
FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams. CoRR abs/2509.08276 (2025) - [i27]Chenghua Liu, Zhengfeng Ji:
Accelerating Regression Tasks with Quantum Algorithms. CoRR abs/2509.24757 (2025) - [i26]Bin Cheng, Ziyuan Wang, Ruixuan Deng, Jianxin Chen, Zhengfeng Ji:
Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams. CoRR abs/2510.06775 (2025) - 2024
- [i25]Minbo Gao, Zhengfeng Ji, Fuchao Wei:
Quantum Maximum Entropy Inference and Hamiltonian Learning. CoRR abs/2407.11473 (2024) - 2023
- [c14]Minbo Gao, Zhengfeng Ji, Tongyang Li, Qisheng Wang:
Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games. NeurIPS 2023 - [i24]Minbo Gao, Zhengfeng Ji, Tongyang Li, Qisheng Wang:
Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games. CoRR abs/2304.14197 (2023) - 2022
- [i23]Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann, Luke Mathieson, Mauro E. S. Morales, Alexis T. E. Shaw:
Quantum Parameterized Complexity. CoRR abs/2203.08002 (2022) - [i22]Michael J. Bremner, Zhengfeng Ji, Xingjian Li, Luke Mathieson, Mauro E. S. Morales:
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis. CoRR abs/2211.05325 (2022) - 2021
- [j13]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
MIP* = RE. Commun. ACM 64(11): 131-138 (2021) - [c13]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
Quantum soundness of testing tensor codes. FOCS 2021: 586-597 - [c12]Zhengfeng Ji, Zhihan Jin, Pinyan Lu:
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. SODA 2021: 959-975 - [i21]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
Quantum soundness of testing tensor codes. CoRR abs/2111.08131 (2021) - 2020
- [j12]Zhengfeng Ji, Debbie W. Leung, Thomas Vidick:
A three-player coherent state embezzlement game. Quantum 4: 349 (2020) - [j11]Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous:
Zero-Knowledge Proof Systems for QMA. SIAM J. Comput. 49(2): 245-283 (2020) - [i20]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
MIP*=RE. CoRR abs/2001.04383 (2020) - [i19]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
Quantum soundness of the classical low individual degree test. CoRR abs/2009.12982 (2020) - [i18]Mingsheng Ying, Zhengfeng Ji:
Symbolic Verification of Quantum Circuits. CoRR abs/2010.03032 (2020)
2010 – 2019
- 2019
- [j10]Zhengfeng Ji:
Classical Verification of Quantum Proofs. Theory Comput. 15: 1-42 (2019) - [c11]Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen:
Quantum proof systems for iterated exponential time, and beyond. STOC 2019: 473-480 - [c10]Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun:
General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography. TCC (1) 2019: 251-281 - [i17]Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun:
General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography. CoRR abs/1906.04330 (2019) - [i16]Zhengfeng Ji, Zhihan Jin, Pinyan Lu:
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. CoRR abs/1911.11962 (2019) - [i15]Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun:
General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2019: 687 (2019) - 2018
- [c9]Zhengfeng Ji, Yi-Kai Liu, Fang Song:
Pseudorandom Quantum States. CRYPTO (3) 2018: 126-152 - [i14]Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen:
Quantum proof systems for iterated exponential time, and beyond. CoRR abs/1805.12166 (2018) - [i13]Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen:
Quantum proof systems for iterated exponential time, and beyond. Electron. Colloquium Comput. Complex. TR18 (2018) - [i12]Zhengfeng Ji, Yi-Kai Liu, Fang Song:
Pseudorandom Quantum States. IACR Cryptol. ePrint Arch. 2018: 544 (2018) - 2017
- [j9]Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, Nengkun Yu:
Sample-Optimal Tomography of Quantum States. IEEE Trans. Inf. Theory 63(9): 5628-5641 (2017) - [c8]Zhengfeng Ji:
Compression of quantum multi-prover interactive proofs. STOC 2017: 289-302 - [i11]Zhengfeng Ji, Yi-Kai Liu, Fang Song:
Pseudorandom States, Non-Cloning Theorems and Quantum Money. CoRR abs/1711.00385 (2017) - 2016
- [c7]Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous:
Zero-Knowledge Proof Systems for QMA. FOCS 2016: 31-40 - [c6]Shawn X. Cui, Zheng-Feng Ji, Nengkun Yu, Bei Zeng:
Quantum capacities for entanglement networks. ISIT 2016: 1685-1689 - [c5]Zhengfeng Ji:
Classical verification of quantum proofs. STOC 2016: 885-898 - [c4]Jeongwan Haah, Aram W. Harrow, Zheng-Feng Ji, Xiaodi Wu, Nengkun Yu:
Sample-optimal tomography of quantum states. STOC 2016: 913-925 - [i10]Shawn X. Cui, Zhengfeng Ji, Nengkun Yu, Bei Zeng:
Quantum Capacities for Entanglement Networks. CoRR abs/1602.00401 (2016) - [i9]Anne Broadbent, Zheng-Feng Ji, Fang Song, John Watrous:
Zero-knowledge proof systems for QMA. CoRR abs/1604.02804 (2016) - [i8]Zhengfeng Ji:
Compression of Quantum Multi-Prover Interactive Proofs. CoRR abs/1610.03133 (2016) - 2015
- [i7]Zhengfeng Ji:
Classical Verification of Quantum Proofs. CoRR abs/1505.07432 (2015) - [i6]Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, Nengkun Yu:
Sample-optimal tomography of quantum states. CoRR abs/1508.01797 (2015) - 2013
- [c3]Salman Beigi, Jianxin Chen, Markus Grassl, Zhengfeng Ji, Qiang Wang, Bei Zeng:
Symmetries of Codeword Stabilized Quantum Codes. TQC 2013: 192-206 - [i5]Salman Beigi, Jianxin Chen, Markus Grassl, Zhengfeng Ji, Qiang Wang, Bei Zeng:
Symmetries of Codeword Stabilized Quantum Codes. CoRR abs/1303.7020 (2013) - [i4]Zhengfeng Ji:
Binary Constraint System Games and Locally Commutative Reductions. CoRR abs/1310.3794 (2013) - 2011
- [j8]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. J. ACM 58(6): 30:1-30:27 (2011) - 2010
- [j7]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. Commun. ACM 53(12): 102-109 (2010) - [j6]Zheng-Feng Ji, Jianxin Chen, Zhaohui Wei, Mingsheng Ying:
The LU-LC conjecture is false. Quantum Inf. Comput. 10(1&2): 97-108 (2010) - [c2]Runyao Duan, Markus Grassl, Zhengfeng Ji, Bei Zeng:
Multi-error-correcting amplitude damping codes. ISIT 2010: 2672-2676 - [c1]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. STOC 2010: 573-582 - [i3]Runyao Duan, Markus Grassl, Zheng-Feng Ji, Bei Zeng:
Multi-Error-Correcting Amplitude Damping Codes. CoRR abs/1001.2356 (2010)
2000 – 2009
- 2009
- [j5]Mingsheng Ying, Yuan Feng, Runyao Duan, Zheng-Feng Ji:
An algebra of quantum processes. ACM Trans. Comput. Log. 10(3): 19:1-19:36 (2009) - 2008
- [j4]Zheng-Feng Ji, Guoming Wang, Runyao Duan, Yuan Feng, Mingsheng Ying:
Parameter Estimation of Quantum Channels. IEEE Trans. Inf. Theory 54(11): 5172-5185 (2008) - 2007
- [j3]Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying:
Probabilistic bisimulations for quantum processes. Inf. Comput. 205(11): 1608-1639 (2007) - [j2]Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying:
Proof rules for the correctness of quantum programs. Theor. Comput. Sci. 386(1-2): 151-166 (2007) - 2006
- [j1]Runyao Duan, Zheng-Feng Ji, Yuan Feng, Mingsheng Ying:
Some Issues in Quantum Information Theory. J. Comput. Sci. Technol. 21(5): 776-789 (2006) - [i2]Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying:
Probabilistic bisimilarities between quantum processes. CoRR abs/cs/0601014 (2006) - 2005
- [i1]Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying:
Proof rules for purely quantum programs. CoRR abs/cs/0507043 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-12-09 00:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
