Harvest: Resource-Aware Quantum Compilation for Magic State Protocols

• URL: http://arxiv.org/abs/2608.03315v1
• Date: Tue, 04 Aug 2026 08:21:59 GMT
• Title: Harvest: Resource-Aware Quantum Compilation for Magic State Protocols
• Abstract summary: We present Harvest, a resource-aware compilation approach for lattice-surgery.<n>It co-optimizes magic-state consumption with circuit-aware placement and congestion-aware routing.<n>It achieves an average speedup of $4.83times$ (up to $17.8times$) over sequential execution.
• Score: 40.10865338207471
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum processors based on topological codes execute programs through lattice surgery, where operations must be mapped, routed, and supplied with magic states across a 2D grid of physical patches. Non-Clifford operations require these magic states, produced either by distillation factories or by cultivation, each trading footprint against preparation latency, and delivering a magic state to the data patches that consume it requires routing through the same shared layout as every other operation. Yet placement, routing, scheduling, and magic-state supply cannot be optimized in isolation: two operations with no circuit-level dependency can still contend for the same ports, routes, or magic-state terminals once placed, so a compiler that decouples instruction scheduling from magic-state generation, or hard-codes a single generation protocol, is forced to trade execution time against layout footprint instead of co-optimizing both across protocols. We present Harvest, a resource-aware compilation approach for lattice-surgery that co-optimizes magic-state consumption with circuit-aware placement and congestion-aware routing under a protocol-agnostic resource model, then reclaims unused layout footprint after scheduling. Across standard benchmark suites (QAOA, QFT, QASMBench), Harvest achieves an average speedup of $4.83\times$ (up to $17.8\times$) over sequential execution, improves schedule length by up to $1.35\times$ through circuit-aware placement, and reclaims up to $72.0\%$ of unused magic-state patches and $33.9\%$ of unused routing patches.

Related papers

• HetRoute Heterogeneous and Cost-aware Collaborative Routing Framework for Distributed Edge MoE Inference [47.0879800334801]
  HetRoute is a heterogeneous-cost-aware collaborative routing framework for distributed edge MoE inference.<n>HetRoute reduces average inference latency by up to 59.0% and P99 latency by up to 58.0%.
  arXiv  Detail & Related papers  (2026-08-01T10:30:01Z)
• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Efficient Magic State Factory Via Transversal Non-Clifford Gate [1.9038688902168008]
  Magic-state preparation is a central component of fault-tolerant quantum computing.<n>We carry out end-to-end simulations of magic-state preparation using code switching.<n>We propose two fault-tolerant magic-state preparation protocols.
  arXiv  Detail & Related papers  (2026-06-15T04:15:03Z)
• INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures [2.8939699256527276]
  Near-term FTQC system designs are constrained by limited error budgets and largely sequential execution of non-Clifford gates.<n>In this work, we study the extractor architecture, a recently proposed FTQC design that enables universal quantum computation on spatially-efficient QEC codes.
  arXiv  Detail & Related papers  (2026-04-28T00:58:22Z)
• A Quantum Encoding of Traveling Salesperson Tours via Route Generation, Cost Phases, and a Valid-Permutation Oracle [45.88028371034407]
  We present a compact quantum encoding of the Traveling Salesperson Problem (TSP) based on a time-register representation of tours.<n>We describe three ingredients of the construction: uniform route generation over the route register, a reversible oracle for marking valid tours, and a phase oracle that encodes the total tour cost.
  arXiv  Detail & Related papers  (2026-03-22T15:15:28Z)
• General circuit compilation protocol into partially fault-tolerant quantum computing architecture [0.0]
  We propose a circuit execution protocol for the space-time efficient analog rotation (STAR) architecture.<n>Our protocol aims to reduce such time overhead by parallel trials of resource state creations and more frequent trials of joint measurements.
  arXiv  Detail & Related papers  (2026-03-18T07:08:56Z)
• Scheduling Lattice Surgery with Magic State Cultivation [1.4558867025190718]
  Fault-tolerant quantum computation using surface codes relies on efficient scheduling of non-Clifford operations.<n>We introduce Pure Magic scheduling, which dynamically re-purposes magic state cultivation qubits for routing operations.<n>Our evaluation across 17 benchmark circuits improves scheduling efficiency by 19% to 223% compared to traditional bus routing.
  arXiv  Detail & Related papers  (2025-12-06T16:16:20Z)
• Accelerating Transpilation in Quantum Machine Learning with Haiqu's Rivet-transpiler [45.88028371034407]
  We develop the Rivet transpiler, which accelerates transpilation by reusing previously transpiled circuits.<n>We demonstrate up to 600% improvement in transpilation time for quantum layerwise learning.
  arXiv  Detail & Related papers  (2025-08-29T06:00:29Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation [0.618727087412292]
  We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis.
  arXiv  Detail & Related papers  (2023-11-17T18:15:36Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)

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.