- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Automatic Translation feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
End-to-end complexity for simulating the Schwinger model on quantum computers
Description
The Schwinger model is one of the simplest gauge theories. It is known that a topological term of the model leads to the infamous sign problem in the classical Monte Carlo method. In contrast to this, recently, quantum computing in Hamiltonian formalism has gained attention. In this work, we estimate the resources needed for quantum computers to compute physical quantities that are challenging to compute on classical computers. Specifically, we propose an efficient implementation of block-encoding of the Schwinger model Hamiltonian. Considering the structure of the Hamiltonian, this block-encoding with a normalization factor of O(N³) can be implemented using O(N + log²(N/ε)) T gates. As an end-to-end application, we compute the vacuum persistence amplitude. As a result, we found that for a system size N = 128 and an additive error ε = 0.01, with an evolution time t and a lattice spacing α satisfying t/2α = 10, the vacuum persistence amplitude can be calculated using about 10¹³ T gates. Our results provide insights into predictions about the performance of quantum computers in the FTQC and early FTQC era, clarifying the challenges in solving meaningful problems within a realistic timeframe.
Journal
-
- Quantum
-
Quantum 8 2024-09-17
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
- Tweet
Details 詳細情報について
-
- CRID
- 1050866415285670272
-
- ISSN
- 2521327X
-
- HANDLE
- 2433/292314
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- IRDB