Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation

• URL: http://arxiv.org/abs/2606.21192v1
• Date: Fri, 19 Jun 2026 08:03:26 GMT
• Title: Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation
• Abstract summary: Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead.<n>We introduce double-slice routing, a constant-depth spacetime-routing method that uses two consecutive time slices.<n>We numerically benchmark the resulting compiler on Hamiltonian-simulation workloads to show that double-slice routing reduces compilation cost by up to a factor of 2.4 over a single-slice baseline.
• Score: 0.22166578153935787
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead. Routing, in particular, faces a basic tension between suppressing path conflicts through greater spatial allocation and exploiting the time direction to realize ancilla-efficient spacetime routing. Existing approaches do not fully resolve this trade-off while retaining compatibility with inner factory layouts and termination guarantees. Here we introduce double-slice routing, a constant-depth spacetime-routing method that uses two consecutive time slices with a guarantee that its kink-parity correction terminates under both planar and stacked architectures. We numerically benchmark the resulting compiler on Hamiltonian-simulation workloads to show that double-slice routing reduces compilation cost by up to a factor of 2.4 over a single-slice baseline. Compared to projective routing, an existing method that allows an unbounded number of time slices per path, double-slice routing achieves smaller circuit volume with only a marginal execution-time penalty. Combined with a cultivation-compatible mapping optimization, the overall improvement reaches up to 7.5-fold over a naive single-slice compilation baseline. These results identify double-slice routing as a practically useful operating point in lattice-surgery compilation and show the substantial benefit in joint optimization of mapping and routing.

Related papers

• Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths [20.986889484035093]
  A path in a quantum network is a chain of repeaters that distributes entanglement between two users.<n>We show how a path's performance depends jointly on its route and its per-link settings.<n>A single run returns the full rate fidelity frontier, from which the path maximizing any nondecreasing utility function can be selected.
  arXiv  Detail & Related papers  (2026-09-14T18:30:46Z)
• CRISP: Cliff-awaRe Input-adaptive Sparse Prefilling with Structural-Mass-Motivated Routing [90.63350360476294]
  We present CRISP (Cliff-awaRe Input-adaptive Sparse Prefilling), which identifies and addresses two structural challenges in this dynamic routing paradigm.<n>We show that the routing decision can be read directly off the structure of the proxy attention map.<n>We formalize the post-softmax mass cliff and demonstrate theoretically that strictly cumulative coverage thresholds accumulate O(n) background noise at long contexts.
  arXiv  Detail & Related papers  (2026-09-01T22:49:46Z)
• Graph-Aware Exact Branch-and-Bound with Device Profiles for Static Qubit Allocation [1.5229257192293195]
  Static qubit allocation maps a circuit's logical qubits to a sparse physical device.<n>We integrate graph-aware exact reductions with an engineering bundle for a lightweight assignment-bound path.<n>Results show that graph-aware node processing and engineering the search process substantially reduce the resources required for exact allocation.
  arXiv  Detail & Related papers  (2026-08-04T12:36:54Z)
• Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles [49.315843050082925]
  We present a bi approach for minimum-time motion planning convex obstacles that is guaranteed to converge.<n>We find that the proposed method produces high-quality trajectories with times to produce state-of-the-art decomposition of variables.
  arXiv  Detail & Related papers  (2026-08-03T19:48:24Z)
• Coupled Routing and Configuration Optimization for Multi-Viewpoint Robotic Inspection [4.164290233214403]
  We present a unified framework that turns a set of 6-DoF inspection viewpoints into a time-optimal, collision-free route for a 9-DoF robotic system.<n>Unlike modular pipelines that fix a single inverse-kinematics (IK) configuration per viewpoint, build an all-pairs travel-time map, and then route, our method jointly optimize the visiting order and the per-viewpoint configuration in a single global search.
  arXiv  Detail & Related papers  (2026-06-17T17:14:54Z)
• A Neutral-Atom Quantum Compiler with Application-Specific Layout and Hub-Assisted Shuttling [0.0]
  NISQ circuits are constrained by a finite interaction range and a minimum separation between simultaneously addressable sites.<n>We address this with hub traps, a small number of dynamically placed empty traps that serve as transit waypoints.<n>We evaluate the compiler on seventeen benchmarks using analytic estimates of execution time and a per-layer fidelity proxy.
  arXiv  Detail & Related papers  (2026-05-28T14:03:05Z)
• Collision-Free Velocity Scheduling for Multi-Agent Systems on Predefined Routes via Inexact-Projection ADMM [0.0]
  In structured multi-agent projects, agents often must follow predefined routes, making rerouting or impossible.<n>This paper addresses route-constrained multi-agent coordination by optimizing waypoint times while preserving each agent's assigned waypoint order and nominal route assignment.
  arXiv  Detail & Related papers  (2026-03-23T12:34:18Z)
• AdaFuse: Accelerating Dynamic Adapter Inference via Token-Level Pre-Gating and Fused Kernel Optimization [84.25316984309725]
  Integration of dynamic, sparse structures with parameter-efficient adapters (e.g., LoRA) is a powerful technique for enhancing Large Language Models (LLMs)<n>Despite minimal increases in computational load, the computation latency often skyrockets, leading to decoding speeds slowing by over 2.5 times.<n>AdaFuse is a framework built on a tight co-design between the algorithm and the underlying hardware system to enable efficient dynamic adapter execution.
  arXiv  Detail & Related papers  (2026-03-12T12:46:42Z)
• Improving Qubit Routing by Using Entanglement Mediated Remote Gates [1.9299285312415735]
  Near-term quantum computers often have connectivity constraints, on which pairs of qubits in the device can interact. We develop a method to optimize the routing of circuits with both standard gates and EPR mediated remote controlled-NOT gates. We demonstrate that EPR-mediated operations can substantially reduce the total number of gates and depths of compiled circuits.
  arXiv  Detail & Related papers  (2023-09-22T18:51:36Z)
• Deep Declarative Dynamic Time Warping for End-to-End Learning of Alignment Paths [54.53208538517505]
  This paper addresses learning end-to-end models for time series data that include a temporal alignment step via dynamic time warping (DTW) We propose a DTW layer based around bi-level optimisation and deep declarative networks, which we name DecDTW. We show that this property is particularly useful for applications where downstream loss functions are defined on the optimal alignment path itself.
  arXiv  Detail & Related papers  (2023-03-19T21:58:37Z)
• InverseForm: A Loss Function for Structured Boundary-Aware Segmentation [80.39674800972182]
  We present a novel boundary-aware loss term for semantic segmentation using an inverse-transformation network. This plug-in loss term complements the cross-entropy loss in capturing boundary transformations. We analyze the quantitative and qualitative effects of our loss function on three indoor and outdoor segmentation benchmarks.
  arXiv  Detail & Related papers  (2021-04-06T18:52:45Z)
• Scaling the Convex Barrier with Sparse Dual Algorithms [141.4085318878354]
  We present two novel dual algorithms for tight and efficient neural network bounding. Both methods recover the strengths of the new relaxation: tightness and a linear separation oracle. We can obtain better bounds than off-the-shelf solvers in only a fraction of their running time.
  arXiv  Detail & Related papers  (2021-01-14T19:45:17Z)
• Joint Parameter-and-Bandwidth Allocation for Improving the Efficiency of Partitioned Edge Learning [73.82875010696849]
  Machine learning algorithms are deployed at the network edge for training artificial intelligence (AI) models. This paper focuses on the novel joint design of parameter (computation load) allocation and bandwidth allocation.
  arXiv  Detail & Related papers  (2020-03-10T05:52:15Z)

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.