Compiles a function implemented as a sequence of gate function calls into a Circuit.

Dumps this circuit recursively to the console and/or log.

Determines whether the specified object is equal to the current object.

Find Ids below this point and the time needed to execute the circuit (internal)

Rewrites this circuit by identifying opportunities for parallelism and turning Seq elements into Par elements where possible. This makes for a better rendering.

Gets the count of gates in circuit. Note that pure label gates -- that is, gates of type String -- are never counted.

Serves as the default hash function.

Gets the Type of the current instance.

Creates an optimized "grown" version of this Circuit. The type and limits of the conversion are specified in the grow parameter.

Creates an equivalent circuit to this circuit by aggregating existing unitary gates into larger unitary gates. The new circuit will execute faster because it has fewer matrix applications required.

Converts this circuit into a single unitary gate, implemented by a single matrix. This allows maximum optimization of circuit execution.

This circuit must be completely unitary to be converted into a single matrix. If it is not, an exception will be raised by this method.

Creates a new circuit logically equivalent to this circuit, but with redundant gates removed. For instance, if this routine found a sequence of two X gates in succession on the same qubit, it would remove both of them from the result.

Renders this circuit to a file.

Renders a circuit to both svg, for HTML, and tikz, for TeX.

Reverses this circuit, which must contain only unitary gates. In addition, bottom-level gates are replaced by their adjoints. This method will raise an exception if this circuit contains a non-unitary gate.

Runs this Circuit. The state of the Ket containing the passed-in qubits will be modified.

Returns a string representing the current circuit element.

Gets the list of wires (qubit IDs) touched by this circuit.