Update README with the logo (#244)

Author: LalehB

README.md

@@ -1,5 +1,9 @@
 <div align="center">
 
+<p align="center">
+  <img src="https://github.com/user-attachments/assets/74a52d92-f7b4-40ed-a0e9-09b611fcbd9a" width="300" alt="Tesseract Decoder Logo">
+</p>
+
 # [Tesseract Decoder](https://quantumlib.github.io/tesseract-decoder)
 
 A Search-Based Decoder for Quantum Error Correction.

src/tesseract.cc

@@ -95,7 +95,9 @@ double TesseractDecoder::get_detcost(
 
   for (int ei : d2e[d]) {
     ec = error_costs[ei];
-    if (ec.likelihood_cost * min_det_cost_det_count >= min_cost * errors[ei].symptom.detectors.size()) break;
+    if (ec.likelihood_cost * min_det_cost_det_count >=
+        min_cost * errors[ei].symptom.detectors.size())
+      break;
 
     dct = detector_cost_tuples[ei];
     if (!dct.error_blocked) {

src/tesseract.test.cc

@@ -409,7 +409,7 @@ TEST(TesseractDetcostTest, ComparesRatiosNotRawCosts) {
 
   std::vector<DetectorCostTuple> tuples(dec.errors.size());
   // residual x = {D0, D1}
-  std::cout <<"dec.d2e.size() = "<<dec.d2e.size()<<std::endl;
+  std::cout << "dec.d2e.size() = " << dec.d2e.size() << std::endl;
   for (int ei : dec.d2e[0]) tuples[ei].detectors_count++;
   for (int ei : dec.d2e[1]) tuples[ei].detectors_count++;