Random measure and quantum supremacy demonstration
統計科学セミナー
開催期間
2026.1.23(金)
14:50 ~ 15:50
14:50 ~ 15:50
場所
C-512 中講義室
講演者
間野 修平(統計数理研究所 統計基盤数理研究系)
概要
Quantum supremacy refers to a quantum computer outperforming a
classical computer on a specific task. Researchers use a useless
benchmark: outputs of a random quantum circuit. Such a quantum circuit
is easy to implement, but simulating the outputs is believed to be
intractable for a classical computer. After describing the background
of the quantum supremacy demonstration by Google (2019), I will
explain that an output of the quantum circuit is an exchangeable
sequence with the de Finetti measure consisting of a mixture, and that
the restaurants/urns metaphor of the proposed model simulates the
output on a classic computer in a reasonable time.