Time-optimal quantum computation

2012/10/17 by Austin G. Fowler, Fowler, Austin G. · 6 citations
Computer Science · Engineering · Physics and Astronomy · #Advancements in Semiconductor Devices and Circuit Design #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.1210.4626

5 pages, 8 figures, manuscript now describes how to achieve time-optimal quantum computation in any QEC code supporting fault-tolerant universal quantum computation that also permits transversal logical X and Z measurement

openalex publication_date 2012/10/17 · arxiv created 2013/02/02 · arxiv updated 2013/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an arbitrary Clifford circuit followed by a layer of independent T gates and any necessary feedforward measurement determined corrective S gates all in the time of a single physical measurement. We assume fast classical processing and classical communication, and argue the reasonableness of this assumption. This enables fault-tolerant quantum computation to be performed orders of magnitude faster than previously thought possible, with the execution time independent of the error correction strength.

Cited by

• Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
• Flexible layout of surface code computations using AutoCCZ states
• Scalable decoding protocols for fast transversal logic in the surface code
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Faster manipulation of large quantum circuits using wire label reference diagrams
• Universal quantum computing with twist-free and temporally encoded lattice surgery

Related

• Resource-compact time-optimal quantum computation
• Fault-tolerant quantum computation
• Benchmarking the ability of a controller to execute quantum error corrected non-Clifford circuits
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Resource optimization for fault-tolerant quantum computing