REVIEW 10 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
Signed reviews
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.
Forward citations
Cited by 10 Pith papers
-
Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
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.
-
Trace-Based Reconstruction of Quantum Circuit Dataflow in Surface Codes
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...
-
Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer
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.
-
Scalable decoding protocols for fast transversal logic in the surface code
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.
-
Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network
A peer-to-peer protocol, P2PGSD, distributes arbitrary graph states over quantum networks, with hardness proofs and simulations showing up to 50% resource savings for sparse graphs.
-
The Magic Scroll: Leveraging biased noise to improve magic state cultivation in register-based architectures
The Magic Scroll protocol uses biased noise and two-qubit registers to reduce the cost of producing high-fidelity magic T states by about 3x, reaching error rates near 1e-15 when combined with distillation.
-
Resource-efficient linear-optical generation of GHZ-like states
Variable-entanglement intermediate states and a tunable non-exhaustive bleeding protocol reduce the average photon cost of generating GHZ and GHZ-like photonic states, e.g., from 10240 to 5287.6 photons for the 10-qub...
-
Improved T counts and active volume estimates for high-level arithmetic subroutines
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.
-
Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes
A recurrent transformer decoder trained on circuit-level noise beats BP-OSD on the [[72,12,6]] bivariate bicycle code in logical error rate and runtime consistency, but falls behind on the [[144,12,12]] code.
-
Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload
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.
Discussion (0). Continue with ORCID to comment.