The first two authors contributed equally to this work. In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains l qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over l qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of l affects the number of one-qubit and CNOT gates in the proposed method. In comparison to the previous synthesis methods, the value of l is exam...
Abstract—This paper proposes an approach to optimally synthesize quantum circuits by symbolic reacha...
We show how to implement an arbitrary two-qubit uni-tary operation using any of several quantum gate...
International audienceWe study the problem of finding the best approximate circuit that is the close...
Quantum-circuit optimization is essential for any practical realization of quantum computation. We p...
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circui...
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circui...
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quant...
Since Controlled-Square-Root-of-NOT (CV, CV‡) gates are not permutative quantum gates, many existing...
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses t...
Quantum information processing technology is in its pioneering stage and no proficient method for sy...
Quantum computation has attracted much attention, among other things, due to its potentialities to s...
Quantum information processing technology is in its pioneering stage and no proficient method for sy...
Quantum circuits currently constitute a dominant model for quantum computation [14]. Our work addres...
Diagonal unitary operators are commonly found in many quantum algorithms. They find application as a...
Quantum circuit synthesis is one of the major areas of current research in the field of quantum comp...
Abstract—This paper proposes an approach to optimally synthesize quantum circuits by symbolic reacha...
We show how to implement an arbitrary two-qubit uni-tary operation using any of several quantum gate...
International audienceWe study the problem of finding the best approximate circuit that is the close...
Quantum-circuit optimization is essential for any practical realization of quantum computation. We p...
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circui...
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circui...
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quant...
Since Controlled-Square-Root-of-NOT (CV, CV‡) gates are not permutative quantum gates, many existing...
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses t...
Quantum information processing technology is in its pioneering stage and no proficient method for sy...
Quantum computation has attracted much attention, among other things, due to its potentialities to s...
Quantum information processing technology is in its pioneering stage and no proficient method for sy...
Quantum circuits currently constitute a dominant model for quantum computation [14]. Our work addres...
Diagonal unitary operators are commonly found in many quantum algorithms. They find application as a...
Quantum circuit synthesis is one of the major areas of current research in the field of quantum comp...
Abstract—This paper proposes an approach to optimally synthesize quantum circuits by symbolic reacha...
We show how to implement an arbitrary two-qubit uni-tary operation using any of several quantum gate...
International audienceWe study the problem of finding the best approximate circuit that is the close...