Answers are grounded in this paper and cite their sources.
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 timelike soft information suggests the presence of logical errors. We first discuss basic features of the timelike complementary gap as the concrete example of the timelike soft information based on numerical results. Then, we study average runtime of sequences of commutable logical Pauli measurements. We find that our protocol surpasses an existing runtime reduction protocol called temporally encoded lattice surgery (TELS) when the length of the sequence is small. 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.
No takes yet. Share an insight, caveat, or question.
Akahoshi et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: