Runtime reduction in lattice surgery utilizing time-like soft information

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Akahoshi, Yutaro, Toshio, Riki, Fujisaki, Jun, Oshima, Hirotaka, Sato, Shintaro, Fujii, Keisuke
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917039250079744
author Akahoshi, Yutaro
Toshio, Riki
Fujisaki, Jun
Oshima, Hirotaka
Sato, Shintaro
Fujii, Keisuke
author_facet Akahoshi, Yutaro
Toshio, Riki
Fujisaki, Jun
Oshima, Hirotaka
Sato, Shintaro
Fujii, Keisuke
contents Runtime optimization of the quantum computing within a given computational resource is important to achieve practical quantum advantage. In this paper, we propose a runtime reduction protocol for the lattice surgery, which utilizes the soft information corresponding to the logical measurement error. Our proposal is a simple two-step protocol: operating the lattice surgery with the small number of syndrome measurement cycles, and reexecuting it with full syndrome measurement cycles in cases where the time-like soft information catches logical error symptoms. We firstly discuss basic features of the time-like complementary gap as the concrete example of the time-like soft information based on numerical results. Then, we show that our protocol surpasses the existing runtime reduction protocol called temporally encoded lattice surgery (TELS) for the most cases. In addition, we confirm that the combination of our protocol and the TELS protocol can reduce the runtime further, over 50% in comparison to the naive serial execution of the lattice surgery. The proposed protocol in this paper can be applied to any quantum computing architecture based on the lattice surgery, and we expect that this will be one of the fundamental building blocks of runtime optimization to achieve practical scale quantum computing.
format Preprint
id arxiv_https___arxiv_org_abs_2510_21149
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Runtime reduction in lattice surgery utilizing time-like soft information
Akahoshi, Yutaro
Toshio, Riki
Fujisaki, Jun
Oshima, Hirotaka
Sato, Shintaro
Fujii, Keisuke
Quantum Physics
Runtime optimization of the quantum computing within a given computational resource is important to achieve practical quantum advantage. In this paper, we propose a runtime reduction protocol for the lattice surgery, which utilizes the soft information corresponding to the logical measurement error. Our proposal is a simple two-step protocol: operating the lattice surgery with the small number of syndrome measurement cycles, and reexecuting it with full syndrome measurement cycles in cases where the time-like soft information catches logical error symptoms. We firstly discuss basic features of the time-like complementary gap as the concrete example of the time-like soft information based on numerical results. Then, we show that our protocol surpasses the existing runtime reduction protocol called temporally encoded lattice surgery (TELS) for the most cases. In addition, we confirm that the combination of our protocol and the TELS protocol can reduce the runtime further, over 50% in comparison to the naive serial execution of the lattice surgery. The proposed protocol in this paper can be applied to any quantum computing architecture based on the lattice surgery, and we expect that this will be one of the fundamental building blocks of runtime optimization to achieve practical scale quantum computing.
title Runtime reduction in lattice surgery utilizing time-like soft information
topic Quantum Physics
url https://arxiv.org/abs/2510.21149