Pith. sign in

REVIEW 8 cited by

Interleaving: Modular architectures for fault-tolerant photonic quantum computing

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.08612 v1 pith:UHGGBDD2 submitted 2021-03-15 quant-ph

Hector Bombin , Isaac H. Kim , Daniel Litinski , Naomi Nickerson , Mihir Pant , Fernando Pastawski , Sam Roberts , Terry Rudolph This is my paper · ORCID
classification quant-ph
keywords quantumqubitsphotonicdelaysdevicesfiberinterleavingcomputers
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Useful fault-tolerant quantum computers require very large numbers of physical qubits. Quantum computers are often designed as arrays of static qubits executing gates and measurements. Photonic qubits require a different approach. In photonic fusion-based quantum computing (FBQC), the main hardware components are resource-state generators (RSGs) and fusion devices connected via waveguides and switches. RSGs produce small entangled states of a few photonic qubits, whereas fusion devices perform entangling measurements between different resource states, thereby executing computations. In addition, low-loss photonic delays such as optical fiber can be used as fixed-time quantum memories simultaneously storing thousands of photonic qubits. Here, we present a modular architecture for FBQC in which these components are combined to form "interleaving modules" consisting of one RSG with its associated fusion devices and a few fiber delays. Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space. Networks of modules are universal fault-tolerant quantum computers, which we demonstrate using surface codes and lattice surgery as a guiding example. Our numerical analysis shows that in a network of modules containing 1-km-long fiber delays, each RSG can generate four logical distance-35 surface-code qubits while tolerating photon loss rates above 2% in addition to the fiber-delay loss. We illustrate how the combination of interleaving with further uses of non-local fiber connections can reduce the cost of logical operations and facilitate the implementation of unconventional geometries such as periodic boundaries or stellated surface codes. Interleaving applies beyond purely optical architectures, and can also turn many small disconnected matter-qubit devices with transduction to photons into a large-scale quantum computer.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation

    quant-ph 2025-06 conditional novelty 8.0 of 10

    Blocklet concatenation yields fusion-based quantum computing protocols with constant-sized resource states, erasure thresholds up to 19.1%, and footprint per logical qubit scaling better than surface codes.

  2. Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries

    quant-ph 2025-02 conditional novelty 7.0 of 10

    Fat-Tree QRAM pipelines up to log(N) simultaneous queries to a size-N memory in about log(N) time, using only about twice the hardware of a bucket-brigade QRAM.

  3. Foliated Quantum Error Correction for Qudits

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Any prime-dimensional qudit Pauli code can be foliated into a graph state for fault-tolerant measurement-based quantum computing.

  4. Improved T counts and active volume estimates for high-level arithmetic subroutines

    quant-ph 2025-04 conditional novelty 6.0 of 10

    The paper presents optimized quantum arithmetic circuits and active-volume block counts for a catalogue of low- and high-level subroutines, using temporary AND gates and orientated ZX diagram counting.

  5. OneAdapt: Adaptive Compilation for Resource-Constrained Photonic One-Way Quantum Computing

    quant-ph 2025-04 conditional novelty 6.0 of 10

    OneAdapt introduces a resource-adaptive compilation approach for photonic one-way quantum computing, using dynamic node refresh and skewed temporal edges to reduce hardware size and execution depth.

  6. Graph State Fission

    quant-ph 2024-11 conditional novelty 6.0 of 10

    A protocol to split a qubit in a graph state into two qubits while preserving selected connections, requiring only one Bell pair of additional entanglement.

  7. PowerMove: Optimizing Compilation for Neutral Atom Quantum Computers with Zoned Architecture

    quant-ph 2024-11 reject novelty 6.0 of 10

    PowerMove claims order-of-magnitude fidelity improvements on neutral atom quantum computers by using continuous qubit routing and a storage zone.

  8. Stratified Cohomological Quantum Codes via Colimits in Ch(R)

    quant-ph 2025-06 reject novelty 4.0 of 10

    Colimit gluing of chain complexes over posets is proposed as a universal language for quantum CSS codes, but the worked examples contain errors.

Pith tools