Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits

Cheng, Xueyun; Guan, Zhiwei; Ding, Weiping

doi:10.1007/s11128-018-1908-8

Cited by 10 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a quantum logic circuit, to exchange the logic values of certain two circuits, it can generally be realized by inserting a SWAP-gate. The SWAP-gate also needs to satisfy the linear nearest neighbor in the nearest neighbor constrained quantum circuit, it is called the nearest neighbor SWAP gate (NNS gate) [7]. An NNS gate is equivalent to three cascades of CNOT gates that satisfy the linear nearest neighbor architecture, as shown in Figure 8(a).…”

Section: Some Constraints On Quantum Circuitsmentioning

confidence: 99%

“…In recent years, the Clifford + T gates [4] [5] [6] have been used in some typical quantum circuits. Due to the importance of fault tolerance in quantum computing [7] [8], and the fault-tolerant implementation cost of T gates may exceed the implementation cost of Clifford Gate by 100 times or more [4]. Therefore, minimizing the number of T gates is critical to optimizing the T depth of a quantum circuit.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Mapping and Optimization Method of Quantum Circuits for Clifford + T Gate

He¹,

Guan²,

Ding³

2019

JAMP

Self Cite

View full text Add to dashboard Cite

In order to solve the fault tolerance and reliability problems of quantum circuit, a series of structural equivalence rules and optimization operation strategies of quantum circuit are proposed to minimize the number of T gates, increase T gate depth, minimize circuit level, reduce fault tolerance implementation costs and increase circuit reliability. In order to satisfy the nearest neighbor constraints of some quantum systems, a LNN (linear nearest neighbor) arrangement algorithm based on Clifford + T gate quantum circuit is presented. Experiments are done on some benchmarks of RevLib, the results show that the optimization rate of most functions and the running time of the algorithm are better than those of the existing literature.

show abstract

Section: Some Constraints On Quantum Circuitsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

The Mapping and Optimization Method of Quantum Circuits for Clifford + T Gate

He¹,

Guan²,

Ding³

2019

JAMP

Self Cite

View full text Add to dashboard Cite

show abstract

“…With the recent development in quantum hardware, several researchers have proposed topology-aware decompositions [7,22] that minimize the gate cost when mapping to a target hardware topology. Toffoli gate is one of the most commonly used three-qubit gates in quantum information processing.…”

Section: Introductionmentioning

confidence: 99%

QContext: Context-Aware Decomposition for Quantum Gates

Liu¹,

Bowman²,

Gokhale³

et al. 2023

Preprint

View full text Add to dashboard Cite

In this paper we propose QContext, a new compiler structure that incorporates context-aware and topology-aware decompositions. Because of circuit equivalence rules and resynthesis, variants of a gatedecomposition template may exist. QContext exploits the circuit information and the hardware topology to select the gate variant that increases circuit optimization opportunities. We study the basis-gate-level context-aware decomposition for Toffoli gates and the native-gate-level context-aware decomposition for CNOT gates. Our experiments show that QContext reduces the number of gates as compared with the state-of-the-art approach, Orchestrated Trios [13].

show abstract