Core Viewpoint - The article discusses a significant breakthrough in quantum randomness achieved by two Chinese researchers, Fermi Ma and Huang Xinyuan, who proposed a new method for simulating pseudo-randomness without high computational costs [5][6]. Group 1: Importance of Quantum Randomness - Quantum randomness is crucial in computing and cryptography, enhancing algorithm efficiency and ensuring secure key distribution [2]. - The high cost of achieving true quantum randomness has led scientists to seek methods for simulating this randomness [3][4]. Group 2: Research Breakthrough - The researchers published a 76-page paper, with a core proof spanning 10 pages, demonstrating the existence of pseudo-random unitaries (PRUs) under the assumption of quantum-safe one-way functions [11][19]. - Their work builds on previous research that introduced PRUs but failed to prove their existence [17][18]. Group 3: Methodology and Findings - The researchers utilized a technique called "purification" and introduced a new method termed "path-recording simulation" to analyze unitary operators [22][23]. - They established that a previously considered "weak pseudo-random" construction can actually be viewed as "true pseudo-random" [23]. - The proof involved careful examination of quantum algorithms and the clever design of simulation processes based on recorded information [25][26]. Group 4: Authors and Their Background - Fermi Ma is a postdoctoral researcher at Simons-Berkley and holds a PhD from Princeton University, focusing on quantum computing and its implications for cryptography and complexity theory [31]. - Huang Xinyuan is a senior research scientist at Google Quantum AI and will join Caltech as an assistant professor, with research interests in the comparative advantages of quantum versus classical machine learning [33][34].