Redo release note for new version

Author: jakelishman

releasenotes/notes/1.0/fast-sparse-pauli-operator-b41cacf11e8c4e0e.yaml

@@ -5,4 +5,4 @@ features_quantum_info:
     "tensorized Pauli decomposition algorithm" presented in
     `Hatznko, Binkowski and Gupta (2023) <https://arxiv.org/abs/2310.13421>`__.  The method is now
     several orders of magnitude faster; for example, it is possible to decompose a random
-    10-qubit operator in around 40ms on a consumer Macbook Pro (Intel i7, 2020).
+    10-qubit operator in around 250ms on a consumer Macbook Pro (Intel i7, 2020).

releasenotes/notes/faster-pauli-decomposition-faf2be01a6e75fff.yaml

@@ -0,0 +1,7 @@
+---
+features_quantum_info:
+  - |
+    The performance of :meth:`.SparsePauliOp.from_operator` has been optimized on top of the
+    algorithm improvements methods introduced in Qiskit 1.0.  It is now approximately five times
+    faster than before for fully dense matrices, taking approximately 40ms to decompose a 10q
+    operator involving all Pauli terms.