Runtime reduction in lattice surgery utilizing time-like soft information

• URL: http://arxiv.org/abs/2510.21149v1
• Date: Fri, 24 Oct 2025 04:42:31 GMT
• Title: Runtime reduction in lattice surgery utilizing time-like soft information
• Authors: Yutaro Akahoshi, Riki Toshio, Jun Fujisaki, Hirotaka Oshima, Shintaro Sato, Keisuke Fujii,
• Abstract summary: 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.<n>We show that our protocol surpasses the existing runtime reduction protocol called temporally encoded lattice surgery (TELS) for the most cases.
• Score: 2.370310454459195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Ecmas: Efficient Circuit Mapping and Scheduling for Surface Code [20.03248840966205]
  We study the surface code mapping and scheduling problem. To reduce the execution time of a quantum circuit, we first introduce two novel metrics. Ecmas can dramatically reduce the execution time in both double defect and lattice surgery models.
  arXiv  Detail & Related papers  (2023-12-23T13:27:59Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.<n>The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol.<n>We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Bounds on an effective thermalization beyond the Zeno limit [0.0]
  The quantum Zeno effect has emerged as a widely utilized technique to safeguard classical information stored in quantum systems. We derive effective Zeno dynamics for any time interval between operations. These findings enhance our understanding of the practical applicability of the quantum Zeno effect in preserving classical information stored in quantum systems.
  arXiv  Detail & Related papers  (2023-04-12T13:18:11Z)
• New magic state distillation factories optimized by temporally encoded lattice surgery [0.0]
  Timelike failures during lattice surgery protocols can result in logical failures during the execution of an algorithm. We introduce an improved TELS protocol and subsequently augment it with the ability to correct low-weight classical errors. We also explore large families of classical error correcting codes for a wide range of parallelizable Pauli set sizes.
  arXiv  Detail & Related papers  (2022-10-28T00:34:37Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Universal quantum computing with twist-free and temporally encoded lattice surgery [3.222802562733787]
  We introduce a decoder capable of correcting spacelike and timelike errors during lattice surgery protocols. We compute logical failure rates of a lattice surgery protocol for a biased circuit-level noise model. We propose a layout for a quantum processor that is more efficient for rectangular surface codes exploiting noise bias.
  arXiv  Detail & Related papers  (2021-09-06T21:18:01Z)
• Fast and robust quantum state tomography from few basis measurements [65.36803384844723]
  We present an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
  arXiv  Detail & Related papers  (2020-09-17T11:28:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.