Random circuit sampling of bitstrings from a Haar-random quantum state is widely believed to be classically intractable, and has therefore been implemented as a primary benchmark for demonstrating quantum advantage. Here, we challenge this premise by proposing an efficient classical frozen-tree sampling algorithm that exploits the conditional scale invariance of Haar-random quantum states [Oh, arXiv:2602.19448]. The frozen-tree sampler draws bitstrings of $n$ qubits in $O(n)$ time per sample. Moreover, its output probability $p_F(x)$ is statistically identical to the probability $p_C(x)$ of a random quantum circuit, since both are independent instances of the same Dirichlet distribution. Consequently, no statistical test acting on samples alone can distinguish the classical frozen-tree sampler from a quantum random circuit. The claimed quantum advantage of random circuit sampling therefore does not withstand scrutiny: its hardness lies not in sampling from the Dirichlet distribution, which is classically efficient, but in identifying a specific circuit realization.
SQUARE: Structured Quantum Representation Adapters as Compact Quadratic Feature Maps for Frozen Language Models
Korea University(高丽大学);Sookmyung Women’s University(淑明女子大学);Ulsan National Institute of Science and Technology(蔚山国立科学技术研究院);Purdue University(普渡大学);Seoul National University Hospital(首尔国立大学医院)
Architectural Robustness to Label Noise Using Variational Quantum Circuits for Medical Image Classification
University of Moratuwa(莫拉图瓦大学);University of Toronto(多伦多大学);University of British Columbia(不列颠哥伦比亚大学);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)
Representation Learning via Quantum Neural Tangent Kernels
Pritzker School of Molecular Engineering, The University of Chicago(芝加哥大学普利兹克分子工程学院);Chicago Quantum Exchange(芝加哥量子交易所);Kadanoff Center for Theoretical Physics, The University of Chicago(芝加哥大学卡达诺夫理论物理中心);IBM Quantum, IBM Research – Zurich(IBM研究院(苏黎世)IBM量子部门);IBM Quantum, IBM T. J. Watson Research Center(IBM托马斯·J·沃森研究中心IBM量子部门)
Towards Fair Benchmarking of Quantum Transfer Learning for Visual Classification
New York University Abu Dhabi(阿布扎比纽约大学);NYUAD Research Institute(NYUAD研究院)
本文提出了一种统一的量子迁移学习基准评估方法,通过共享预处理规则、冻结主干设置和训练条件,比较了多种QTL方法在Fashion-MNIST和Hymenoptera Ants vs Bees等数据集上的性能,分析了电路规模、可训练参数、量子参数、训练时间及架构对量子比特数和电路深度的敏感性,揭示了不同数据集、编码策略和电路设计对性能的影响。
Q-MAP: Multi-Platform Benchmarking of Distributed Quantum Computing for Coherent Controlled Islanding
The Pennsylvania State University(宾夕法尼亚州立大学);Rensselaer Polytechnic Institute(伦斯勒理工学院);Kent State University(肯特州立大学);Clemson University(克莱姆森大学);University of Pretoria(比勒陀利亚大学)