175 citations · 1.6k across the 65 of their papers we have counts for
66 papers
Instantaneous Quantum Polynomial-Time Sampling and Verifiable Quantum Advantage: Stabilizer Scheme and Classical Security
Michael J. Bremner, Bin Cheng, Zhengfeng Ji
Sampling problems demonstrating beyond classical computing power with noisy intermediate scale quantum devices have been experimentally realized. In those realizations, however, ou…
Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games
Minbo Gao, Zhengfeng Ji, Tongyang Li +1
We propose the first online quantum algorithm for solving zero-sum games with regret under the game setting. Moreover, our quantum algorithm computes an $\varepsi…
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
Michael J. Bremner, Zhengfeng Ji, Xingjian Li +2
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computatio…
Classical and Quantum Iterative Optimization Algorithms Based on Matrix Legendre-Bregman Projections
Zhengfeng Ji
We consider Legendre-Bregman projections defined on the Hermitian matrix space and design iterative optimization algorithms based on them. A general duality theorem is established…
Quantum Parameterized Complexity
Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann +3
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish…
Quantum soundness of testing tensor codes
Zhengfeng Ji, Anand Natarajan, Thomas Vidick +2
A locally testable code is an error-correcting code that admits very efficient probabilistic tests of membership. Tensor codes provide a simple family of combinatorial construction…