Optimising the Solovay-Kitaev algorithm
arXiv:1209.4139 · doi:10.1103/PhysRevA.87.052332
Abstract
The Solovay-Kitaev algorithm is the standard method used for approximating arbitrary single-qubit gates for fault-tolerant quantum computation. In this paper we introduce a technique called "search space expansion", which modifies the initial stage of the Solovay-Kitaev algorithm, increasing the length of the possible approximating sequences but without requiring an exhaustive search over all possible sequences. We show that our technique, combined with a GNAT geometric tree search outputs gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefore significantly reduces the error correction requirements for quantum algorithms on encoded fault-tolerant hardware.
arXiv comment9 pages
References in corpus (7)
- Elementary gates for quantum computation
- Reliable Quantum Computers
- Fault-tolerant quantum computation with high threshold in two dimensions
- Quantum Error Correction for Beginners
- Fault-Tolerant Error Correction with Efficient Quantum Codes
- Efficient Discrete Approximations of Quantum Gates
- A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
Cited by in corpus (19)
- Quantum-assisted quantum compiling
- Topological Quantum Compiling with Reinforcement Learning
- Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
- Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels
- Shorter gate sequences for quantum computing by mixing unitaries
- Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
- Fibonacci anyons versus Majorana fermions
- Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
- Quantum compiling with diffusive sets of gates
- Quantum Error Correction Implementation after Multiple Gates
- Quantum Error Correction During 50 Gates
- Cost-optimal single-qubit gate synthesis in the Clifford hierarchy
- Pseudo-Random Circuits from Clifford Plus T-Gates
- Weighted Quantum Channel Compiling through Proximal Policy Optimization
- A Novel Single-Layer Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis
- Compiling universal quantum circuits
- Quantum Signal Processing and Quantum Singular Value Transformation on
- Approximate quantum gates compiling with self-navigation algorithm