Time-optimal quantum computation
arXiv:1210.4626
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.
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
Cited by in corpus (22)
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Local and Distributed Quantum Computation
- Performing Quantum Computing Experiments in the Cloud
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Surface code implementation of block code state distillation
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Optimized Surface Code Communication in Superconducting Quantum Computers
- The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
- T-count and T-depth of any multi-qubit unitary
- Synthesis of Arbitrary Quantum Circuits to Topological Assembly
- Quantum circuit optimization by topological compaction in the surface code
- Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
- A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
- Instantaneous braids and Dehn twists in topologically ordered states
- A Regular Representation of Quantum Circuits
- Digital feedback in superconducting quantum circuits
- Flexible layout of surface code computations using AutoCCZ states
- Resource optimization for fault-tolerant quantum computing
- Approximate encoded permutations and piecewise quantum adders
- Quantum block lookahead adders and the wait for magic states
- Faster manipulation of large quantum circuits using wire label reference diagrams
- Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits