Decomposition of Diagonal Hermitian Quantum Gates Using Multiple-Controlled Pauli Z Gates

Houshmand, Mahboobeh; Zamani, Morteza Saheb; Sedighi, Mehdi; Arabzadeh, Mona

doi:10.1145/2629526

Cited by 11 publications

(9 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We initially start with a QC and assume that this circuit has only one, two, and threequbit quantum gates. The arbitrary n-qubit quantum gates can also be decomposed into the basic gate libraries [43,44]. Consequently, our method can be applied to all types of QCs.…”

Section: Proposed Approachmentioning

confidence: 99%

Improving the Teleportation Cost in Distributed Quantum Circuits Based on Commuting of Gates

2021

View full text Add to dashboard Cite

Distributed quantum system is a well-known method to overcome the problems of designing and manufacturing large quantum systems to achieve higher processing power in the world of quantum processing. In distributed quantum computing, a number of limited-capacity quantum circuits communicating with each other through communication channels operate as a large quantum circuit. The most essential step in designing a distributed quantum system is to optimize the communication between the components to reduce the overhead cost of communications. In this study, based on the commuting of quantum gates, an efficient method is proposed to reduce the number of teleportations required to perform distributed quantum circuits (DQCs). The results obtained from the evaluation of our method on benchmark circuits indicate an impressive decrease in the number of teleportations and a significant reduction in the execution time compared to the present methods.

show abstract

Section: Proposed Approachmentioning

confidence: 99%

Improving the Teleportation Cost in Distributed Quantum Circuits Based on Commuting of Gates

2021

View full text Add to dashboard Cite

show abstract

“…We intend to start with a quantum circuit QC, composed of basic gate library [21], i.e., CNOT and single-qubit gates, already split into two partitions. It is already known [18,21,41] that arbitrary n-qubit quantum gates can be decomposed to the basic gate library. We define two types of CNOT gates, namely, local and global gates.…”

Section: Problem Definitionmentioning

confidence: 99%

“…The adjacent gates which act on independent subsets of qubits can be applied in parallel and their overall net effect is computed by their tensor product. To realize arbitrary quantum gates, they are decomposed to a set of physically implementable gates by quantum technologies (typically CNOT and single-qubit gates, called"basic gate" library [16]), which is called quantum logic synthesis [17,18,19,20,21,22].…”

Section: Introductionmentioning

confidence: 99%

An Evolutionary Approach to Optimizing Teleportation Cost in Distributed Quantum Computation

et al. 2020

Self Cite

View full text Add to dashboard Cite

Distributed quantum computing has been well-known for many years as a system composed of a number of small-capacity quantum circuits. Limitations in the capacity of monolithic quantum computing systems can be overcome by using distributed quantum systems which communicate with each other through known communication links. In our previous study, an algorithm with an exponential complexity was proposed to optimize the number of qubit teleportations required for the communications between two partitions of a distributed quantum circuit. In this work, a genetic algorithm is used to solve the optimization problem in a more efficient way. The results are compared with the previous study and we show that our approach works almost the same with a remarkable speed-up. Moreover, the comparison of the proposed approach based on GA with a random search over the search space verifies the effectiveness of GA.

show abstract

“…The produced diagonal matrix D n in (8) can be synthesized either by previous general synthesis methods for quantum diagonal matrices such as or by specific methods for Hermitian diagonal matrices as the one presented in [Houshmand et al 2014]. Figure 2 shows the synthesis of an arbitrary diagonal matrix ∆ 3 for n = 3 qubits.…”

Section: Quantum-equivalence Of the Diagonal Matrixmentioning

confidence: 99%

Quantum-Logic Synthesis of Hermitian Gates

Arabzadeh

Houshmand

Sedighi

et al. 2015

J. Emerg. Technol. Comput. Syst.

Self Cite

View full text Add to dashboard Cite

In this paper, the problem of synthesizing a general Hermitian quantum gate into a set of primary quantum gates is addressed. To this end, an extended version of the Jacobi approach for calculating the eigenvalues of Hermitian matrices in linear algebra is considered as the basis of the proposed synthesis method. The quantum circuit synthesis method derived from the Jacobi approach and its optimization challenges are described. It is shown that the proposed method results in multiple-control rotation gates around the y axis, multiple-control phase shift gates, multiple-control NOT gates and a middle diagonal Hermitian matrix, which can be synthesized to multiple-control Pauli Z gates. Using the proposed approach, it is shown how multiple-control U gates, where U is a single-qubit Hermitian quantum gate, can be implemented using a linear number of elementary gates in terms of circuit lines with the aid of one auxiliary qubit in an arbitrary state.

show abstract

Decomposition of Diagonal Hermitian Quantum Gates Using Multiple-Controlled Pauli Z Gates

Cited by 11 publications

References 26 publications

Improving the Teleportation Cost in Distributed Quantum Circuits Based on Commuting of Gates

Improving the Teleportation Cost in Distributed Quantum Circuits Based on Commuting of Gates

An Evolutionary Approach to Optimizing Teleportation Cost in Distributed Quantum Computation

Quantum-Logic Synthesis of Hermitian Gates

Contact Info

Product

Resources

About