Circuit Synthesis (qiskit.synthesis
)¶
Evolution Synthesis¶
Interface for evolution synthesis algorithms. 


Product formula base class for the decomposition of noncommuting operator exponentials. 

The LieTrotter product formula. 

The (higher order) SuzukiTrotter product formula. 
Exact operator evolution via matrix exponentiation and unitary synthesis. 


The QDrift Trotterization method, which selects each each term in the Trotterization randomly, with a probability proportional to its weight. 
Linear Function Synthesis¶

Synthesize linear reversible circuits for alltoall architecture using Patel, Markov and Hayes method. 
Synthesize linear reversible circuit for linear nearestneighbor architectures using Kutin, Moulton, Smithline method. 
Permutation Synthesis¶

Synthesize a permutation circuit for a linear nearestneighbor architecture using the Kutin, Moulton, Smithline method. 

Synthesize a permutation circuit for a fullyconnected architecture using sorting. 

Synthesize a permutation circuit for a fullyconnected architecture using the Alon, Chung, Graham method. 
Clifford Synthesis¶

Decompose a Clifford operator into a QuantumCircuit. 

Decompose a Clifford operator into a QuantumCircuit based on AaronsonGottesman method. 

Optimal CXcost decomposition of a Clifford operator on 2qubits or 3qubits into a QuantumCircuit based on BravyiMaslov method. 

Decompose a Clifford operator into a QuantumCircuit based on the greedy Clifford compiler that is described in Appendix A of Bravyi, Hu, Maslov and Shaydulin. 

Synthesis of a Clifford into layers, it provides a similar decomposition to the synthesis described in Lemma 8 of [1]. 
CNOTDihedral Synthesis¶

Decompose a CNOTDihedral element into a QuantumCircuit. 
Decompose a CNOTDihedral element on a single qubit and two qubits into a QuantumCircuit. 

Decompose a CNOTDihedral element into a QuantumCircuit. 
Discrete Basis Synthesis¶

The Solovay Kitaev discrete decomposition algorithm. 

Generates a list of 