-
03-25
2021
Succinct Blind Quantum Computation Using a Random Oracle
标题：Succinct Blind Quantum Computation Using a Random Oracle 演讲人： Jiayu Zhang Boston University 时间： 2021-03-25 14:00-2021-03-25 15:30 地点：FIT1-202 ...
-
03-22
2021
How fast can we solve NP-complete problem?
内容： Under the hypothesis P != NP, NP-complete problems cannot be solved in polynomial time. Under ETH, the SAT problem (the first NP-complete problem) cannot be solved in sub-exponential time. Unde...
-
01-15
2021
Total variance and invariant information in complementary measurements
内容： We investigate the total variance of a quantum state with respect to a complete set of mutually complementary measurements and its relation to the Brukner–Zeilinger invariant information. By s...
-
12-09
2020
Exploring continuous Pareto fronts in multi-task learning
内容： It is not uncommon for a real-world machine learning application to solve multiple tasks these days. These tasks' objectives often correlate, conflict, or compete with each other, making it imp...
-
12-07
2020
Towards Cognitive Intelligence: Language Modeling and Beyond
内容： Cognition is essential for many complex real-world tasks; it subsumes critical capabilities regarding knowledge, memory, and reasoning. We present several approaches that address multiple chall...
-
11-23
2020
Quantum simulation with hybrid tensor networks
内容： Tensor network theory and quantum simulation are respectively the key classical and quantum computing methods in understanding quantum many-body physics. In this talk, we introduce a framework ...