DocumentCode :
52599
Title :
FTQLS: Fault-Tolerant Quantum Logic Synthesis
Author :
Chia-Chun Lin ; Chakrabarti, Anandaroop ; Jha, Niraj K.
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA
Volume :
22
Issue :
6
fYear :
2014
fDate :
Jun-14
Firstpage :
1350
Lastpage :
1363
Abstract :
Quantum computation can solve certain problems much faster than classical computation. However, quantum computations are more susceptible to errors than conventional digital computations. Thus, a fault-tolerant (FT) quantum circuit design is required for a practical implementation. Quantum circuits consist of a cascade of quantum gates. These gates are themselves realized using primitive quantum operations that are supported by the quantum physical machine description (PMD). As different quantum systems are associated with different Hamiltonians, they have different PMDs. In addition, the quantum cost for implementing a quantum operation may differ from one PMD to another. Thus, a quantum logic circuit needs to be realized with and optimized for the set of primitive quantum operations supported by the given PMD. In this paper, an FT quantum logic synthesis (FTQLS) methodology and tool is described for six different PMDs. A methodology, such as this, which can be targeted at multiple PMDs, has not been attempted before, to the best of our knowledge. The input to FTQLS is an unoptimized quantum circuit realized using a set of commonly used gates and its output is an optimized FT quantum circuit that only comprises of primitive quantum operations supported by the given PMD. FTQLS does technology mapping for different PMDs and then converts non-FT circuits to FT circuits. For technology mapping, it utilizes an optimized quantum gate library targeted at various PMDs that decomposes gates into primitive operations. Efficient conversion to FT circuits is done by integrating two quantum compilers and an FT cache table into FTQLS. For improving the synthesis results, an FT set of gates that is directly supported by each PMD is proposed. Quantum circuit optimization is done by utilizing quantum identity rules. The performance of FTQLS is evaluated using two cost metrics: number of primitive operations (#ops) and execution cycles on the critical path (#cycles). Experiment res- lts show that the decrease in #ops varies between 58.1% and 87.0% and in #cycles between 42.8% and 76.4%, on an average, depending on the PMD.
Keywords :
circuit optimisation; fault tolerance; logic circuits; logic design; quantum gates; FT cache table; FTQLS; FTQLS methodology; PMD; cost metrics; critical path; digital computations; execution cycles; fault-tolerant quantum circuit design; fault-tolerant quantum logic circuit synthesis; nonFT circuits; optimized quantum gate library; primitive quantum operations; quantum circuit optimization; quantum compilers; quantum computation; quantum cost; quantum gates; quantum identity rules; quantum physical machine description; quantum systems; technology mapping; Circuit optimization; Fault tolerance; Fault tolerant systems; Libraries; Logic gates; Quantum computing; Quantum dots; Fault-tolerant circuit; physical machine description; quantum compilation; quantum computing; quantum logic synthesis; quantum logic synthesis.;
fLanguage :
English
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1063-8210
Type :
jour
DOI :
10.1109/TVLSI.2013.2269869
Filename :
6565421
Link To Document :
بازگشت