diff --git a/sorts/quantum_bogo_sort.py b/sorts/quantum_bogo_sort.py
index 2551dee43..8150a76d4 100644
--- a/sorts/quantum_bogo_sort.py
+++ b/sorts/quantum_bogo_sort.py
@@ -4,6 +4,9 @@ def quantum_bogo_sort(arr: List[int]) -> List[int]:
     """
     Quantum Bogo Sort is a theoretical sorting algorithm that uses quantum mechanics to sort the elements.
     It is not practically feasible and is included here for humor.
+    
+    Reference:
+    https://en.wikipedia.org/wiki/Bogosort#:~:text=achieve%20massive%20complexity.-,Quantum%20bogosort,-A%20hypothetical%20sorting
 
     :param arr: List[int] - The list of numbers to sort.
     :return: List[int] - The sorted list, humorously assumed to be instantly sorted using quantum superposition.