diff --git a/user-guide/modules/ROOT/pages/task-quantum-computing.adoc b/user-guide/modules/ROOT/pages/task-quantum-computing.adoc
index b95de5d..d2f820f 100644
--- a/user-guide/modules/ROOT/pages/task-quantum-computing.adoc
+++ b/user-guide/modules/ROOT/pages/task-quantum-computing.adoc
@@ -885,7 +885,7 @@ In the long-term quantum supremacy might reign over all classical tasks!
 
 [#footnote1]
 link:#footnote1-location[(1)]
-A _qubit_ (quantum bit) is the fundamental unit of quantum information, analogous to a classical bit but with unique quantum properties. Unlike a classical bit, which can be either 0 or 1, a qubit exists in a superposition of both states simultaneously, represented as _α|0⟩ + β|1⟩_, where_ α_ and _β_ are complex probability amplitudes. Qubits also exhibit entanglement, allowing them to share information instantaneously over distance, and quantum interference, which enables complex computations by manipulating probability amplitudes. These properties make qubits exponentially more powerful for certain tasks, forming the basis of quantum computing breakthroughs like Shor's algorithm (for factoring) and Grover's algorithm (for search). However, qubits are fragile and require error correction and extreme isolation to maintain coherence, making practical quantum computing a significant engineering challenge.
+A _qubit_ (quantum bit) is the fundamental unit of quantum information, analogous to a classical bit but with unique quantum properties. Unlike a classical bit, which can be either 0 or 1, a qubit exists in a superposition of both states simultaneously, represented as _α|0⟩ + β|1⟩_, where _α_ and _β_ are complex probability amplitudes. Qubits also exhibit entanglement, allowing them to share information instantaneously over distance, and quantum interference, which enables complex computations by manipulating probability amplitudes. These properties make qubits exponentially more powerful for certain tasks, forming the basis of quantum computing breakthroughs like Shor's algorithm (for factoring) and Grover's algorithm (for search). However, qubits are fragile and require error correction and extreme isolation to maintain coherence, making practical quantum computing a significant engineering challenge.
 
 [#footnote2]
 link:#footnote1-location[(2)]