{"ID":23577920,"CreatedAt":"2026-09-18T05:07:30.921092366Z","UpdatedAt":"2026-09-18T05:07:30.921092366Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2609.20549","arxiv_id":"2609.20549","title":"Scalable logical qubits","abstract":"Utility-scale quantum computing will require executing long, complex algorithms with end-to-end error rates far below what physical qubits can support directly. Error-corrected logical qubits are needed to achieve this goal. To make the progress on logical qubits measurable and comparable we introduce the definition of scalable logical qubits: logical qubits preserved for long computations by repeated quantum error correction, capable of fault-tolerant universal operations with low-latency real-time decoding and feedback, and replicable to the hundreds or thousands, as required by applications. We characterize these scalable logical qubits along four coupled dimensions: reliability, scale, capability, and performance, and discuss trade-offs among these dimensions.","short_abstract":"Utility-scale quantum computing will require executing long, complex algorithms with end-to-end error rates far below what physical qubits can support directly. Error-corrected logical qubits are needed to achieve this goal. To make the progress on logical qubits measurable and comparable we introduce the definition of...","url_abs":"https://arxiv.org/abs/2609.20549","url_pdf":"https://arxiv.org/pdf/2609.20549v1","authors":"[\"Matthias Troyer\",\"Chetan Nayak\",\"John Martinis\"]","published":"2026-09-17T15:15:13Z","proceeding":"quant-ph","tasks":"[\"quant-ph\"]","methods":"[]","has_code":false}