Pith. sign in

REVIEW 4 cited by

Switch networks for photonic fusion-based quantum computing

Not yet reviewed by Pith; the record is open.

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 2109.13760 v1 pith:R4XOHMFG submitted 2021-09-28 quant-ph

classification quant-ph
keywords quantumswitchnetworksphotoniccomputingfeedforwardneededoperations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Fusion-based quantum computing (FBQC) offers a powerful approach to building a fault-tolerant universal quantum computer using photonic components -- single-photon sources, linear-optical circuits, single-photon detectors, and optical switching with feedforward control. Both individual optical switches and sophisticated switch networks are needed where it is necessary to perform operations conditionally, using feedforward of previous photon-detection outcomes, within the lifetime of remaining photons. Most visibly, feedforward switching is required for fault-tolerant operations at the level of logical qubits, which are needed in turn for useful quantum algorithms. However, switch networks are also required for multiplexing ("muxing") stages that are needed for generating specific small entangled resource states, where it is used to boost the probabilities for allocating quantum states to fusion gates and other operations -- a task which dominates the footprint of photonic FBQC. Despite their importance, limited attention has been paid to exploring possible designs of switch networks in this setting. Here we present a wide range of new techniques and schemes which enable major improvements in terms of muxing efficiency and reductions in hardware requirements. Since the use of photonic switching heavily impacts qubit losses and errors, our schemes are constructed with low switch depth. They also exploit specific features of linear-optical circuits which are commonly used to generate entanglement in proposed quantum computing and quantum network schemes.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Single-photon-boosted type-I fusion gates

    quant-ph 2026-03 unverdicted novelty 7.0 of 10

    A type-I fusion gate, boosted with four single-photon ancillas and passive linear optics, reaches 3/4 success probability via a distillation protocol.

  2. Measurement-Based Quantum Computing on a Photonic Chip

    quant-ph 2026-07 accept novelty 6.0 of 10

    Four-photon star and linear graph states on a silicon photonic chip enable MBQC single- and two-qubit gates plus Grover and Deutsch-Jozsa algorithms at fidelities of 75-83%.

  3. Efficient and scalable inter-module switching for distributed quantum computing architectures

    quant-ph 2025-08 conditional novelty 6.0 of 10

    GMZI-based decentralized switch designs achieve any-to-any module connectivity with half the active depth and coupler count of GMZI-Spanke switches.

  4. Comparison of schemes for highly loss tolerant photonic fusion based quantum computing

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A comparison of photonic fusion-based quantum computing schemes finds a loopy diamond network with 9% loss per photon threshold and proposes using 3-GHZ state counts as a better resource costing metric.

Pith tools