Pith. sign in

REVIEW 2 cited by

Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures

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 2411.04270 v2 pith:Y6YFZBZZ submitted 2024-11-06 quant-ph cs.ARmath.OC

classification quant-phcs.ARmath.OC
keywords fault-tolerantquantumerrormagictimeaccountalgorithmarchitecture
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade-offs between the number of physical qubits and the fault-tolerant execution time of a quantum algorithm. We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations, forming a supply chain network for production and consumption of magic states. Using a heuristic algorithm, we solve the multi-objective optimization problem of minimizing space and time subject to a user-defined error budget for the success of the computation, taking the performance of various fault-tolerant protocols into account. As an application, we show that physical quantum resource estimation reduces to a simple model involving a small number of key parameters, namely, the circuit volume, the error prefactors ($\mu$) and error suppression rates ($\Lambda$) of the fault-tolerant protocols, the reaction time ($\gamma$), and an allowed slowdown factor ($\beta$).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. SPARO: Surface-code Pauli-based Architectural Resource Optimization for Fault-tolerant Quantum Computing

    quant-ph 2025-04 reject novelty 5.0 of 10

    A dynamic resource allocation tool for Pauli-based surface-code computation claims roughly 51 percent logical error reductions over static layouts, evaluated only through its own fitted error model.

  2. The Economics of an Open-Source Quantum Computer

    quant-ph 2025-01 conditional novelty 5.0 of 10

    An open-source quantum computer could reduce the cost and time to build a fault-tolerant quantum computer for both itself and proprietary firms by easing benchmarking, hardware reuse, and hiring.

Pith tools