General circuit compilation protocol into partially fault-tolerant quantum computing architecture

• URL: http://arxiv.org/abs/2603.17428v1
• Date: Wed, 18 Mar 2026 07:08:56 GMT
• Title: General circuit compilation protocol into partially fault-tolerant quantum computing architecture
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As we are entering an early-FTQC era, circuit execution protocols with logical qubits and certain error-correcting codes are being discussed. Here, we propose a circuit execution protocol for the space-time efficient analog rotation (STAR) architecture. Gate operations within the STAR architecture is based on lattice surgery with surface codes, but it allows direct execution of continuous gates $Rz(θ)$ as non-Clifford gates instead of $T = Rz(π/4)$. $Rz(θ)$ operations involve creation of resource states $|m_θ\rangle = \frac{1}{\sqrt{2}} (|0 \rangle + e^{iθ} |1\rangle ) $ followed by ZZ joint measurements with target logical qubits. While employing $Rz(θ)$ enables more efficient circuit execution, both their creations and joint measurements are probabilistic processes and adopt repeat-until-success (RUS) protocols which are likely to result in considerable time overhead. Our circuit execution protocol aims to reduce such time overhead by parallel trials of resource state creations and more frequent trials of joint measurements. By employing quadratic unconstrained binary optimization (QUBO) in determining resource state allocations within the space, we successfully make our protocol efficient. Furthermore, we proposed performance estimators given the target circuit and qubit topology. It successfully predicts the time performance within less time than actual simulations do, and helps find the optimal qubit topology to run the target circuits efficiently.

Related papers

• RushHour: A Dynamically Reconfigurable Lattice-Surgery Architecture [40.10865338207471]
  We present dynamic LS, which enables efficient reconfiguration of the ancilla space, just-in-time allocation of resource states, and dynamic rotations of logical qubits.<n>We realize dynamic LS with RushHour through a hardware-compiler co-design.<n>On the smallest chips, 86% of benchmarks run only with RushHour, while existing approaches require 1.2-3.5$times$ larger chips.
  arXiv  Detail & Related papers  (2026-08-19T14:51:15Z)
• 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)
• Quantum Circuit Pre-Synthesis: Learning Local Edits to Reduce $T$-count [1.6195650245658724]
  Local synthesis approaches are commonly used to compile large circuits by decomposing them into substructures.<n>We propose textscQ-PreSyn, a strategy that, given a set of local edits preserving circuit equivalence, uses a RL agent to identify effective sequences.<n> Experimental results show up to a $20%$ reduction in $T$-count on circuits with up to 25 qubits.
  arXiv  Detail & Related papers  (2026-01-27T15:58:05Z)
• Batched high-rate logical operations for quantum LDPC codes [2.722479714583866]
  High-rate quantum LDPC codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits.<n>We extend this concept to high-rate computation by constructing emphbatched fault-tolerant operations that apply the same logical gate across many code blocks in parallel.
  arXiv  Detail & Related papers  (2025-10-07T17:26:10Z)
• 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)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Parallel Logical Measurements via Quantum Code Surgery [42.95092131256421]
  Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes.<n>We present a code surgery scheme, applicable to any qubit stabiliser low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel.
  arXiv  Detail & Related papers  (2025-03-06T22:05:52Z)
• 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)
• Fast and Parallelizable Logical Computation with Homological Product Codes [3.4338109681532027]
  High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. We design fast and parallelizable logical gates for qLDPC codes, demonstrating their utility for key algorithmic subroutines such as the quantum adder.
  arXiv  Detail & Related papers  (2024-07-26T03:49:59Z)
• Communication-Efficient Adam-Type Algorithms for Distributed Data Mining [93.50424502011626]
  We propose a class of novel distributed Adam-type algorithms (emphi.e., SketchedAMSGrad) utilizing sketching. Our new algorithm achieves a fast convergence rate of $O(frac1sqrtnT + frac1(k/d)2 T)$ with the communication cost of $O(k log(d))$ at each iteration.
  arXiv  Detail & Related papers  (2022-10-14T01:42:05Z)
• Approximate quantum gates compiling with self-navigation algorithm [0.0]
  We propose an algorithm to approximately compile single-qubit gates with arbitrary accuracy. Evaluation results show that the overall rotation distance generated by our algorithm is significantly shorter than the commonly used $U3$ gate.
  arXiv  Detail & Related papers  (2022-04-06T03:07:17Z)
• Private Frequency Estimation via Projective Geometry [47.112770141205864]
  We propose a new algorithm ProjectiveGeometryResponse (PGR) for locally differentially private (LDP) frequency estimation. For a universe size of $k$ and with $n$ users, our $varepsilon$-LDP algorithm has communication cost $lceillogkrceil bits in the private coin setting and $varepsilonlog e + O(1)$ in the public coin setting. In many parameter settings used in practice this is a significant improvement over the O(n+k2)$optimal cost that is achieved by the recent PI-
  arXiv  Detail & Related papers  (2022-03-01T02:49:55Z)

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.