diff --git a/sorts/quantum_bogo_sort.py b/sorts/quantum_bogo_sort.py
new file mode 100644
index 000000000..36862b342
--- /dev/null
+++ b/sorts/quantum_bogo_sort.py
@@ -0,0 +1,14 @@
+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.
+
+    :param arr: List[int] - The list of numbers to sort.
+    :return: List[int] - The sorted list.
+    """
+    return arr  # The elements are already in a superposition of sorted and unsorted states
+
+
+if __name__ == "__main__":
+  my_array = [2, 1, 4, 3]
+  quantum_bogo_sort(my_array)