Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state distillation, code switching or code concatenation in order to achieve universality. In this paper we propose an alternative approach for universal fault-tolerant quantum computing mainly based on the code concatenation approach proposed in [PRL 112, 010505 (2014)] but in a non-uniform fashion. The proposed approach is described based on non-uniform concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code as well as the 5-qubit code with the 15-qubit Reed-Muller code, which lead to two 49-qubit and 47-qubit codes, respectively. These codes can correct any arbitrary single physical error with the ability to perform a universal set of fault-tolerant gates, without using magic state distillation.

Developing a scalable quantum computer as a single processing unit is challenging due to technology limitations. A solution to deal with this challenge is distributed quantum computing where several distant quantum processing units are used to perform the computation. The main design issue of this approach is costly communication between the processing units. Focused on this issue, in this paper, an efficient partitioning approach is proposed which combines both gate and qubit teleportation concepts in an efficient manner to minimize the communication. Experimental results show the proposed approach on average reduces the communication cost by about 29.5% in comparison with the best approaches in the literature.

No abstract

Abstract-In one-way quantum computation (1WQC) model

No abstract