Clifford+T-based implementation of fault-tolerant quantum circuits over XOR-Majority Graph
Introduction
In recent times, quantum computing (QC) is the single biggest breakthrough with great promise to overcome limitations that inherent to classical computers [1], [2], [3]. One of the major challenges towards the implementation of a scalable quantum computer is the presence of external noise, which affects the reliability of the quantum gate operations. To deal with the issue, the fault-tolerant quantum computation with a low execution time is desirable. Fundamentally, the property of fault-tolerance can be achieved by encoding a physical qubit into a logical qubit by using quantum error-correcting code (QECC). In this regard, Surface code is the most promising one and has the highest threshold value i.e. 0.75% per gate [4]. Further, to protect the efficacy of QECC, the error rate should below the threshold limit, and needs transversal operators so as to restrain the diffusion of error within the QECC blocks. Fundamentally CNOT-gate, and all single-qubit primitive quantum gates are default transversal operators [5]. In fact, no such quantum-error correcting code is available which can transversely implement a universal gate set [6]. Currently, the Clifford+-group is used extensively at a logical level to design fault-tolerant quantum circuit [7], [8], [9]. And more fundamentals on Clifford+-group is presented in Section 2.
A quantum computer processes the information based on the laws of quantum mechanics in subatomic level. In fact, quantum evolution is unitary in nature which mandates logical reversibility of quantum logic. And for that the reversible logic plays a pivotal role as an intermediary stage while mapping a Boolean logic into quantum logic wherein Multi Controlled Toffoli (MCT) gate provides universality in reversible logic [10], [11], [12]. The quality of mapping from Boolean logic to quantum logic is crucially dependent on the adopted intermediate structure for logic representation. On the quest for a suitable Boolean data structure for a large function, the newly introduced XOR-Majority Graph (XMG) that proposed by Chu et al. [13] could be promising as an intermediary data-structure for the quantum circuit synthesis against the present-state-of-the-approaches [14], [15], due to depth optimization of the synthesis and reduction of node complexity. And, has potential to convert a ripple-carry adder into carry look-ahead adder efficaciously. Therefore, the mapping of XMG data-structure into Clifford+-based circuit by adhering to the optimization of -gate and -cycle could be a suitable approach for the robust fault-tolerant quantum circuit realization of any Boolean function.
Recently, Bandyopadhyay et al. proposed synthesis of improved reversible circuits using AIG- and MIG-based data structures, and evaluated , of equivalent fault-tolerant quantum circuit [16]. In this mapping, the authors studied a comparative analysis over BDD, AIG, MIG, and XMG data structure by means of mapping node-wise functionality into Clifford+-based structure. Other graph-based quantum circuit synthesis approaches are presented in [15], [17].
A new question crop-up that can the node of XMG, and existing AIG, MIG be implemented by using fault-tolerant templates with low cost (, ) in comparing to present-state-of-the-approaches and same can be used in the post-synthesis mapping of XMG towards the realization of the efficient fault-tolerant circuit? From this motivation, we have proposed a template matching scheme for the mapping of XMG data structure [13] into the quantum circuits and also optimized the cost parameter associated with fault-tolerant quantum circuits synthesis.
Here, the key contributions are highlighted as below:
- •
A robust Low-cost Clifford+-based fault-tolerant templates are proposed against node of the XMG data-structure.
- •
We propose unit -depth-based fault-tolerant templates to contain the effect of Decoherence using four ancillary input(s) by reducing .
- •
We have simulated quantum of XMG-based benchmark function over both kinds of the proposed template(s) and compared the results with present-state-of-the-arts approaches w.r.t. and .
The remainder of this paper is organized as follows: Section 2 provides a detailed background for better apprehension of this paper. In Section 3, our proposed approach is explained. Experimental result and comparative analysis are presented in Section 4 and the work is completed in Section 5.
Section snippets
Background
Here, we discuss some basic fundamentals relating to graph-based Boolean algebra and term, terminologies associated with reversible/quantum logic circuit.
Proposed technique
In this section, we have proposed Clifford+-based fault-tolerant templates to represent the node functionality of XMG. Then, we apply proposed templates into the XMG data structure using a template matching scheme, in which each node of the XMG replaced by its equivalent templates to find an efficient fault-tolerant quantum circuit for any arbitrary Boolean functions.
Experimental result and analysis
The proposed synthesis approach has been implemented in C++ using XMG and a template-matching scheme (Algorithm 1). Then our proposed synthesis approach is applied over the quantum of benchmark function, and the subsequent results are documented in Table 2, Table 3 separately as design-1 and design-2 based on two above-defined template library and respectively.
In Table 2, the results have been compared with present-state-of-the-arts [16] over MIG-based fault-tolerant quantum circuit. In
Conclusion
In this paper, we have proposed one template-based mapping approach over XMG in order to achieve fault-tolerant quantum computation. The experimental results validate the very propose of this approach as it reduces the , cost which is desirable for high scalable fault-tolerant quantum computation. Moreover, our design approach is based on matrix identities over Hilbert space () which does not violate principle of no-cloning theorem [28].
Literally, quantum states are highly
CRediT authorship contribution statement
Laxmidhar Biswal: Conceptualization, Methodology, Software, Investigation, Visualization, Writing- Original draft preparation. Habibur Rahaman: Software, Validation, Formal analysis, Data curation, Writing - review & editing. Niladri Pratap Maity: Writing - review & editing, Supervision.
Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
References (28)
Quantum mechanics helps in searching for a needle in a haystack
Phys. Rev. Lett.
(1997)Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
SIAM Rev.
(1999)Quantum mechanical computers
Found. Phys.
(1986)- et al.
Surface codes: Towards practical large-scale quantum computation
Phys. Rev. A
(2012) An introduction to quantum error correction and fault-tolerant quantum computation
(2009)- et al.
Restrictions on transversal encoded quantum gate sets
Phys. Rev. Lett.
(2009) - et al.
Nearest-neighbor and fault-tolerant quantum circuit implementation
- et al.
Efficient implementation of fault-tolerant 4:1 quantum multiplexer (QMUX) using Clifford+T-group
- et al.
Quantum Computation and Quantum Information: 10th Anniversary Edition
(2011) - et al.
A post-synthesis optimization technique for reversible circuits exploiting negative control lines
IEEE Trans. Comput.
(2015)