{
  "slug": "quantum-computing-advanced",
  "title": "Advanced Quantum Computing",
  "domain_slug": "quantum-computing",
  "subdomain_slug": null,
  "difficulty": "expert",
  "tags": ["qubits", "entanglement", "superposition", "shors-algorithm", "grovers-algorithm", "quantum-gates"],
  "is_free": false,
  "token_count": 2980,
  "uncompressed_estimate": 3520,
  "savings_pct": 15.3,
  "rosetta": "[DECODE] qc=quantum computing|qb=qubit|sup=superposition|ent=entanglement|alg=algorithm|meas=measurement|prob=probability|amp=amplitude|int=interference|gate=quantum logic gate|state=quantum state|sys=system|comp=computation|class=classical|crypt=cryptography|err=error correction",
  "content_compressed": "# qc Knowledge Pack\n\n## Fundamentals of qc\nUnlike class comp which uses bits (0 or 1), qc uses quantum bits (qbs). A qb can represent 0, 1, or both simultaneously due to quantum phenomena, enabling qc to solve certain complex problems exponentially faster than class supercomputers.\n\n### sup\nThe principle that a qb exists in a linear combination of states until meas. \n- Mathematically represented as `|ψ⟩ = α|0⟩ + β|1⟩`, where α and β are complex prob amps. The sum of their absolute squares (`|α|^2 + |β|^2`) must equal 1.\n- Upon meas, the qb's state collapses to either 0 (with prob `|α|^2`) or 1 (with prob `|β|^2`).\n- Crucially, sup allows a qc with N qbs to represent `2^N` states simultaneously. A 300-qb sys can represent more states than there are atoms in the observable universe.\n\n### ent\nA quantum phenomenon where two or more qbs become fundamentally linked. \n- If two qbs are entangled, measuring the state of one instantaneously determines the state of the other, regardless of the physical distance between them (Einstein's \"spooky action at a distance\").\n- This allows qbs to share information instantly and serves as the backbone for quantum teleportation and exponential computational speedups.\n\n### int\nQuantum amps are complex numbers and can exhibit int. \n- **Constructive int**: Correct answers have their prob amps amplified.\n- **Destructive int**: Incorrect answers have their prob amps cancel each other out.\n- The goal of every quantum alg is to choreograph the gates so that the wrong answers destructively interfere (approaching 0 prob) and the correct answer constructively interferes (approaching 100% prob) before meas.\n\n## quantum-gates\nUnlike class logic gates (AND, OR, NOT), quantum gates are reversible and represented by unitary matrices acting on qb state vectors.\n\n- **Pauli-X (X)**: The quantum equivalent of the class NOT gate. Flips `|0⟩` to `|1⟩` and vice versa. It rotates the state by π radians around the X-axis of the Bloch sphere.\n- **Pauli-Y (Y) & Pauli-Z (Z)**: Rotations around the Y and Z axes. The Z gate flips the phase of the `|1⟩` state without changing the probs (leaves `|0⟩` alone, changes `|1⟩` to `-|1⟩`).\n- **Hadamard (H)**: The gate that creates sup. Applying H to `|0⟩` yields an equal sup of `|0⟩` and `|1⟩` (often denoted as `|+⟩`). Applying H twice returns the state to the original.\n- **CNOT (Controlled-NOT)**: A two-qb gate crucial for ent. It applies an X gate to the target qb *if and only if* the control qb is in state `|1⟩`.\n\n## Breakthrough quantum algs\n\n### Shor's alg (1994)\nA polynomial-time quantum alg for integer factorization. \n- **The Class Problem**: Factoring a 2048-bit number (the basis of RSA crypt used to secure the internet) would take a class supercomputer millions of years. It's an exponentially hard problem.\n- **The Quantum Solution**: Shor's alg uses Quantum Phase Estimation and the Quantum Fourier Transform to find the period of a modular exponential function, which directly yields the prime factors.\n- **Impact**: A sufficiently large, fault-tolerant qc running Shor's alg will break RSA, Diffie-Hellman, and Elliptic Curve crypt completely in a matter of hours. This threat has spawned the field of Post-Quantum crypt (PQC).\n\n### Grover's alg (1996)\nA quantum alg for searching an unsorted database.\n- **The Class Problem**: Searching an unsorted list of N items takes O(N) time (you have to check every item).\n- **The Quantum Solution**: Grover's alg uses amp amplification to find the target item in O(√N) time.\n- **Impact**: While not an exponential speedup like Shor's, a quadratic speedup is massive for large datasets. It also halves the effective key length of symmetric block ciphers like AES. AES-256 is required to provide the equivalent security against a quantum attacker that AES-128 provides against a class attacker.\n\n## Hardware and Challenges\n\n### Decoherence and err\nqbs are extremely fragile. Interaction with the environment (heat, electromagnetic radiation) causes them to lose their quantum state (decoherence) before the comp finishes.\n- **NISQ Era**: We are currently in the Noisy Intermediate-Scale Quantum era. Modern qcs have 50-1000 noisy qbs without err.\n- **err**: To build a fault-tolerant qc, we need err. This requires encoding one \"logical\" qb into hundreds or thousands of \"physical\" qbs. A 100-logical-qb machine might require 100,000 physical qbs to operate reliably. Creating stable surface codes and topological qbs (like Majorana fermions) are major areas of research.\n\n### Modalities\nVarious physical systems are used to construct qbs, each with pros and cons:\n1. **Superconducting Circuits** (IBM, Google): Fast operation, but must be cooled to near absolute zero (~15 milliKelvin).\n2. **Trapped Ions** (Quantinuum, IonQ): Individual atoms trapped by electromagnetic fields. Very long coherence times and high fidelity, but slower gate operations and harder to scale than solid-state chips.\n3. **Photonic** (PsiQuantum): Uses photons. Can operate at room temperature and is easily networked (quantum internet), but difficult to perform two-qb gates probabilistically.\n4. **Silicon Spin qbs** (Intel): Leverages existing semiconductor manufacturing to isolate the spin of a single electron in silicon. High potential for massive scalability."
}