pith. sign in

arxiv: 1610.03309 · v2 · pith:VZQWQS2Pnew · submitted 2016-10-11 · 🪐 quant-ph

A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation

classification 🪐 quant-ph
keywords codeapproachesquantumapproachcomputationconcatenationgatesproposed
0
0 comments X
read the original abstract

As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state distillation, code switching, code concatenation and pieceable fault-tolerance are well-known examples of such approaches. However, the overhead of these approaches is one of the main bottlenecks for large-scale quantum computation. In this paper, a hybrid approach is proposed which combines the code concatenation technique with the other mentioned approaches. The proposed approach outperforms code concatenation in terms of both number of qubits and error threshold and also significantly reduces the resource overhead of code switching, magic state distillation and pieceable fault-tolerance at the cost of reducing the effective distance of the concatenated code for implementing non-transversal gates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes

    quant-ph 2024-11 conditional novelty 7.0

    A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reducti...