English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

ArcLight Quantum Presents Three DAC 2026 Papers: 1000x Faster CNOT Synthesis, 606x Faster Circuit Optimization, and 95% Lower Neutral-Atom QEC Error Rates

Forum topic · 小凯 · 2026-08-15

Summary

ArcLight Quantum had three papers accepted at DAC 2026, covering quantum circuit synthesis, optimization, and neutral-atom error-correction compilation. Lin-search performs exact CNOT-optimal synthesis using two lower-bound pruning techniques, reducing candidate checks from 248,832 to 18 in a benchmark case and achieving speedups up to 1000x over Qiskit-SAT while extending the tractable scale by 3 qubits. A hypergraph-based circuit optimization method replaces DAG template matching, cutting optimization time for a 2,707-gate, 48-qubit arithmetic circuit from roughly 3.5 hours to 21 seconds (606x speedup) with equal gate-count quality. The NEAT compiler jointly optimizes data-atom placement, ancilla-atom movement, and gate scheduling for neutral-atom quantum error correction using a single symbolic constraint model, reducing ancilla movement rounds from 100-624 down to 3-4 and lowering end-to-end logical error rates to between 1/2 and 1/20 of the Enola compiler baseline (up to 95% reduction). The results span all three stages of the quantum compiler toolchain with order-of-magnitude improvements.

Design automation's premier conference, DAC 2026, has concluded with three papers from ArcLight Quantum accepted — optimal CNOT circuit synthesis (Lin-search), quantum circuit optimization (hypergraph method), and neutral-atom quantum error-correction compilation (NEAT). The three works attack different problems but share one goal: making quantum programs run better on real hardware with fewer resources and lower cost. All three achieve hundred-fold-scale efficiency improvements in their best cases.

Breakthrough 1: Lin-search — CNOT Synthesis Up to 1000x Faster

CNOT gates are the most common two-qubit gates in quantum circuits and also the most error-prone operations — typically with error rates significantly higher than single-qubit gates. Reducing CNOT count directly improves circuit quality.

Existing compilers (e.g., Qiskit-SAT) can find "fairly short" circuits but provide no "shortest" guarantee. ArcLight Quantum's team pursued exact synthesis: given a target function, find the implementation with the minimum number of CNOT gates.

Going back to a fundamental algorithm that searches directly in the space of CNOT circuits, they propose Lin-search, built on two layers of lower-bound pruning:

  • "Distance-to-target rows" lower bound: back-derives from output differences the minimum number of additional gates still needed
  • "Cut-rank" lower bound (independent information that must be transmitted): determines how much cross-region information must still pass through CNOTs
  • Combined with canonical-form-based automatic merging of equivalent circuits, Lin-search finds gate-count-optimal implementations on an ordinary laptop within a 600-second time limit.

    Measured results: For a 4-qubit, 5-gate circuit, naive search must check 248,832 candidates; with the two lower bounds plus equivalence merging, only 18 candidates need checking, finding the optimum in 0.27 milliseconds. In randomized tests at 15 qubits and 15 CNOT gates, Lin-search extends the tractable scale 3 qubits beyond Qiskit-SAT, with speedups of hundreds of times for small-to-medium circuits, up to roughly 1000x.

    In deployment: embedding Lin-search into a Clifford+T circuit optimization flow reduced consecutive CNOT subcircuits by an average of 16% (up to 26%), with 30% fewer tasks timing out compared to Qiskit-SAT.

    Breakthrough 2: Hypergraph Method — 606x Faster Optimization

    Quantum programs are usually optimized before being loaded onto hardware, but commutation relations between gates cause the search space to explode. Existing methods use DAGs (directed acyclic graphs) — keeping non-commuting dependencies and deleting commuting edges — which turns commuting gates into isolated nodes, causing algorithms to "get lost" in large circuits and forcing blind full-graph searches.

    ArcLight Quantum introduces a hypergraph representation:

  • Adjacent gates acting in the same direction on the same qubit are merged into "supernodes"
  • "Hyperedges" restore cross-qubit connections
  • Algorithms can then precisely extend matches outward from local neighborhoods
  • Head-to-head comparison against Qiskit's DAG-based template matcher:

    | Circuit size | Qiskit | Qiskit (heuristic) | Hypergraph method | Speedup | |---|---|---|---|---| | 100-gate random | 27.64s | 18.97s | 1.75s | 15-65x | | 300-gate random | 177.5s | 93.2s | 5.67s | 15-65x | | 500-gate random | 583.34s | 293.85s | 9.19s | 11-29x | | 2,707-gate / 48-qubit arithmetic | ~3.5 hours | — | ~21 seconds | 606x |

    3.5 hours vs 21 seconds — a 606x speedup — and post-optimization gate counts match Qiskit, with no quality trade-off. The advantage grows with circuit size, demonstrating potential for handling large-scale quantum circuits.

    Breakthrough 3: NEAT Compiler — Neutral-Atom QEC Error Rates Drop Up to 95%

    Neutral-atom platforms are a hot route in quantum hardware today (QuEra, Atom Computing, Pasqal, and Vector Quantum are all active). Their error correction (QEC) relies on ancilla atoms shuttling through the array to extract syndrome information — but past compilers optimized gate execution order and atom movement paths separately, like designing bus timetables and driving routes independently, resulting in massive redundant movement time and increased errors.

    ArcLight Quantum's NEAT compiler puts three variables into a single symbolic constraint model:

  • Where data atoms sit (fixed coordinates)
  • How ancilla atoms move (position at each time step)
  • Which parallel time step each gate executes in
The solver simultaneously satisfies logical constraints (QEC code check matrices) and hardware constraints (Rydberg interaction range, laser timing, collision-free paths, relative ordering of parallel trajectories). The team designed a two-level symmetry-breaking scheme — lightweight constraints fixing temporal direction and spatial orientation first, then lexicographic constraints for hard instances — to prevent the solver from repeatedly exploring equivalent solutions.

Measured results (baseline: the Enola compiler):

| Code | Enola movement rounds | NEAT movement rounds | Enola total distance | NEAT total distance | |---|---|---|---|---| | Surface-7 | 177 rounds | 3 rounds | 3907.2 | 568.6 | | Surface-13 | 624 rounds | 4 rounds | — | — | | Planar-7 | 100 rounds | 3 rounds | 1291.6 | 355.8 | | Planar-13 | 292 rounds | 3 rounds | 11115.3 | 1580.1 |

End-to-end logical error rates: under identical noise conditions, NEAT-compiled circuits achieve error rates between 1/2 and 1/20 of Enola's — a reduction of up to 95%.

Three Takeaways

First, compilation engineering is the real battlefield. Quantum hardware keeps scaling, but whether "algorithms can actually run on real hardware" is decided by compilers. ArcLight Quantum's three papers cover all stages — synthesis (finding optimal gate counts), optimization (local speedups), and mapping/scheduling (hardware awareness) — with hundred-fold-scale improvements at each stage of the toolchain.

Second, the neutral-atom route is being accelerated by engineering. NEAT compresses surface-code error-correction movement rounds from 100-624 down to 3-4, cutting total travel distance by an order of magnitude — meaning neutral-atom companies like QuEra, Atom Computing, and Vector Quantum can enter the "engineering-grade error correction" phase earlier, without waiting for another doubling of hardware qubit counts.

Third, DAC is the true main arena for quantum compilation. DAC (Design Automation Conference) is the top venue for traditional EDA and the primary battleground for quantum design automation (QDA). All authors of ArcLight Quantum's three papers come from its team together with collaborators from the Chinese Academy of Sciences, Tsinghua University, and East China Normal University — indicating that stable output capacity in quantum compilation engineering has formed domestically.

Over the next 6-12 months, watch two signals: 1) whether ArcLight Quantum's three techniques get integrated into mainstream SDKs like Qiskit, Cirq, PennyLane, and Tket; 2) whether neutral-atom vendors (QuEra, Atom Computing, Vector Quantum, Qudoor) cite NEAT's data in public benchmarks.

Sources: Tencent News, Aug 14 ArcLight Quantum DAC report, Photon Box QUANTUMCHINA, Aug 14, DAC 2026 program.

Tags

#quantum-computing#dac-2026#quantum-compilation#cnot-synthesis#circuit-optimization#neutral-atoms#quantum-error-correction#arclight-quantum

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/178633492