Pith. sign in

REVIEW 4 cited by

Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections

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 2211.15465 v1 pith:54NOLBVX submitted 2022-11-28 quant-ph

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

In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum computations with thousands of logical qubits, the active volume can be orders of magnitude lower than the circuit volume. Importantly, the architecture does not require all-to-all connectivity between N logical qubits. Instead, each logical qubit is connected to O(log N) other sites. As an example, we show that, using the same number of logical qubits, a 2048-bit factoring algorithm can be executed 44 times faster than on a general-purpose architecture without non-local connections. With photonic qubits, long-range connections are available and we show how photonic components can be used to construct a fusion-based active-volume quantum computer.

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. OpenAlex reports about 13 citations worldwide. Full citation record

  1. Trace-Based Reconstruction of Quantum Circuit Dataflow in Surface Codes

    quant-ph 2025-08 conditional novelty 7.0 of 10

    From per-patch binary activity traces of surface-code lattice surgery, TraceQ reconstructs the two-qubit gate dependency DAG and detects embedded subroutines with 74-95% success and no false positives, but only on syn...

  2. Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer

    quant-ph 2025-06 conditional novelty 7.0 of 10

    An optimized Trotter-based quantum algorithm reduces the estimated cost of simulating X-ray absorption spectra for a Li4Mn2O cathode cluster to 100 logical qubits and 3.1e8 Toffoli gates per circuit.

  3. Scalable decoding protocols for fast transversal logic in the surface code

    quant-ph 2025-05 conditional novelty 7.0 of 10

    The paper presents windowed decoding protocols that restore modularity and locality to decoding of fast transversal logic, enabling constant-time logical gates with scalable error correction.

  4. Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload

    quant-ph 2025-09 conditional novelty 2.0 of 10

    A NERSC analysis finds that more than 50% of its workload could ultimately benefit from quantum computing and that vendor roadmaps and quantum application requirements are projected to overlap in the next 5 to 10 years.

Pith tools