🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 77 (from laksa170)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa077.int.ahrefs:8124/' \
  -H 'Content-Type: text/plain' \
  -H 'X-ClickHouse-Database: crawler3' \
  -H 'Authorization: Basic YXBpOg==' \
  -d 'SELECT getAhrefsURLFromUnparsed(src_unparsed) AS found_url, ifNull(toUnixTimestamp(download_stamp), 0) AS crawl_time, ifNull(toUnixTimestamp(props_url_first_seen), 0) AS first_indexed_time, download_http_code AS http_code, src_unparsed AS src_unparsed, src_root_hash AS src_root_hash, history_drop_reason AS history_drop_reason, meta_title AS meta_title, meta_descriptions AS meta_descriptions, attrs_boilerpipe_text AS attrs_boilerpipe_text, attrs_markdown AS attrs_markdown, attrs_readable_markdown AS attrs_readable_markdown, meta_canonical AS meta_canonical, ml_categories_json AS ml_categories_json, ml_types_json AS ml_types_json, ml_intent_types_json AS ml_intent_types_json, meta_language AS meta_language, attrs_author AS attrs_author, ifNull(toUnixTimestamp(attrs_publish_time), 0) AS attrs_publish_time, ifNull(toUnixTimestamp(attrs_original_publish_time), 0) AS attrs_original_publish_time, ifNull(attrs_is_republished, 0) AS attrs_is_republished, ifNull(attrs_nr_words, 0) AS attrs_nr_words, ifNull(attrs_boilerpipe_nr_words, 0) AS attrs_boilerpipe_nr_words, ifNull(body_ext_links_number, 0) AS body_ext_links_number, ifNull(body_int_links_number, 0) AS body_int_links_number, ifNull(meta_nofollow, 0) AS meta_nofollow, ifNull(meta_noarchive, 0) AS meta_noarchive, ifNull(props_was_rendered, 0) AS props_was_rendered, ifNull(src_redirect, \'\') AS src_redirect, ifNull(download_time_msec, 0) AS download_time_msec, ifNull(download_ttfb_msec, 0) AS download_ttfb_msec, ifNull(download_size, 0) AS download_size FROM crawler3.page_info_local FINAL PREWHERE (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://medium.com/quantum-computing-series/quantum-superposition-5ac9e3e286ad\')), getAhrefsUnparsedNoserviceFromURL(\'https://medium.com/quantum-computing-series/quantum-superposition-5ac9e3e286ad\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/medium.com\/quantum-computing-series\/quantum-superposition-5ac9e3e286ad","crawl_time":1756017513,"first_indexed_time":0,"http_code":200,"src_unparsed":"com,medium!\/quantum-computing-series\/quantum-superposition-5ac9e3e286ad s443","src_root_hash":"13179037029838926277","history_drop_reason":"tooold","meta_title":"Quantum Superposition. What is Superposition Exactly? | by Jay Pandit | Quantum Computing Series | Medium","meta_descriptions":["This is like your magical coin being in heads and tails at the same time, but as soon as you look, it “chooses” one side. In simple words, superposition makes quantum computers powerful. It gives…"],"attrs_boilerpipe_text":"Let’s break it down simply: In  normal life  (classical physics), things have only  one state  at a time. A light switch is  ON  or  OFF . A computer bit is  0  or  1 . In the  quantum world , things can be in a  superposition , meaning they can be in a  combination of states  at the same time. A quantum bit (called a  qubit ) can be  0 and 1 at the same time . It stays that way until we measure it (check it). Once we measure it, it instantly picks  either 0 or 1 . This is like your magical coin being in  heads and tails at the same time , but as soon as you look, it “chooses” one side. You might ask: “Why do we care if something can be 0 and 1 at the same time?” Great question! In normal computers: Information is stored as  bits  → just 0s and 1s. Calculations happen one step at a time. In quantum computers: Information is stored as  qubits  → they can be in  superposition . This allows them to process  many possibilities at once ! In simple words,  superposition makes quantum computers powerful .  It gives them the ability to solve some problems  much faster  than ordinary computers. For example: Searching huge databases. Breaking cryptographic codes. Simulating molecules for medicine. In all these cases, quantum computers can explore  multiple paths at once , thanks to superposition. You might think: “Wow, why don’t we all just use quantum computers now?” Here’s the tricky part: Superposition is  very fragile . Any tiny disturbance from the environment can make it collapse. This is called  decoherence . When that happens, the qubit loses its “magical” superposition and behaves like a regular bit again. Building quantum computers that can  protect qubits  and keep them in superposition long enough is  very hard . That’s why companies and scientists around the world are still working hard on this. n classical physics, a system has a well-defined state.  For example: A switch is either ON or OFF. A particle is either here or there. In quantum mechanics, however, the state of a system is represented by a  vector (state vector)  in a complex vector space known as  Hilbert space .  A system does not need to be in one state or another. Instead, it can exist in a  linear combination  of states simultaneously: ∣ψ⟩=α∣0⟩+β∣1⟩ Where: ∣0⟩ and ∣1⟩ are basis states. α and β are complex probability amplitudes. ∣α∣²+∣β∣²=1 (normalization condition). When we  measure  the state, the superposition collapses, and we observe only one of the basis states with a probability given by ∣α∣2|\\alpha|²∣α∣2 or ∣β∣2|\\beta|²∣β∣2. A famous thought experiment that illustrates superposition is  Schrödinger’s cat : A cat is placed in a sealed box with a radioactive atom, poison, and detector. If the atom decays → poison is released → cat dies. If the atom does not decay → cat lives. According to quantum mechanics,  until the box is opened , the cat is in a  superposition of dead and alive states . Only observation collapses the state to either “dead” or “alive.” While controversial and somewhat philosophical, this highlights the  non-intuitive nature of superposition . In quantum computing, superposition allows  qubits  to encode exponentially more information than classical bits. A classical bit can be in one of two states →  0 or 1 . A qubit can be in a superposition →  α|0⟩ + β|1⟩ . For  n qubits , the state of the system is represented as: ∣ψ⟩=i=0∑2n−1αi∣i⟩ This means: 2 qubits → 4 possible states in superposition. 3 qubits → 8 possible states in superposition. n qubits → 2^n possible states in superposition. Thus, quantum computers can process  2^n states in parallel , giving them tremendous computational power for specific algorithms. Examples: Grover’s Algorithm  → Searches unsorted databases faster using superposition and interference. Shor’s Algorithm  → Factors large numbers exponentially faster, threatening classical encryption. Superposition alone is not enough for quantum speedup. Quantum interference  is also essential. During computation: Constructive interference  enhances correct answers. Destructive interference  cancels wrong answers. Superposition enables the computer to explore many paths; interference ensures that only the correct paths contribute to the final answer.","attrs_markdown":"[Sitemap](https:\/\/medium.com\/sitemap\/sitemap.xml)\n\n[Open in app](https:\/\/rsci.app.link\/?%24canonical_url=https%3A%2F%2Fmedium.com%2Fp%2F5ac9e3e286ad&~feature=LoOpenInAppButton&~channel=ShowPostUnderCollection&~stage=mobileNavBar&source=post_page---top_nav_layout_nav-----------------------------------------)\n\nSign up\n\n[Sign in](https:\/\/medium.com\/m\/signin?operation=login&redirect=https%3A%2F%2Fmedium.com%2Fquantum-computing-series%2Fquantum-superposition-5ac9e3e286ad&source=post_page---top_nav_layout_nav-----------------------global_nav------------------)\n\n[Medium Logo](https:\/\/medium.com\/?source=post_page---top_nav_layout_nav-----------------------------------------)\n\n[Write](https:\/\/medium.com\/m\/signin?operation=register&redirect=https%3A%2F%2Fmedium.com%2Fnew-story&source=---top_nav_layout_nav-----------------------new_post_topnav------------------)\n\nSign up\n\n[Sign in](https:\/\/medium.com\/m\/signin?operation=login&redirect=https%3A%2F%2Fmedium.com%2Fquantum-computing-series%2Fquantum-superposition-5ac9e3e286ad&source=post_page---top_nav_layout_nav-----------------------global_nav------------------)\n\n![](https:\/\/miro.medium.com\/v2\/resize:fill:64:64\/1*dmbNkD5D-u45r44go_cf0g.png)\n\n[Quantum Computing Series](https:\/\/medium.com\/quantum-computing-series?source=post_page---publication_nav-cc1814d204a6-5ac9e3e286ad---------------------------------------)\n\n·\n\n[![Quantum Computing Series](https:\/\/miro.medium.com\/v2\/resize:fill:76:76\/1*jAezH_-nDGlfycq1UKrITw.png)](https:\/\/medium.com\/quantum-computing-series?source=post_page---post_publication_sidebar-cc1814d204a6-5ac9e3e286ad---------------------------------------)\n\nA deep dive into the world of quantum computing — from Qubits and Gates to Quantum Algorithms and Error Correction. By Jay Pandit. “Quantum computing tutorials and explanations for enthusiasts and professionals.”\n\n# Quantum Superposition\n[![Jay Pandit](https:\/\/miro.medium.com\/v2\/resize:fill:64:64\/1*flpEuRMeomLiH7JzQTQdMA.jpeg)](https:\/\/medium.com\/@jaypandit04?source=post_page---byline--5ac9e3e286ad---------------------------------------)\n\n[Jay Pandit](https:\/\/medium.com\/@jaypandit04?source=post_page---byline--5ac9e3e286ad---------------------------------------)\n\n4 min read\n\n·\n\nMay 5, 2025\n\n\\--\n\nListen\n\nShare\n\nPress enter or click to view image in full size\n\n![]()\n# What is Superposition Exactly?\nLet’s break it down simply:\n\n- In **normal life** (classical physics), things have only **one state** at a time.\n- A light switch is **ON** or **OFF**.\n- A computer bit is **0** or **1**.\n- In the **quantum world**, things can be in a **superposition**, meaning they can be in a **combination of states** at the same time.\n- A quantum bit (called a **qubit**) can be **0 and 1 at the same time**.\n- It stays that way until we measure it (check it).\n- Once we measure it, it instantly picks **either 0 or 1**.\n\nThis is like your magical coin being in **heads and tails at the same time**, but as soon as you look, it “chooses” one side.\n\nYou might ask:\n\n> *“Why do we care if something can be 0 and 1 at the same time?”*\n\nGreat question\\!\n\nIn normal computers:\n\n- Information is stored as **bits** → just 0s and 1s.\n- Calculations happen one step at a time.\n\nIn quantum computers:\n\n- Information is stored as **qubits** → they can be in **superposition**.\n- This allows them to process **many possibilities at once**\\!\n\nIn simple words, **superposition makes quantum computers powerful**.  \n It gives them the ability to solve some problems **much faster** than ordinary computers.\n\nFor example:\n\n- Searching huge databases.\n- Breaking cryptographic codes.\n- Simulating molecules for medicine.\n\nIn all these cases, quantum computers can explore **multiple paths at once**, thanks to superposition.\n\n# But There’s a Catch…\nYou might think:\n\n> *“Wow, why don’t we all just use quantum computers now?”*\n\nHere’s the tricky part:\n\n- Superposition is **very fragile**.\n- Any tiny disturbance from the environment can make it collapse.\n- This is called **decoherence**.\n\nWhen that happens, the qubit loses its “magical” superposition and behaves like a regular bit again.\n\nBuilding quantum computers that can **protect qubits** and keep them in superposition long enough is **very hard**.\n\nThat’s why companies and scientists around the world are still working hard on this.\n\n# The Foundation of Quantum Computing\nn classical physics, a system has a well-defined state.  \n For example:\n\n- A switch is either ON or OFF.\n- A particle is either here or there.\n\nIn quantum mechanics, however, the state of a system is represented by a **vector (state vector)** in a complex vector space known as **Hilbert space**.  \n A system does not need to be in one state or another. Instead, it can exist in a **linear combination** of states simultaneously:\n\n∣ψ⟩=α∣0⟩+β∣1⟩\n\nWhere:\n\n- ∣0⟩ and ∣1⟩ are basis states.\n- α and β are complex probability amplitudes.\n- ∣α∣²+∣β∣²=1 (normalization condition).\n\nWhen we **measure** the state, the superposition collapses, and we observe only one of the basis states with a probability given by ∣α∣2\\|\\\\alpha\\|²∣α∣2 or ∣β∣2\\|\\\\beta\\|²∣β∣2.\n\n# Physical Interpretation: Schrödinger’s Cat\nA famous thought experiment that illustrates superposition is **Schrödinger’s cat**:\n\n- A cat is placed in a sealed box with a radioactive atom, poison, and detector.\n- If the atom decays → poison is released → cat dies.\n- If the atom does not decay → cat lives.\n\nAccording to quantum mechanics, **until the box is opened**, the cat is in a **superposition of dead and alive states**. Only observation collapses the state to either “dead” or “alive.”\n\nWhile controversial and somewhat philosophical, this highlights the **non-intuitive nature of superposition**.\n\n# Superposition in Quantum Computing\nIn quantum computing, superposition allows **qubits** to encode exponentially more information than classical bits.\n\n# Classical Bits vs Qubits\n- A classical bit can be in one of two states → **0 or 1**.\n- A qubit can be in a superposition → **α\\|0⟩ + β\\|1⟩**.\n\nFor **n qubits**, the state of the system is represented as:\n\n∣ψ⟩=i=0∑2n−1αi∣i⟩\n\nThis means:\n\n- **2 qubits → 4 possible states in superposition.**\n- **3 qubits → 8 possible states in superposition.**\n- **n qubits → 2^n possible states in superposition.**\n\nThus, quantum computers can process **2^n states in parallel**, giving them tremendous computational power for specific algorithms.\n\n## Examples:\n- **Grover’s Algorithm** → Searches unsorted databases faster using superposition and interference.\n- **Shor’s Algorithm** → Factors large numbers exponentially faster, threatening classical encryption.\n# The Role of Interference\nSuperposition alone is not enough for quantum speedup.  \n **Quantum interference** is also essential.\n\nDuring computation:\n\n- **Constructive interference** enhances correct answers.\n- **Destructive interference** cancels wrong answers.\n\nSuperposition enables the computer to explore many paths; interference ensures that only the correct paths contribute to the final answer.\n\n# Challenges: Decoherence\nSuperposition is **extremely fragile**.  \n When a quantum system interacts with the environment (heat, light, vibration), it experiences **decoherence** — the loss of quantum behavior.\n\n- Decoherence collapses superpositions prematurely.\n- Quantum error correction and isolation techniques are needed to protect qubits.\n\n**Maintaining superposition long enough to perform meaningful computation is one of the biggest engineering challenges in quantum computing today.**\n\n[Quantum Superposition](https:\/\/medium.com\/tag\/quantum-superposition?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Decoherence Challenge](https:\/\/medium.com\/tag\/decoherence-challenge?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Interference](https:\/\/medium.com\/tag\/interference?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n\\--\n\n\\--\n\n[![Quantum Computing Series](https:\/\/miro.medium.com\/v2\/resize:fill:96:96\/1*jAezH_-nDGlfycq1UKrITw.png)](https:\/\/medium.com\/quantum-computing-series?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------)\n\n[![Quantum Computing Series](https:\/\/miro.medium.com\/v2\/resize:fill:128:128\/1*jAezH_-nDGlfycq1UKrITw.png)](https:\/\/medium.com\/quantum-computing-series?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------)\n\n[Published in Quantum Computing Series](https:\/\/medium.com\/quantum-computing-series?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------)\n\n[7 followers](https:\/\/medium.com\/quantum-computing-series\/followers?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------)\n\n·[Last published Jun 10, 2025](https:\/\/medium.com\/quantum-computing-series\/quantum-transformers-hype-or-breakthrough-57df9a8960e3?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------)\n\nA deep dive into the world of quantum computing — from Qubits and Gates to Quantum Algorithms and Error Correction. By Jay Pandit. “Quantum computing tutorials and explanations for enthusiasts and professionals.”\n\n[![Jay Pandit](https:\/\/miro.medium.com\/v2\/resize:fill:96:96\/1*flpEuRMeomLiH7JzQTQdMA.jpeg)](https:\/\/medium.com\/@jaypandit04?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------)\n\n[![Jay Pandit](https:\/\/miro.medium.com\/v2\/resize:fill:128:128\/1*flpEuRMeomLiH7JzQTQdMA.jpeg)](https:\/\/medium.com\/@jaypandit04?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------)\n\n[Written by Jay Pandit](https:\/\/medium.com\/@jaypandit04?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------)\n\n[55 followers](https:\/\/medium.com\/@jaypandit04\/followers?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------)\n\n·[7 following](https:\/\/medium.com\/@jaypandit04\/following?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------)\n\nSoftware Engineer at The LEGO Group. Focused on quantum computing applications and research. <https:\/\/www.linkedin.com\/in\/jay-pandit-4801\/>\n## No responses yet\n[Help](https:\/\/help.medium.com\/hc\/en-us?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Status](https:\/\/medium.statuspage.io\/?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[About](https:\/\/medium.com\/about?autoplay=1&source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Careers](https:\/\/medium.com\/jobs-at-medium\/work-at-medium-959d1a85284e?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Press](mailto:pressinquiries@medium.com)\n\n[Blog](https:\/\/blog.medium.com\/?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Privacy](https:\/\/policy.medium.com\/medium-privacy-policy-f03bf92035c9?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Rules](https:\/\/policy.medium.com\/medium-rules-30e5502c4eb4?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Terms](https:\/\/policy.medium.com\/medium-terms-of-service-9db0094a1e0f?source=post_page-----5ac9e3e286ad---------------------------------------)\n\n[Text to speech](https:\/\/speechify.com\/medium?source=post_page-----5ac9e3e286ad---------------------------------------)","attrs_readable_markdown":null,"meta_canonical":null,"ml_categories_json":"","ml_types_json":"","ml_intent_types_json":"","meta_language":"en","attrs_author":"Jay Pandit","attrs_publish_time":1746511263,"attrs_original_publish_time":1746511263,"attrs_is_republished":0,"attrs_nr_words":"970","attrs_boilerpipe_nr_words":"703","body_ext_links_number":4,"body_int_links_number":29,"meta_nofollow":0,"meta_noarchive":1,"props_was_rendered":0,"src_redirect":"","download_time_msec":980,"download_ttfb_msec":978,"download_size":32687}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

🚫

NOT INDEXABLE

✅

CRAWLED

8 months ago

🤖

ROBOTS ALLOWED

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	FAIL	`download_stamp > now() - 6 MONTH`	8.1 months ago
History drop	FAIL	`isNull(history_drop_reason)`	tooold
Spam/ban	PASS	`fh_dont_index != 1 AND ml_spam_score = 0`	ml_spam_score=0
Canonical	PASS	`meta_canonical IS NULL OR = '' OR = src_unparsed`	Not set

Page Details

Property	Value
URL	https://medium.com/quantum-computing-series/quantum-superposition-5ac9e3e286ad
Last Crawled	2025-08-24 06:38:33 (8 months ago)
First Indexed	not set
HTTP Status Code	200
Content
Meta Title	Quantum Superposition. What is Superposition Exactly? \| by Jay Pandit \| Quantum Computing Series \| Medium
Meta Description	This is like your magical coin being in heads and tails at the same time, but as soon as you look, it “chooses” one side. In simple words, superposition makes quantum computers powerful. It gives…
Meta Canonical	null
Boilerpipe Text	Let’s break it down simply: In normal life (classical physics), things have only one state at a time. A light switch is ON or OFF . A computer bit is 0 or 1 . In the quantum world , things can be in a superposition , meaning they can be in a combination of states at the same time. A quantum bit (called a qubit ) can be 0 and 1 at the same time . It stays that way until we measure it (check it). Once we measure it, it instantly picks either 0 or 1 . This is like your magical coin being in heads and tails at the same time , but as soon as you look, it “chooses” one side. You might ask: “Why do we care if something can be 0 and 1 at the same time?” Great question! In normal computers: Information is stored as bits → just 0s and 1s. Calculations happen one step at a time. In quantum computers: Information is stored as qubits → they can be in superposition . This allows them to process many possibilities at once ! In simple words, superposition makes quantum computers powerful . It gives them the ability to solve some problems much faster than ordinary computers. For example: Searching huge databases. Breaking cryptographic codes. Simulating molecules for medicine. In all these cases, quantum computers can explore multiple paths at once , thanks to superposition. You might think: “Wow, why don’t we all just use quantum computers now?” Here’s the tricky part: Superposition is very fragile . Any tiny disturbance from the environment can make it collapse. This is called decoherence . When that happens, the qubit loses its “magical” superposition and behaves like a regular bit again. Building quantum computers that can protect qubits and keep them in superposition long enough is very hard . That’s why companies and scientists around the world are still working hard on this. n classical physics, a system has a well-defined state. For example: A switch is either ON or OFF. A particle is either here or there. In quantum mechanics, however, the state of a system is represented by a vector (state vector) in a complex vector space known as Hilbert space . A system does not need to be in one state or another. Instead, it can exist in a linear combination of states simultaneously: ∣ψ⟩=α∣0⟩+β∣1⟩ Where: ∣0⟩ and ∣1⟩ are basis states. α and β are complex probability amplitudes. ∣α∣²+∣β∣²=1 (normalization condition). When we measure the state, the superposition collapses, and we observe only one of the basis states with a probability given by ∣α∣2\|\alpha\|²∣α∣2 or ∣β∣2\|\beta\|²∣β∣2. A famous thought experiment that illustrates superposition is Schrödinger’s cat : A cat is placed in a sealed box with a radioactive atom, poison, and detector. If the atom decays → poison is released → cat dies. If the atom does not decay → cat lives. According to quantum mechanics, until the box is opened , the cat is in a superposition of dead and alive states . Only observation collapses the state to either “dead” or “alive.” While controversial and somewhat philosophical, this highlights the non-intuitive nature of superposition . In quantum computing, superposition allows qubits to encode exponentially more information than classical bits. A classical bit can be in one of two states → 0 or 1 . A qubit can be in a superposition → α\|0⟩ + β\|1⟩ . For n qubits , the state of the system is represented as: ∣ψ⟩=i=0∑2n−1αi∣i⟩ This means: 2 qubits → 4 possible states in superposition. 3 qubits → 8 possible states in superposition. n qubits → 2^n possible states in superposition. Thus, quantum computers can process 2^n states in parallel , giving them tremendous computational power for specific algorithms. Examples: Grover’s Algorithm → Searches unsorted databases faster using superposition and interference. Shor’s Algorithm → Factors large numbers exponentially faster, threatening classical encryption. Superposition alone is not enough for quantum speedup. Quantum interference is also essential. During computation: Constructive interference enhances correct answers. Destructive interference cancels wrong answers. Superposition enables the computer to explore many paths; interference ensures that only the correct paths contribute to the final answer.
Markdown	[Sitemap](https://medium.com/sitemap/sitemap.xml) [Open in app](https://rsci.app.link/?%24canonical_url=https%3A%2F%2Fmedium.com%2Fp%2F5ac9e3e286ad&~feature=LoOpenInAppButton&~channel=ShowPostUnderCollection&~stage=mobileNavBar&source=post_page---top_nav_layout_nav-----------------------------------------) Sign up [Sign in](https://medium.com/m/signin?operation=login&redirect=https%3A%2F%2Fmedium.com%2Fquantum-computing-series%2Fquantum-superposition-5ac9e3e286ad&source=post_page---top_nav_layout_nav-----------------------global_nav------------------) [Medium Logo](https://medium.com/?source=post_page---top_nav_layout_nav-----------------------------------------) [Write](https://medium.com/m/signin?operation=register&redirect=https%3A%2F%2Fmedium.com%2Fnew-story&source=---top_nav_layout_nav-----------------------new_post_topnav------------------) Sign up [Sign in](https://medium.com/m/signin?operation=login&redirect=https%3A%2F%2Fmedium.com%2Fquantum-computing-series%2Fquantum-superposition-5ac9e3e286ad&source=post_page---top_nav_layout_nav-----------------------global_nav------------------) ![](https://miro.medium.com/v2/resize:fill:64:64/1dmbNkD5D-u45r44go_cf0g.png) [Quantum Computing Series](https://medium.com/quantum-computing-series?source=post_page---publication_nav-cc1814d204a6-5ac9e3e286ad---------------------------------------) · [![Quantum Computing Series](https://miro.medium.com/v2/resize:fill:76:76/1jAezH_-nDGlfycq1UKrITw.png)](https://medium.com/quantum-computing-series?source=post_page---post_publication_sidebar-cc1814d204a6-5ac9e3e286ad---------------------------------------) A deep dive into the world of quantum computing — from Qubits and Gates to Quantum Algorithms and Error Correction. By Jay Pandit. “Quantum computing tutorials and explanations for enthusiasts and professionals.” # Quantum Superposition [![Jay Pandit](https://miro.medium.com/v2/resize:fill:64:64/1flpEuRMeomLiH7JzQTQdMA.jpeg)](https://medium.com/@jaypandit04?source=post_page---byline--5ac9e3e286ad---------------------------------------) [Jay Pandit](https://medium.com/@jaypandit04?source=post_page---byline--5ac9e3e286ad---------------------------------------) 4 min read · May 5, 2025 \-- Listen Share Press enter or click to view image in full size ![]() # What is Superposition Exactly? Let’s break it down simply: - In normal life* (classical physics), things have only one state at a time. - A light switch is ON or OFF. - A computer bit is 0 or 1. - In the quantum world, things can be in a superposition, meaning they can be in a combination of states at the same time. - A quantum bit (called a qubit) can be 0 and 1 at the same time. - It stays that way until we measure it (check it). - Once we measure it, it instantly picks either 0 or 1. This is like your magical coin being in heads and tails at the same time, but as soon as you look, it “chooses” one side. You might ask: > “Why do we care if something can be 0 and 1 at the same time?” Great question\! In normal computers: - Information is stored as bits → just 0s and 1s. - Calculations happen one step at a time. In quantum computers: - Information is stored as qubits → they can be in superposition. - This allows them to process many possibilities at once\! In simple words, superposition makes quantum computers powerful. It gives them the ability to solve some problems much faster than ordinary computers. For example: - Searching huge databases. - Breaking cryptographic codes. - Simulating molecules for medicine. In all these cases, quantum computers can explore multiple paths at once, thanks to superposition. # But There’s a Catch… You might think: > “Wow, why don’t we all just use quantum computers now?” Here’s the tricky part: - Superposition is very fragile. - Any tiny disturbance from the environment can make it collapse. - This is called decoherence. When that happens, the qubit loses its “magical” superposition and behaves like a regular bit again. Building quantum computers that can protect qubits and keep them in superposition long enough is very hard. That’s why companies and scientists around the world are still working hard on this. # The Foundation of Quantum Computing n classical physics, a system has a well-defined state. For example: - A switch is either ON or OFF. - A particle is either here or there. In quantum mechanics, however, the state of a system is represented by a vector (state vector) in a complex vector space known as Hilbert space. A system does not need to be in one state or another. Instead, it can exist in a linear combination of states simultaneously: ∣ψ⟩=α∣0⟩+β∣1⟩ Where: - ∣0⟩ and ∣1⟩ are basis states. - α and β are complex probability amplitudes. - ∣α∣²+∣β∣²=1 (normalization condition). When we measure the state, the superposition collapses, and we observe only one of the basis states with a probability given by ∣α∣2\\|\\alpha\\|²∣α∣2 or ∣β∣2\\|\\beta\\|²∣β∣2. # Physical Interpretation: Schrödinger’s Cat A famous thought experiment that illustrates superposition is Schrödinger’s cat: - A cat is placed in a sealed box with a radioactive atom, poison, and detector. - If the atom decays → poison is released → cat dies. - If the atom does not decay → cat lives. According to quantum mechanics, until the box is opened, the cat is in a superposition of dead and alive states. Only observation collapses the state to either “dead” or “alive.” While controversial and somewhat philosophical, this highlights the non-intuitive nature of superposition. # Superposition in Quantum Computing In quantum computing, superposition allows qubits to encode exponentially more information than classical bits. # Classical Bits vs Qubits - A classical bit can be in one of two states → 0 or 1. - A qubit can be in a superposition → α\\|0⟩ + β\\|1⟩. For n qubits, the state of the system is represented as: ∣ψ⟩=i=0∑2n−1αi∣i⟩ This means: - 2 qubits → 4 possible states in superposition. - 3 qubits → 8 possible states in superposition. - n qubits → 2^n possible states in superposition. Thus, quantum computers can process 2^n states in parallel, giving them tremendous computational power for specific algorithms. ## Examples: - Grover’s Algorithm → Searches unsorted databases faster using superposition and interference. - Shor’s Algorithm → Factors large numbers exponentially faster, threatening classical encryption. # The Role of Interference Superposition alone is not enough for quantum speedup. Quantum interference is also essential. During computation: - Constructive interference enhances correct answers. - Destructive interference cancels wrong answers. Superposition enables the computer to explore many paths; interference ensures that only the correct paths contribute to the final answer. # Challenges: Decoherence Superposition is extremely fragile. When a quantum system interacts with the environment (heat, light, vibration), it experiences decoherence — the loss of quantum behavior. - Decoherence collapses superpositions prematurely. - Quantum error correction and isolation techniques are needed to protect qubits. Maintaining superposition long enough to perform meaningful computation is one of the biggest engineering challenges in quantum computing today. [Quantum Superposition](https://medium.com/tag/quantum-superposition?source=post_page-----5ac9e3e286ad---------------------------------------) [Decoherence Challenge](https://medium.com/tag/decoherence-challenge?source=post_page-----5ac9e3e286ad---------------------------------------) [Interference](https://medium.com/tag/interference?source=post_page-----5ac9e3e286ad---------------------------------------) \-- \-- [![Quantum Computing Series](https://miro.medium.com/v2/resize:fill:96:96/1jAezH_-nDGlfycq1UKrITw.png)](https://medium.com/quantum-computing-series?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------) [![Quantum Computing Series](https://miro.medium.com/v2/resize:fill:128:128/1jAezH_-nDGlfycq1UKrITw.png)](https://medium.com/quantum-computing-series?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------) [Published in Quantum Computing Series](https://medium.com/quantum-computing-series?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------) [7 followers](https://medium.com/quantum-computing-series/followers?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------) ·[Last published Jun 10, 2025](https://medium.com/quantum-computing-series/quantum-transformers-hype-or-breakthrough-57df9a8960e3?source=post_page---post_publication_info--5ac9e3e286ad---------------------------------------) A deep dive into the world of quantum computing — from Qubits and Gates to Quantum Algorithms and Error Correction. By Jay Pandit. “Quantum computing tutorials and explanations for enthusiasts and professionals.” [![Jay Pandit](https://miro.medium.com/v2/resize:fill:96:96/1flpEuRMeomLiH7JzQTQdMA.jpeg)](https://medium.com/@jaypandit04?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------) [![Jay Pandit](https://miro.medium.com/v2/resize:fill:128:128/1flpEuRMeomLiH7JzQTQdMA.jpeg)](https://medium.com/@jaypandit04?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------) [Written by Jay Pandit](https://medium.com/@jaypandit04?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------) [55 followers](https://medium.com/@jaypandit04/followers?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------) ·[7 following](https://medium.com/@jaypandit04/following?source=post_page---post_author_info--5ac9e3e286ad---------------------------------------) Software Engineer at The LEGO Group. Focused on quantum computing applications and research. <https://www.linkedin.com/in/jay-pandit-4801/> ## No responses yet [Help](https://help.medium.com/hc/en-us?source=post_page-----5ac9e3e286ad---------------------------------------) [Status](https://medium.statuspage.io/?source=post_page-----5ac9e3e286ad---------------------------------------) [About](https://medium.com/about?autoplay=1&source=post_page-----5ac9e3e286ad---------------------------------------) [Careers](https://medium.com/jobs-at-medium/work-at-medium-959d1a85284e?source=post_page-----5ac9e3e286ad---------------------------------------) [Press](mailto:pressinquiries@medium.com) [Blog](https://blog.medium.com/?source=post_page-----5ac9e3e286ad---------------------------------------) [Privacy](https://policy.medium.com/medium-privacy-policy-f03bf92035c9?source=post_page-----5ac9e3e286ad---------------------------------------) [Rules](https://policy.medium.com/medium-rules-30e5502c4eb4?source=post_page-----5ac9e3e286ad---------------------------------------) [Terms](https://policy.medium.com/medium-terms-of-service-9db0094a1e0f?source=post_page-----5ac9e3e286ad---------------------------------------) [Text to speech](https://speechify.com/medium?source=post_page-----5ac9e3e286ad---------------------------------------)
Readable Markdown	null
ML Classification
ML Categories	null
ML Page Types	null
ML Intent Types	null
Content Metadata
Language	en
Author	Jay Pandit
Publish Time	2025-05-06 06:01:03 (11 months ago)
Original Publish Time	2025-05-06 06:01:03 (11 months ago)
Republished	No
Word Count (Total)	970
Word Count (Content)	703
Links
External Links	4
Internal Links	29
Technical SEO
Meta Nofollow	No
Meta Noarchive	Yes
JS Rendered	No
Redirect Target	null
Performance
Download Time (ms)	980
TTFB (ms)	978
Download Size (bytes)	32,687
Shard	77 (laksa)
Root Hash	13179037029838926277
Unparsed URL	com,medium!/quantum-computing-series/quantum-superposition-5ac9e3e286ad s443