Quantum computation and quantum information
Quantum computation and quantum information
Classical and Quantum Computation
Classical and Quantum Computation
Quantum accuracy threshold for concatenated distance-3 codes
Quantum Information & Computation
Quantum Information & Computation
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Quantum Information & Computation
Architecture of a Quantum Multicomputer Implementing Shor's Algorithm
Theory of Quantum Computation, Communication, and Cryptography
Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers
Proceedings of the 40th Annual International Symposium on Computer Architecture
A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth
Quantum Information & Computation
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
Quantum Information & Computation
| Hi-index | 0.00 |
We present a simple method for constructing optimal fault-tolerant approximations of arbitrary unitary gates using an arbitrary discrete universal gate set. The method presented is numerical and scales exponentially with the number of gates used in the approximation. However, for the specific case of arbitrary single-qubit gates and the fault-tolerant gates permitted by the concatenated 7-qubit Steane code, we find gate sequences sufficiently long and accurate to permit the fault-tolerant factoring of numbers thousands of bits long. A general scaling law of how rapidly these fault-tolerant approximations converge to arbitrary single-qubit gates is also determined.