SynthesisΒΆ
The tweedledum library implements several synthesis algorithms. These take as input a function in terms of some representation and return a reversible or quantum circuit. The following table lists all synthesis algorithms that are currently provided in tweedledum.
Function
|
Description
|
Expects
|
Returns
|
---|---|---|---|
CNOT Patel synthesis for linear circuits.
|
Linear matrix
|
{CNOT} network
|
|
Reversible synthesis based on functional decomposition.
|
Permutation
|
Quantum or reversible circuit
|
|
Synthesis of diagonal unitary matrices.
|
List of angles in diagonal unitary matrix
|
{CNOT, Rz} network
|
|
ESOP-phase synthesis.
|
Boolean function
|
Quantum circuit
|
|
Gray synthesis for {CNOT, Rz} networks.
|
List of parities and rotation angles to synthesize
|
{CNOT, Rz} network
|
|
Linear synthesis for small {CNOT, Rz} networks.
|
List of parities and rotation angles to synthesize
|
{CNOT, Rz} network
|
|
Transformation-based reversible logic synthesis.
|
Permutation
|
Reversible circuit
|