Synthesis of quantum circuits is essential for building quantum computers. It is important to verify that the circuits designed perform the correct functions. In this paper, we propose an algorithm which can be used to verify the quantum circuits synthesized by any method. The proposed algorithm is based on BDD (Binary Decision Diagram) and is called X-decomposition Quantum Decision Diagram (XQDD). In this method, quantum operations are modeled using a graphic method and the verification process is based on comparing these graphic diagrams. We also develop an algorithm to verify reversible circuits even if they have a different number of garbage qubits. In most cases, the number of nodes used in XQDD is less than that in other representations. In general, the proposed method is more efficient in terms of space and time and can be used to verify many quantum circuits in polynomial time.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shiou-An WANG, Chin-Yung LU, I-Ming TSAI, Sy-Yen KUO, "An XQDD-Based Verification Method for Quantum Circuits" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 2, pp. 584-594, February 2008, doi: 10.1093/ietfec/e91-a.2.584.
Abstract: Synthesis of quantum circuits is essential for building quantum computers. It is important to verify that the circuits designed perform the correct functions. In this paper, we propose an algorithm which can be used to verify the quantum circuits synthesized by any method. The proposed algorithm is based on BDD (Binary Decision Diagram) and is called X-decomposition Quantum Decision Diagram (XQDD). In this method, quantum operations are modeled using a graphic method and the verification process is based on comparing these graphic diagrams. We also develop an algorithm to verify reversible circuits even if they have a different number of garbage qubits. In most cases, the number of nodes used in XQDD is less than that in other representations. In general, the proposed method is more efficient in terms of space and time and can be used to verify many quantum circuits in polynomial time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.2.584/_p
Copy
@ARTICLE{e91-a_2_584,
author={Shiou-An WANG, Chin-Yung LU, I-Ming TSAI, Sy-Yen KUO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An XQDD-Based Verification Method for Quantum Circuits},
year={2008},
volume={E91-A},
number={2},
pages={584-594},
abstract={Synthesis of quantum circuits is essential for building quantum computers. It is important to verify that the circuits designed perform the correct functions. In this paper, we propose an algorithm which can be used to verify the quantum circuits synthesized by any method. The proposed algorithm is based on BDD (Binary Decision Diagram) and is called X-decomposition Quantum Decision Diagram (XQDD). In this method, quantum operations are modeled using a graphic method and the verification process is based on comparing these graphic diagrams. We also develop an algorithm to verify reversible circuits even if they have a different number of garbage qubits. In most cases, the number of nodes used in XQDD is less than that in other representations. In general, the proposed method is more efficient in terms of space and time and can be used to verify many quantum circuits in polynomial time.},
keywords={},
doi={10.1093/ietfec/e91-a.2.584},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - An XQDD-Based Verification Method for Quantum Circuits
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 584
EP - 594
AU - Shiou-An WANG
AU - Chin-Yung LU
AU - I-Ming TSAI
AU - Sy-Yen KUO
PY - 2008
DO - 10.1093/ietfec/e91-a.2.584
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2008
AB - Synthesis of quantum circuits is essential for building quantum computers. It is important to verify that the circuits designed perform the correct functions. In this paper, we propose an algorithm which can be used to verify the quantum circuits synthesized by any method. The proposed algorithm is based on BDD (Binary Decision Diagram) and is called X-decomposition Quantum Decision Diagram (XQDD). In this method, quantum operations are modeled using a graphic method and the verification process is based on comparing these graphic diagrams. We also develop an algorithm to verify reversible circuits even if they have a different number of garbage qubits. In most cases, the number of nodes used in XQDD is less than that in other representations. In general, the proposed method is more efficient in terms of space and time and can be used to verify many quantum circuits in polynomial time.
ER -