Searching for quantum-classical crossover in condensed matter problems

• Item type: SIG Technical Reports(1)
• 公開日: 2022-10-20
• タイトル: Searching for quantum-classical crossover in condensed matter problems
• タイトル / 言語: en
• タイトル: Searching for quantum-classical crossover in condensed matter problems
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Department of Applied Physics, University of Tokyo／Theoretical Quantum Physics Laboratory, RIKEN Cluster for Pioneering Research (CPR)／JST, PRESTO
• 著者所属: Institude for Physics of Intelligence, University of Tokyo
• 著者所属: NTT Computer and Data Science Laboratories, NTT Corporation／JST, PRESTO
• 著者所属: NTT Computer and Data Science Laboratories, NTT Corporation
• 著者所属: Center for Quantum Information and Quantum Biology, Osaka University／Graduate School of Engineering Science, Osaka University／JST, PRESTO
• 著者所属(英): en
• 著者所属(英): Department of Applied Physics, University of Tokyo / Theoretical Quantum Physics Laboratory, RIKEN Cluster for Pioneering Research (CPR) / JST, PRESTO
• 著者所属(英): en
• 著者所属(英): Institude for Physics of Intelligence, University of Tokyo
• 著者所属(英): en
• 著者所属(英): NTT Computer and Data Science Laboratories, NTT Corporation / JST, PRESTO
• 著者所属(英): en
• 著者所属(英): NTT Computer and Data Science Laboratories, NTT Corporation
• 著者所属(英): en
• 著者所属(英): Center for Quantum Information and Quantum Biology, Osaka University / Graduate School of Engineering Science, Osaka University / JST, PRESTO
• 著者名: Nobuyuki, Yoshioka; Tsuyoshi, Okubo; Yasunari, Suzuki; Yuki, Koizumi; Wataru, Mizukami
• 著者名(英): Nobuyuki, Yoshioka; Tsuyoshi, Okubo; Yasunari, Suzuki; Yuki, Koizumi; Wataru, Mizukami
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Through intensive pursuit for quantum algorithms that exhibit speedup in terms of computational complexity, we have come across a crucial question, i.e., when and how will quantum computers outperform classical computers. Undoubtedly, the next important goal is to realize quantum advantage in practical problems. In our work, we aim to present a clear evidence that the main target is likely to be in the field of condensed matter physics. We summarize our three major contributions as follows: 1) Novel systematic error/runtime analysis on variational classical algorithms based on tensor networks, 2) Detailed analysis on quantum resource, performed at the level of executable logical instructions, 3) Clear indication of quantum-classical crosspoint for ground-state simulation in condensed matter problems, which is shown to be within runtime of hours using only a few hundreds of thousand physical qubits for 2d Heisenberg and 2d Fermi-Hubbard models. We argue that, to our knowledge, the field of condensed matter physics offers the most plausible path for demonstration of practical quantum advantage in terms of both qubit counts and total runtime.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Through intensive pursuit for quantum algorithms that exhibit speedup in terms of computational complexity, we have come across a crucial question, i.e., when and how will quantum computers outperform classical computers. Undoubtedly, the next important goal is to realize quantum advantage in practical problems. In our work, we aim to present a clear evidence that the main target is likely to be in the field of condensed matter physics. We summarize our three major contributions as follows: 1) Novel systematic error/runtime analysis on variational classical algorithms based on tensor networks, 2) Detailed analysis on quantum resource, performed at the level of executable logical instructions, 3) Clear indication of quantum-classical crosspoint for ground-state simulation in condensed matter problems, which is shown to be within runtime of hours using only a few hundreds of thousand physical qubits for 2d Heisenberg and 2d Fermi-Hubbard models. We argue that, to our knowledge, the field of condensed matter physics offers the most plausible path for demonstration of practical quantum advantage in terms of both qubit counts and total runtime.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA12894105
• 書誌情報: 研究報告量子ソフトウェア（QS）; 巻 2022-QS-7, 号 1, p. 1-7, 発行日 2022-10-20
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2435-6492
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会