# Itachi Quantum Studio

> High-performance quantum computing simulation suite engineered in C++20 with exact StateVector, MPS tensor network, Stabilizer Clifford, and Density Matrix engines, featuring real-time 3D Bloch sphere telemetry, Surface-17 QEC, and hybrid VQA. Engineered by Sahastranshu.

## Interactive Simulation Tools

- [Itachi Quantum Studio](https://itachi-quantum.onrender.com/): Unified interactive quantum computing studio and simulation space
- [Quantum Circuit Builder](https://itachi-quantum.onrender.com/circuit): Drag-and-drop multi-qubit circuit editor with OpenQASM 2.0/3.0 interoperability
- [3D Bloch Sphere Visualizer](https://itachi-quantum.onrender.com/bloch): Real-time single-qubit quantum statevector WebGL telemetry
- [Measurement Probability Analyzer](https://itachi-quantum.onrender.com/probability): State amplitudes, phase angles, and Monte Carlo shot statistics
- [State & Density Diagnostics](https://itachi-quantum.onrender.com/results): Density matrix heatmaps and von Neumann entanglement entropy
- [Topological QEC Visualizer](https://itachi-quantum.onrender.com/qec): Surface-17 lattice error correction with MWPM decoding
- [VQA & Chemistry Studio](https://itachi-quantum.onrender.com/vqa): Variational Quantum Eigensolver (VQE) and QAOA MaxCut optimization
- [Microwave Pulse Studio](https://itachi-quantum.onrender.com/pulse): Transmon RF drive and DRAG pulse shaping
- [QML Neural Playground](https://itachi-quantum.onrender.com/qml): Quantum neural network classifier with ZZ Feature Maps
- [Magic State Distillation](https://itachi-quantum.onrender.com/magic-state): 15-to-1 Bravyi-Kitaev T-state purification factory
- [Circuit Optimizer & Routing](https://itachi-quantum.onrender.com/optimizer): SABRE SWAP router for HeavyHex and Grid architectures
- [Canonical Quantum Algorithms](https://itachi-quantum.onrender.com/algorithms): Library of Bell states, GHZ, Teleportation, and Grover search

## Quantum Gates Knowledge Directory

- [Hadamard Gate (H)](https://itachi-quantum.onrender.com/gates/hadamard): The Hadamard gate (H) is a fundamental single-qubit quantum gate that maps the computational basis states |0⟩ and |1⟩ into equal superposition states (|0⟩ + |1⟩)/√2 and (|0⟩ - |1⟩)/√2, rotating the state vector by π radians around the (X+Z)/√2 axis on the Bloch sphere.
- [Pauli-X Gate (Bit-Flip)](https://itachi-quantum.onrender.com/gates/pauli-x): The Pauli-X gate is the quantum equivalent of the classical NOT gate. It flips a qubit from |0⟩ to |1⟩ and from |1⟩ to |0⟩, executing a π-radian (180°) rotation around the X-axis of the Bloch sphere.
- [Pauli-Y Gate](https://itachi-quantum.onrender.com/gates/pauli-y): The Pauli-Y gate performs both a bit-flip and a phase-flip simultaneously with a factor of imaginary unit i: Y|0⟩ = i|1⟩ and Y|1⟩ = -i|0⟩. It represents a 180° rotation around the Y-axis of the Bloch sphere.
- [Pauli-Z Gate (Phase-Flip)](https://itachi-quantum.onrender.com/gates/pauli-z): The Pauli-Z gate leaves the computational state |0⟩ unchanged while shifting the phase of state |1⟩ by π radians: Z|0⟩ = |0⟩ and Z|1⟩ = -|1⟩. It executes a 180° rotation around the Z-axis of the Bloch sphere.
- [Phase Gate (S Gate)](https://itachi-quantum.onrender.com/gates/phase-s): The Phase gate (S gate) is the square root of the Pauli-Z gate (S² = Z). It introduces a relative phase shift of π/2 (90°) on state |1⟩: S|0⟩ = |0⟩ and S|1⟩ = i|1⟩, rotating the state vector by 90° around the Z-axis.
- [T Gate (π/8 Gate)](https://itachi-quantum.onrender.com/gates/t-gate): The T gate applies a π/4 (45°) phase rotation to state |1⟩: T|0⟩ = |0⟩ and T|1⟩ = e^{iπ/4}|1⟩. Because it is non-Clifford (T⁴ = Z), adding the T gate to Clifford operations enables universal fault-tolerant quantum computing.
- [CNOT Gate (CX)](https://itachi-quantum.onrender.com/gates/cnot): The CNOT (Controlled-NOT or CX) gate is a fundamental 2-qubit entangling gate. If the control qubit is |1⟩, it flips the target qubit via Pauli-X; if the control is |0⟩, the target qubit remains unchanged.
- [Controlled-Z Gate (CZ)](https://itachi-quantum.onrender.com/gates/cz): The Controlled-Z (CZ) gate is a symmetric 2-qubit entangling gate that inverts the phase of the |11⟩ state by π radians while leaving |00⟩, |01⟩, and |10⟩ unaltered. Because it is symmetric, either qubit can act as the control.
- [SWAP Gate](https://itachi-quantum.onrender.com/gates/swap): The SWAP gate exchanges the quantum states of two qubits: SWAP|a, b⟩ = |b, a⟩. It decomposes into three alternating CNOT gates: CX(a, b) · CX(b, a) · CX(a, b) and is vital for routing circuits on non-all-to-all chip topologies.
- [iSWAP Gate](https://itachi-quantum.onrender.com/gates/iswap): The iSWAP gate exchanges the states of two qubits while imparting an imaginary phase factor i to the |01⟩ and |10⟩ transitions. It is a native two-qubit gate in direct-coupled superconducting transmon processors.
- [Toffoli Gate (CCX)](https://itachi-quantum.onrender.com/gates/toffoli): The Toffoli gate (Controlled-Controlled-NOT or CCX) is a 3-qubit gate that flips the target qubit if and only if both control qubits are in state |1⟩: CCX|c1, c2, t⟩ = |c1, c2, t ⊕ (c1 · c2)⟩. It is universal for reversible classical computation.
- [Fredkin Gate (CSWAP)](https://itachi-quantum.onrender.com/gates/fredkin): The Fredkin gate (Controlled-SWAP or CSWAP) is a 3-qubit gate that exchanges the states of two target qubits if and only if the control qubit is |1⟩. It is conservative, meaning it strictly preserves the total number of 1s (Hamming weight).
- [Parametric Rotation Gates (Rx, Ry, Rz)](https://itachi-quantum.onrender.com/gates/rotation-gates): Parametric rotation gates Rx(θ), Ry(θ), and Rz(θ) rotate a single-qubit state vector by an arbitrary continuous angle θ around the X, Y, and Z Cartesian axes of the Bloch sphere, forming the primary parameterization in VQE and QML circuits.
- [Arbitrary Single-Qubit Gate (U3)](https://itachi-quantum.onrender.com/gates/u3-gate): The U3 gate is the most general single-qubit unitary operator, parameterized by three Euler angles (θ, φ, λ). It can transform any point on the Bloch sphere into any other arbitrary quantum state.
- [Quantum Measurement & Reset Operations](https://itachi-quantum.onrender.com/gates/measurement-reset): Quantum measurement projects a continuous superposition state into one of the discrete basis states (|0⟩ or |1⟩) according to the Born rule P(i) = |⟨i|ψ⟩|², irreversibly collapsing the wavefunction. Reset forces the qubit back to |0⟩.
- [Phase Gate P(λ)](https://itachi-quantum.onrender.com/gates/phase-p): The Phase gate P(λ) imparts a continuous phase shift of e^{iλ} exclusively to the |1⟩ state while preserving |0⟩. It is equivalent to an Rz rotation up to a global phase of e^{iλ/2}.

## Quantum Algorithms Matrix

- [Shor's Algorithm](https://itachi-quantum.onrender.com/algorithms/shors-algorithm): Shor's algorithm is a quantum algorithm that factors integers in polynomial time O((log N)³), providing an exponential speedup over the best classical algorithm (General Number Field Sieve). It solves order-finding using the Quantum Fourier Transform.
- [Grover's Algorithm](https://itachi-quantum.onrender.com/algorithms/grovers-search): Grover's algorithm finds a marked target in an unsorted database of N items in O(√N) queries, offering a provable quadratic speedup over the classical O(N) lower bound. It works by iteratively rotating state vectors toward the target via amplitude amplification.
- [Quantum Phase Estimation (QPE)](https://itachi-quantum.onrender.com/algorithms/quantum-phase-estimation): Quantum Phase Estimation (QPE) calculates the unknown phase θ of a unitary operator's eigenvalue U|u⟩ = e^{2πiθ}|u⟩ to n bits of precision using ancilla qubits, controlled-U^{2^j} powers, and the Inverse Quantum Fourier Transform (IQFT).
- [Quantum Fourier Transform (QFT)](https://itachi-quantum.onrender.com/algorithms/quantum-fourier-transform): The Quantum Fourier Transform (QFT) performs a discrete Fourier transform on quantum amplitudes, mapping basis state |j⟩ to an equal superposition of phase-encoded basis states in O(n²) quantum gates compared to classical FFT O(n 2ⁿ).
- [Variational Quantum Eigensolver (VQE)](https://itachi-quantum.onrender.com/algorithms/variational-quantum-eigensolver): The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm designed for NISQ computers that finds the ground state energy of a molecular Hamiltonian by variationally updating ansatz parameters using classical optimizers.
- [QAOA (Quantum Approximate Optimization)](https://itachi-quantum.onrender.com/algorithms/qaoa): The Quantum Approximate Optimization Algorithm (QAOA) solves combinatorial optimization problems like MaxCut by alternating between a problem-cost Hamiltonian H_C(γ) and a transverse mixer Hamiltonian H_M(β) to converge toward optimal bitstrings.
- [Deutsch-Jozsa Algorithm](https://itachi-quantum.onrender.com/algorithms/deutsch-jozsa): The Deutsch-Jozsa algorithm determines whether a black-box Boolean function f: {0,1}^n → {0,1} is constant (returns all 0s or all 1s) or balanced (returns 0 for half and 1 for half) in exactly 1 quantum query, compared to 2^{n-1}+1 classical queries.
- [Bernstein-Vazirani Algorithm](https://itachi-quantum.onrender.com/algorithms/bernstein-vazirani): The Bernstein-Vazirani algorithm discovers an unknown secret n-bit string s encoded in a function f(x) = s · x mod 2 using just a single quantum query (O(1)), whereas classical algorithms require at least n queries.
- [Simon's Algorithm](https://itachi-quantum.onrender.com/algorithms/simons-algorithm): Simon's algorithm finds a hidden period s for a 2-to-1 function f(x) = f(y) ⇔ x ⊕ y ∈ {0^n, s} in O(n) quantum queries, providing an exponential speedup over classical algorithms that require O(2^{n/2}) queries.
- [Quantum Teleportation Protocol](https://itachi-quantum.onrender.com/algorithms/quantum-teleportation): Quantum teleportation transmits an unknown quantum state |ψ⟩ from a sender (Alice) to a receiver (Bob) using a pre-shared entangled Bell pair and 2 classical bits of communication without physically moving the qubit or violating the no-cloning theorem.
- [Superdense Coding](https://itachi-quantum.onrender.com/algorithms/superdense-coding): Superdense coding enables a sender to transmit two classical bits of information to a receiver by sending only a single physical qubit, doubling the channel capacity by utilizing a pre-shared entangled Bell pair.
- [BB84 Quantum Key Distribution (QKD)](https://itachi-quantum.onrender.com/algorithms/bb84-qkd): BB84 is the pioneering Quantum Key Distribution (QKD) protocol devised by Bennett and Brassard in 1984. It uses conjugate measurement bases (+ and ×) and the no-cloning theorem to generate provably secure cryptographic keys immune to computational attacks.

## Quantum Error Correction (QEC) Library

- [Surface Code](https://itachi-quantum.onrender.com/qec/surface-code): The Surface Code is the leading 2D topological quantum error-correcting architecture for superconducting and neutral-atom processors, featuring a high fault-tolerant error threshold of ~1% and requiring only nearest-neighbor physical qubit interactions.
- [Surface-17 QEC Lattice](https://itachi-quantum.onrender.com/qec/surface-17): Surface-17 is a distance-3 (d=3) rotated surface code comprising 9 data qubits and 8 syndrome ancilla qubits (4 X-plaquettes and 4 Z-plaquettes) capable of correcting any single arbitrary physical qubit error (bit-flip or phase-flip).
- [Steane [[7,1,3]] Code](https://itachi-quantum.onrender.com/qec/steane-code): The Steane [[7,1,3]] code is a Calderbank-Shor-Steane (CSS) quantum error-correcting code that encodes 1 logical qubit into 7 physical qubits. It corrects any arbitrary single-qubit error and permits transversal implementation of all Clifford gates (H, S, CNOT).
- [Shor 9-Qubit Code](https://itachi-quantum.onrender.com/qec/shor-code): The Shor 9-qubit code, introduced in 1995, was the first demonstrated quantum error-correcting code. It concatenates a 3-qubit phase-flip code with a 3-qubit bit-flip code, protecting 1 logical qubit against any single physical X, Y, or Z error.
- [Minimum-Weight Perfect Matching (MWPM)](https://itachi-quantum.onrender.com/qec/mwpm-decoder): Minimum-Weight Perfect Matching (MWPM) is the standard graph-based syndrome decoding algorithm for surface codes. It pairs defect plaquettes by minimizing total graph distance using Edmonds' Blossom algorithm in O(V³) time.
- [Stabilizer Formalism](https://itachi-quantum.onrender.com/qec/stabilizers): The Stabilizer Formalism defines quantum codes by an abelian subgroup S of the n-qubit Pauli group that fixes the code space: S|ψ⟩ = |ψ⟩ for all code states. It allows n-qubit states to be represented with O(n²) classical bits.
- [Fault-Tolerant Threshold Theorem](https://itachi-quantum.onrender.com/qec/fault-tolerant-threshold): The Fault-Tolerant Threshold Theorem proves that if physical gate and measurement error rates remain below a critical threshold p_th (~1% for surface codes), arbitrary quantum computations can be executed with arbitrarily low logical error rates.
- [Magic State Distillation](https://itachi-quantum.onrender.com/qec/magic-state-distillation): Magic State Distillation is a protocol that purifies multiple copies of noisy non-Clifford states (such as |T⟩ = (|0⟩ + e^{iπ/4}|1⟩)/√2) into fewer copies with significantly higher fidelity using only Clifford operations and syndrome measurement.

## Hardware & Physical Implementations

- [Superconducting Transmon Qubits](https://itachi-quantum.onrender.com/hardware/transmon-qubits): A transmon qubit is a superconducting charge qubit shunted by a large capacitor that operates in the E_J/E_C ≫ 1 regime to exponentially reduce sensitivity to charge noise while maintaining sufficient anharmonicity to isolate the 0 and 1 energy levels.
- [Trapped Ion Quantum Computing](https://itachi-quantum.onrender.com/hardware/trapped-ions): Trapped ion quantum computers trap individual atomic ions (such as 171Yb+ or 40Ca+) in electromagnetic Paul traps in ultra-high vacuum, manipulating quantum states with laser beams and achieving all-to-all connectivity via shared motional phonon modes.
- [Neutral Atom Quantum Computing](https://itachi-quantum.onrender.com/hardware/neutral-atoms): Neutral atom quantum processors arrange neutral atoms (Rubidium, Cesium, Strontium) in 2D/3D arrays of optical tweezers, creating fast two-qubit entanglement via the Rydberg blockade mechanism where laser excitation to high principal quantum numbers prevents neighboring excitation.
- [DRAG Pulse Shaping](https://itachi-quantum.onrender.com/hardware/drag-pulsing): Derivative Removal by Adiabatic Gate (DRAG) is a microwave pulse shaping technique that adds a derivative of the in-phase Gaussian envelope onto the quadrature channel (Y) to suppress state leakage into the non-computational |2⟩ state of weakly anharmonic transmons.
- [T1 Relaxation & T2 Dephasing](https://itachi-quantum.onrender.com/hardware/t1-t2-decoherence): T1 (longitudinal relaxation time) is the timescale over which a qubit decays from |1⟩ to |0⟩ due to energy dissipation, while T2 (transverse coherence time) is the timescale over which quantum superposition phase coherence is lost: 1/T2 = 1/(2T1) + 1/T_φ.
- [Lindblad Master Equation](https://itachi-quantum.onrender.com/hardware/lindblad-master-equation): The Lindblad Master Equation describes the Markovian non-unitary time evolution of an open quantum system's density matrix ρ coupled to an external thermal environment through Hamiltonian dynamics and dissipative jump operators L_k.
- [Quantum Chip Topologies](https://itachi-quantum.onrender.com/hardware/quantum-chip-topologies): Quantum chip topologies define the physical coupling graph between qubits on a quantum processor. Sparse graphs like IBM's HeavyHex minimize frequency collisions and parasitic crosstalk at the cost of requiring SWAP routing for distant entangling gates.
- [Circuit Quantum Electrodynamics (cQED)](https://itachi-quantum.onrender.com/hardware/cavity-qed): Circuit Quantum Electrodynamics (cQED) is the study of quantum optics realized with superconducting artificial atoms (transmons) coupled to microwave coplanar waveguide resonators governed by the Jaynes-Cummings Hamiltonian.

## Concepts & Mathematics Glossary

- [Quantum Superposition](https://itachi-quantum.onrender.com/glossary/quantum-superposition): Quantum superposition is the fundamental principle stating that a quantum system can exist simultaneously in a linear combination of multiple orthogonal basis states, represented as |ψ⟩ = α|0⟩ + β|1⟩ where |α|² + |β|² = 1.
- [Quantum Entanglement](https://itachi-quantum.onrender.com/glossary/quantum-entanglement): Quantum entanglement is a phenomenon where composite quantum states cannot be factored into a tensor product of their individual subsystem states (|ψ⟩ ≠ |ψ_A⟩ ⊗ |ψ_B⟩), resulting in instantaneous physical correlations that defy classical local realism.
- [The Born Rule](https://itachi-quantum.onrender.com/glossary/born-rule): Formulated by Max Born in 1926, the Born rule states that the probability of obtaining measurement outcome |i⟩ from a quantum state |ψ⟩ = ∑ c_i |i⟩ equals the absolute square of its complex probability amplitude: P(i) = |c_i|².
- [Density Matrix Formalism](https://itachi-quantum.onrender.com/glossary/density-matrix): The Density Matrix (or density operator) ρ describes statistical ensembles of pure and mixed quantum states: ρ = ∑ p_i |ψ_i⟩⟨ψ_i|. A state is pure if and only if Tr(ρ²) = 1, and mixed if Tr(ρ²) < 1.
- [Bloch Sphere Telemetry](https://itachi-quantum.onrender.com/glossary/bloch-sphere): The Bloch sphere is a 3D unit sphere that geometrically maps any 2-level quantum state |ψ⟩ = cos(θ/2)|0⟩ + e^{iφ}sin(θ/2)|1⟩ to coordinates on or within its surface: r = (sin θ cos φ, sin θ sin φ, cos θ).
- [Bell's Theorem & CHSH Inequality](https://itachi-quantum.onrender.com/glossary/bells-theorem): Bell's Theorem proves that no physical theory of local hidden variables can reproduce the statistical predictions of quantum mechanics. Quantum entanglement violates the classical CHSH inequality |S| ≤ 2, reaching the Tsirelson bound |S| = 2√2 ≈ 2.828.
- [No-Cloning Theorem](https://itachi-quantum.onrender.com/glossary/no-cloning-theorem): Formulated by Wootters, Zurek, and Dieks in 1982, the No-Cloning Theorem states that it is impossible to create an identical independent copy of an arbitrary unknown quantum state through any unitary operation due to the linearity of quantum mechanics.
- [Matrix Product States (MPS)](https://itachi-quantum.onrender.com/glossary/matrix-product-states): Matrix Product States (MPS) is a tensor network ansatz that decomposes a 2^N quantum statevector into a 1D chain of N 3-index tensors, enabling exact and truncated classical simulation of 100+ qubits for quantum systems with 1D area-law entanglement.
- [Gottesman-Knill Theorem](https://itachi-quantum.onrender.com/glossary/gottesman-knill-theorem): The Gottesman-Knill theorem proves that any quantum circuit composed exclusively of Clifford group operations (H, S, CNOT), initialized in computational basis states, and measured in the Pauli-Z basis can be simulated in polynomial time O(n²) on classical computers.
- [Quantum Supremacy & Advantage](https://itachi-quantum.onrender.com/glossary/quantum-supremacy): Quantum Supremacy (or Quantum Computational Advantage) is the experimental milestone demonstrating that a programmable quantum device can solve a well-defined computational problem (such as Random Circuit Sampling) faster than any existing classical supercomputer.
- [OpenQASM Specification](https://itachi-quantum.onrender.com/glossary/openqasm): OpenQASM (Open Quantum Assembly Language) is an intermediate representation for quantum computing that specifies quantum circuits, gate operations, classical control flow, and real-time timing constraints across hardware backends.
- [Parameter-Shift Rule](https://itachi-quantum.onrender.com/glossary/parameter-shift-rule): The Parameter-Shift Rule is a technique for computing the exact analytical gradient of a parameterized quantum expectation value ⟨H⟩(θ) by evaluating the quantum circuit at two shifted parameter points (θ + π/2 and θ - π/2).
- [Hilbert Space (ℋ)](https://itachi-quantum.onrender.com/glossary/hilbert-space): Hilbert Space (ℋ) is a complete, complex inner product vector space that contains all possible quantum states of a physical system. For an n-qubit quantum register, the Hilbert space dimension scales exponentially as dim(ℋ) = 2^n.
- [Dirac Bra-Ket Notation](https://itachi-quantum.onrender.com/glossary/dirac-notation): Introduced by Paul Dirac in 1939, Bra-Ket notation represents quantum state vectors as kets |ψ⟩ (column vectors) and their complex conjugate duals as bras ⟨φ| = |φ⟩† (row vectors). Their inner product ⟨φ|ψ⟩ yields a scalar probability amplitude.
- [Quantum Volume (QV)](https://itachi-quantum.onrender.com/glossary/quantum-volume): Quantum Volume (QV) is a hardware-agnostic metric developed by IBM that measures the overall computational power of a quantum processor by quantifying the largest square circuit (width m = depth d) the machine can execute successfully (log₂ QV = m).
- [Quantum State & Gate Fidelity](https://itachi-quantum.onrender.com/glossary/quantum-fidelity): Quantum state fidelity F(ρ, σ) measures the statistical distance between two quantum states, ranging from 0 (completely orthogonal) to 1 (identical states). For pure states, it equals the squared overlap: F(|ψ⟩, |φ⟩) = |⟨ψ|φ⟩|².

## Developer & Attribution

- [Creator LinkedIn](https://www.linkedin.com/in/sunnydevji/): Official profile of Sahastranshu, Lead Architect
- [Product Hunt Launch](https://www.producthunt.com/products/itachi-quantum-studio): Official Product Hunt profile
- [Developer Identity](https://itachi-quantum.onrender.com/identity.json): Machine-readable author verification schema
- [XML Sitemap](https://itachi-quantum.onrender.com/sitemap.xml): Canonical multi-sitemap covering 79+ URLs