{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreic5qg45dtvn55tnlemhueohqahmjl4syymse3susqm47whicndpe4",
    "uri": "at://did:plc:uwj5fyuv3lbhhoybn5hnrqx4/app.bsky.feed.post/3mmyk6xsdc7n2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreifevphdrza74pbda3eebqxdzwwch6jvgks3so3yg64od3rfv6bjae"
    },
    "mimeType": "image/png",
    "size": 441223
  },
  "description": "I automate things for a living. Then I found out there is a type of computer that holds every possible answer at once and only picks one when you force it to look. I have not slept well since. First IBM Quantum badge earned. The chapter starts here.",
  "path": "/i-just-earned-my-first-ibm-quantum-badge-and-i-am-not-going-back/",
  "publishedAt": "2026-05-29T12:32:26.000Z",
  "site": "https://blog.tuguidragos.com",
  "textContent": "I build automation systems for a living: AI agents, multi-platform publishing pipelines, n8n workflows, lead generation engines. I am entirely self-taught. No CS degree, no bootcamp, no corporate onboarding program. Just time, curiosity, and a refusal to stay where I started.\n\nI tell you this because it matters for what comes next.\n\nA few weeks ago I started pulling on the quantum computing thread. Not because someone told me to, not because it was trending, but because I read one paragraph about Grover's algorithm and could not stop thinking about it. I already understood how classical computers process information. I thought I had a solid mental model of what computation actually means.\n\nQuantum broke that model in the best possible way.\n\nYesterday, I earned the **IBM Fundamentals of Quantum Algorithms** badge through IBM Quantum. It is labeled Intermediate, and I want to be honest with you: some of it stretched my brain in directions it has never been stretched before. This post is about why I started, what the badge actually covers, and where I am going from here.\n\n* * *\n\n## Why Quantum Computing, and Why Now\n\nI build systems that process data, call APIs, orchestrate agents, and publish content without human intervention. The field is moving fast, and I try to stay ahead of it.\n\nQuantum computing kept appearing in the background regardless. Research papers, job postings at IBM and Google, funding announcements, university programs spinning up dedicated faculties. It is not a trend that will peak and disappear. It is infrastructure being built right now, quietly, under the surface of everything else.\n\nWhat pushed me from curious to committed was realizing that quantum is not faster classical computing. It is a fundamentally different model of what computation even means. A classical computer checks possibilities sequentially. A quantum computer, using superposition and interference, can process all possibilities simultaneously and extract the answer through constructive and destructive interference patterns.\n\nOnce that clicked, I could not leave it alone.\n\n## What the IBM Fundamentals of Quantum Algorithms Badge Actually Covers\n\nThis is not a beginner certificate where you click through slides and answer multiple choice questions. The IBM Quantum learning path is genuinely technical. Here is what the badge covers:\n\n**The core quantum algorithms you need to understand:**\n\nThe **Deutsch-Jozsa algorithm** is often the first quantum algorithm people encounter because it is clean and conceptually clear. It solves a specific problem in one query that would take a classical computer exponentially many queries in the worst case. It is not practically useful on its own, but it demonstrates quantum advantage in a provable, rigorous way. Understanding it properly requires getting comfortable with quantum oracles and interference.\n\n**Simon's algorithm** was the direct inspiration for Shor's algorithm, which is the reason quantum computing gets so much attention from cryptographers and governments. Simon's algorithm finds a hidden period in a function exponentially faster than any classical approach. Working through it teaches you how quantum algorithms extract global structure from a function using interference patterns.\n\n**Grover's algorithm** is the one that made me stop and think when I first encountered it. It provides a quadratic speedup for unstructured search. That speedup is not exponential, but it is provably optimal for unstructured search on a quantum computer, and it applies to a huge range of practical problems.\n\nThe badge also covers the **Quantum Fourier Transform** , which is the quantum analog of the classical Fast Fourier Transform and sits at the heart of Shor's algorithm and phase estimation. Once you understand the QFT, the structure of many quantum algorithms becomes much clearer.\n\nBeyond the individual algorithms, the badge focuses on how to evaluate quantum algorithmic advantage: when does quantum actually help, by how much, and under what assumptions? This framing matters a lot if you want to work in the field seriously rather than just repeat marketing claims.\n\n## What Quantum Computing Actually Requires You to Understand\n\nI want to be direct here because I think a lot of introductory quantum content is misleading about the learning curve.\n\nTo understand quantum algorithms properly, you need to be comfortable with a few things:\n\nLinear algebra is the language of quantum computing. States are vectors. Operations are matrices. Measurement is a projection. If you are not comfortable with matrix multiplication, inner products, and eigenvalues, you will hit a wall quickly. The IBM learning path assumes you can work with this notation.\n\nComplex numbers come up constantly because quantum amplitudes are complex. The interference that makes quantum algorithms work relies on the fact that amplitudes can cancel each other out, which requires the imaginary component.\n\nProbability and measurement. A quantum state is not just a single answer. It is a superposition of possibilities with associated amplitudes. When you measure, you collapse that superposition to a classical outcome, with probabilities determined by the amplitudes. Understanding when and how to measure is a core design decision in any quantum algorithm.\n\nNone of this is impossible. I came at it from an automation background, not a physics or math degree. But I want to set accurate expectations: this is a real technical discipline, not a buzzword to put on a LinkedIn profile.\n\n## Where I Am Going From Here\n\nEarning this badge is the starting point, not the destination.\n\nMy next concrete steps are:\n\nLearning Python for quantum using Qiskit, IBM's open source quantum computing SDK. Qiskit lets you write and simulate quantum circuits in Python, and run them on real IBM quantum hardware. I already know enough Python to get started. The goal is to implement each of the algorithms from the badge from scratch, in code, until I genuinely understand what every gate is doing.\n\nGoing deeper into quantum complexity theory. Understanding the difference between BQP, NP, and classical P is important if you want to reason clearly about what quantum computers can and cannot do. There is a lot of noise in the space and a solid theoretical foundation helps filter it.\n\nLooking seriously at the intersection of quantum computing and optimization problems, which is where I think the most near-term practical value will emerge for people coming from software and automation backgrounds.\n\nI also want to write about this journey honestly, including the parts that are hard and confusing, not just the polished insights. If you are curious about quantum computing but not sure where to start, or if you have been following the field from a distance and want to go deeper, I think we are probably in a similar position right now.\n\n## A Note on Why I Am Sharing This\n\nI build automation systems for a living. I publish about AI agents, multi-agent workflows, and the practical side of building with LLMs. Quantum computing sits adjacent to that world right now, but I am convinced the overlap will grow significantly over the next five to ten years.\n\nMost quantum content online is either too shallow to be useful or so deep it assumes a physics PhD. I want to write the version that does not exist yet: honest, technical, built from scratch by someone who is not supposed to be here.\n\nIf you are a developer, an automation builder, or just someone who refuses to stay at the surface of things, this journey is probably worth following. Subscribe below and I will send you each post as it lands. No noise, just the actual work.\n\nThe first badge is earned. The road is long. Let us see where it goes.",
  "title": "I Just Earned My First IBM Quantum Badge and I Am Not Going Back",
  "updatedAt": "2026-05-29T12:32:26.939Z"
}