Optimization of the Solovay-Kitaev algorithm

Tien Trung Pham, Rodney D Van Meter, Clare Horsman

Research output: Contribution to journalArticle

14 Citations (Scopus)

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. This technique is combined with an efficient space search method called geometric nearest-neighbor access trees, modified for the unitary matrix lookup problem, in order to reduce significantly the algorithm run time. We show that, with low time cost, our techniques output gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefore reduces the error correction requirements for quantum algorithms on encoded fault-tolerant hardware.

Original languageEnglish
Article number052332
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume87
Issue number5
DOIs
Publication statusPublished - 2013 May 30

Fingerprint

optimization
quantum computation
hardware
costs
requirements
expansion
output

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Optimization of the Solovay-Kitaev algorithm. / Pham, Tien Trung; Van Meter, Rodney D; Horsman, Clare.

In: Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 87, No. 5, 052332, 30.05.2013.

Research output: Contribution to journalArticle

@article{399165fdfc77472a9351c3c737c9125f,
title = "Optimization of the Solovay-Kitaev algorithm",
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. This technique is combined with an efficient space search method called geometric nearest-neighbor access trees, modified for the unitary matrix lookup problem, in order to reduce significantly the algorithm run time. We show that, with low time cost, our techniques output gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefore reduces the error correction requirements for quantum algorithms on encoded fault-tolerant hardware.",
author = "Pham, {Tien Trung} and {Van Meter}, {Rodney D} and Clare Horsman",
year = "2013",
month = "5",
day = "30",
doi = "10.1103/PhysRevA.87.052332",
language = "English",
volume = "87",
journal = "Physical Review A",
issn = "2469-9926",
publisher = "American Physical Society",
number = "5",

}

TY - JOUR

T1 - Optimization of the Solovay-Kitaev algorithm

AU - Pham, Tien Trung

AU - Van Meter, Rodney D

AU - Horsman, Clare

PY - 2013/5/30

Y1 - 2013/5/30

N2 - 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. This technique is combined with an efficient space search method called geometric nearest-neighbor access trees, modified for the unitary matrix lookup problem, in order to reduce significantly the algorithm run time. We show that, with low time cost, our techniques output gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefore reduces the error correction requirements for quantum algorithms on encoded fault-tolerant hardware.

AB - 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. This technique is combined with an efficient space search method called geometric nearest-neighbor access trees, modified for the unitary matrix lookup problem, in order to reduce significantly the algorithm run time. We show that, with low time cost, our techniques output gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefore reduces the error correction requirements for quantum algorithms on encoded fault-tolerant hardware.

UR - http://www.scopus.com/inward/record.url?scp=84878481060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878481060&partnerID=8YFLogxK

U2 - 10.1103/PhysRevA.87.052332

DO - 10.1103/PhysRevA.87.052332

M3 - Article

AN - SCOPUS:84878481060

VL - 87

JO - Physical Review A

JF - Physical Review A

SN - 2469-9926

IS - 5

M1 - 052332

ER -