Merge branch 'clifford_simulator' of https://github.com/qiboteam/qibo …

…into clifford_simulator

doc/source/api-reference/qibo.rst

@@ -1371,19 +1371,19 @@ Pauli basis to computational basis
 Phase-space Representation of Stabilizer States
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 
-A *stabilizer state* :math:`\ketbra{\psi}{\psi}` can be uniquely defined by 
-the set of its *stabilizers*, i.e. those unitary operators :math:`U` that have 
+A *stabilizer state* :math:`\ketbra{\psi}{\psi}` can be uniquely defined by
+the set of its *stabilizers*, i.e. those unitary operators :math:`U` that have
 :math:`\psi` as an eigenstate with eigenvalue :math:`1`.
-In general, :math:`n`-qubit stabilizer states are stabilized by :math:`d = 2^n` 
-Pauli operators on said :math:`n` qubits. 
-However, it is known that the set of :math:`d` Paulis can be generated by only 
+In general, :math:`n`-qubit stabilizer states are stabilized by :math:`d = 2^n`
+Pauli operators on said :math:`n` qubits.
+However, it is known that the set of :math:`d` Paulis can be generated by only
 :math:`n` unique members of the set.
-In that case, indeed, the number of operators needed to represent a 
+In that case, indeed, the number of operators needed to represent a
 stabilizer state reduces to :math:`n`.
 Each one of these :math:`n` Pauli *generators* takes :math:`2n + 1` bits to specify,
 yielding a :math:`n(2n+1)` total number of bits needed.
-In particular, `Aaronson and Gottesman (2004) <aaronson_>`_ demonstrated that the application 
-of Clifford gates on stabilizer states can be efficiently simulated in this representation 
+In particular, `Aaronson and Gottesman (2004) <aaronson_>`_ demonstrated that the application
+of Clifford gates on stabilizer states can be efficiently simulated in this representation
 at the cost of storing the generators of the *destabilizers*, in addition to the stabilizers.
 
 A :math:`n`-qubit stabilizer state is uniquely defined by a symplectic matrix of the form