@techreport{oai:ipsj.ixsq.nii.ac.jp:00220405,
 author = {Nobuyuki, Yoshioka and Tsuyoshi, Okubo and Yasunari, Suzuki and Yuki, Koizumi and Wataru, Mizukami and Nobuyuki, Yoshioka and Tsuyoshi, Okubo and Yasunari, Suzuki and Yuki, Koizumi and Wataru, Mizukami},
 issue = {1},
 month = {Oct},
 note = {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., 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.},
 title = {Searching for quantum-classical crossover in condensed matter problems},
 year = {2022}
}