Quellcode für qiskit.synthesis.cnotdihedral.cnotdihedral_decompose_full

# This code is part of Qiskit.
# (C) Copyright IBM 2019, 2022.
# This code is licensed under the Apache License, Version 2.0. You may
# obtain a copy of this license in the LICENSE.txt file in the root directory
# of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.
# Any modifications or derivative works of this code must retain this
# copyright notice, and modified files need to carry a notice indicating
# that they have been altered from the originals.
Circuit synthesis for the CNOTDihedral class for all-to-all connectivity.

from qiskit.synthesis.cnotdihedral.cnotdihedral_decompose_two_qubits import (
from qiskit.synthesis.cnotdihedral.cnotdihedral_decompose_general import synth_cnotdihedral_general

[Doku]def synth_cnotdihedral_full(elem): """Decompose a CNOTDihedral element into a QuantumCircuit. For N <= 2 qubits this is based on optimal CX cost decomposition from reference [1]. For N > 2 qubits this is done using the general non-optimal compilation routine from reference [2]. Args: elem (CNOTDihedral): a CNOTDihedral element. Return: QuantumCircuit: a circuit implementation of the CNOTDihedral element. References: 1. Shelly Garion and Andrew W. Cross, *Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates*, `Quantum 4(369), 2020 <https://quantum-journal.org/papers/q-2020-12-07-369/>`_ 2. Andrew W. Cross, Easwar Magesan, Lev S. Bishop, John A. Smolin and Jay M. Gambetta, *Scalable randomised benchmarking of non-Clifford gates*, npj Quantum Inf 2, 16012 (2016). """ num_qubits = elem.num_qubits if num_qubits < 3: return synth_cnotdihedral_two_qubits(elem) return synth_cnotdihedral_general(elem)