ZK Insights | 6th APR 2025
#57
Highlights
The High Cost of Quantum Randomness Is Dropping
Randomness is essential to some research, but it’s always been prohibitively complicated to achieve. Now, we can use “pseudorandomness” instead.
随机性对于某些研究至关重要，但实现起来却非常复杂。现在，我们可以用“伪随机性”来代替。
How a Problem About Pigeons Powers Complexity Theory
A twist on the pigeonhole principle inspires new insights in complexity theory and problem classification.
鸽巢原理的新变体推动复杂性理论与问题分类的突破性进展。
When Will This End?
Online teamwork probes the problem of when, and whether, a program will terminate.
在线团队合作探究程序何时终止以及是否终止的问题。
What Is the True Promise of Quantum Computing?
Ewin Tang’s work shows classical algorithms can rival quantum ones, challenging assumptions and revealing the nuanced promise of quantum computing.
Ewin Tang 展示经典算法可匹敌量子算法，颠覆预期，揭示量子计算的真正潜力仍充满不确定与希望。