[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M79XVR53XA3FS5PS45WBW8DE":3,"skill-same:01M79XVR53XA3FS5PS45WBW8DE":65},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":13,"repositoryHtmlUrl":26,"repositoryHomepageUrl":6,"ownerHtmlUrl":27,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":28,"install":29,"resources":42},"01M79XVR53XA3FS5PS45WBW8DE","qutip",null,"Quantum mechanics simulations and analysis using QuTiP (Quantum Toolbox in Python). Use when working with quantum systems including: (1) quantum states (kets, bras, density matrices), (2) quantum operators and gates, (3) time evolution and dynamics (Schrödinger, master equations, Monte Carlo), (4) open quantum systems with dissipation, (5) quantum measurements and entanglement, (6) visualization (Bloch sphere, Wigner functions), (7) steady states and correlation functions, or (8) advanced methods (Floquet theory, HEOM, stochastic solvers). Handles both closed and open quantum systems across various domains including quantum optics, quantum computing, and condensed matter physics.","KrismithReddy12\u002Fclaude-code-templates","KrismithReddy12","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F182916557?v=4","01M79T8DNGJRHG48G3H3Q02MK8","01M79TA8ZWV2PP7R4ARWVYWZFE",0,"MIT","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: qutip\ndescription: \"Quantum mechanics simulations and analysis using QuTiP (Quantum Toolbox in Python). Use when working with quantum systems including: (1) quantum states (kets, bras, density matrices), (2) quantum operators and gates, (3) time evolution and dynamics (Schrödinger, master equations, Monte Carlo), (4) open quantum systems with dissipation, (5) quantum measurements and entanglement, (6) visualization (Bloch sphere, Wigner functions), (7) steady states and correlation functions, or (8) advanced methods (Floquet theory, HEOM, stochastic solvers). Handles both closed and open quantum systems across various domains including quantum optics, quantum computing, and condensed matter physics.\"\n---\n\n# QuTiP: Quantum Toolbox in Python\n\n## Overview\n\nQuTiP provides comprehensive tools for simulating and analyzing quantum mechanical systems. It handles both closed (unitary) and open (dissipative) quantum systems with multiple solvers optimized for different scenarios.\n\n## Installation\n\n```bash\nuv pip install qutip\n```\n\nOptional packages for additional functionality:\n\n```bash\n# Quantum information processing (circuits, gates)\nuv pip install qutip-qip\n\n# Quantum trajectory viewer\nuv pip install qutip-qtrl\n```\n\n## Quick Start\n\n```python\nfrom qutip import *\nimport numpy as np\nimport matplotlib.pyplot as plt\n\n# Create quantum state\npsi = basis(2, 0)  # |0⟩ state\n\n# Create operator\nH = sigmaz()  # Hamiltonian\n\n# Time evolution\ntlist = np.linspace(0, 10, 100)\nresult = sesolve(H, psi, tlist, e_ops=[sigmaz()])\n\n# Plot results\nplt.plot(tlist, result.expect[0])\nplt.xlabel('Time')\nplt.ylabel('⟨σz⟩')\nplt.show()\n```\n\n## Core Capabilities\n\n### 1. Quantum Objects and States\n\nCreate and manipulate quantum states and operators:\n\n```python\n# States\npsi = basis(N, n)  # Fock state |n⟩\npsi = coherent(N, alpha)  # Coherent state |α⟩\nrho = thermal_dm(N, n_avg)  # Thermal density matrix\n\n# Operators\na = destroy(N)  # Annihilation operator\nH = num(N)  # Number operator\nsx, sy, sz = sigmax(), sigmay(), sigmaz()  # Pauli matrices\n\n# Composite systems\npsi_AB = tensor(psi_A, psi_B)  # Tensor product\n```\n\n**See** `references\u002Fcore_concepts.md` for comprehensive coverage of quantum objects, states, operators, and tensor products.\n\n### 2. Time Evolution and Dynamics\n\nMultiple solvers for different scenarios:\n\n```python\n# Closed systems (unitary evolution)\nresult = sesolve(H, psi0, tlist, e_ops=[num(N)])\n\n# Open systems (dissipation)\nc_ops = [np.sqrt(0.1) * destroy(N)]  # Collapse operators\nresult = mesolve(H, psi0, tlist, c_ops, e_ops=[num(N)])\n\n# Quantum trajectories (Monte Carlo)\nresult = mcsolve(H, psi0, tlist, c_ops, ntraj=500, e_ops=[num(N)])\n```\n\n**Solver selection guide:**\n- `sesolve`: Pure states, unitary evolution\n- `mesolve`: Mixed states, dissipation, general open systems\n- `mcsolve`: Quantum jumps, photon counting, individual trajectories\n- `brmesolve`: Weak system-bath coupling\n- `fmmesolve`: Time-periodic Hamiltonians (Floquet)\n\n**See** `references\u002Ftime_evolution.md` for detailed solver documentation, time-dependent Hamiltonians, and advanced options.\n\n### 3. Analysis and Measurement\n\nCompute physical quantities:\n\n```python\n# Expectation values\nn_avg = expect(num(N), psi)\n\n# Entropy measures\nS = entropy_vn(rho)  # Von Neumann entropy\nC = concurrence(rho)  # Entanglement (two qubits)\n\n# Fidelity and distance\nF = fidelity(psi1, psi2)\nD = tracedist(rho1, rho2)\n\n# Correlation functions\ncorr = correlation_2op_1t(H, rho0, taulist, c_ops, A, B)\nw, S = spectrum_correlation_fft(taulist, corr)\n\n# Steady states\nrho_ss = steadystate(H, c_ops)\n```\n\n**See** `references\u002Fanalysis.md` for entropy, fidelity, measurements, correlation functions, and steady state calculations.\n\n### 4. Visualization\n\nVisualize quantum states and dynamics:\n\n```python\n# Bloch sphere\nb = Bloch()\nb.add_states(psi)\nb.show()\n\n# Wigner function (phase space)\nxvec = np.linspace(-5, 5, 200)\nW = wigner(psi, xvec, xvec)\nplt.contourf(xvec, xvec, W, 100, cmap='RdBu')\n\n# Fock distribution\nplot_fock_distribution(psi)\n\n# Matrix visualization\nhinton(rho)  # Hinton diagram\nmatrix_histogram(H.full())  # 3D bars\n```\n\n**See** `references\u002Fvisualization.md` for Bloch sphere animations, Wigner functions, Q-functions, and matrix visualizations.\n\n### 5. Advanced Methods\n\nSpecialized techniques for complex scenarios:\n\n```python\n# Floquet theory (periodic Hamiltonians)\nT = 2 * np.pi \u002F w_drive\nf_modes, f_energies = floquet_modes(H, T, args)\nresult = fmmesolve(H, psi0, tlist, c_ops, T=T, args=args)\n\n# HEOM (non-Markovian, strong coupling)\nfrom qutip.nonmarkov.heom import HEOMSolver, BosonicBath\nbath = BosonicBath(Q, ck_real, vk_real)\nhsolver = HEOMSolver(H_sys, [bath], max_depth=5)\nresult = hsolver.run(rho0, tlist)\n\n# Permutational invariance (identical particles)\npsi = dicke(N, j, m)  # Dicke states\nJz = jspin(N, 'z')  # Collective operators\n```\n\n**See** `references\u002Fadvanced.md` for Floquet theory, HEOM, permutational invariance, stochastic solvers, superoperators, and performance optimization.\n\n## Common Workflows\n\n### Simulating a Damped Harmonic Oscillator\n\n```python\n# System parameters\nN = 20  # Hilbert space dimension\nomega = 1.0  # Oscillator frequency\nkappa = 0.1  # Decay rate\n\n# Hamiltonian and collapse operators\nH = omega * num(N)\nc_ops = [np.sqrt(kappa) * destroy(N)]\n\n# Initial state\npsi0 = coherent(N, 3.0)\n\n# Time evolution\ntlist = np.linspace(0, 50, 200)\nresult = mesolve(H, psi0, tlist, c_ops, e_ops=[num(N)])\n\n# Visualize\nplt.plot(tlist, result.expect[0])\nplt.xlabel('Time')\nplt.ylabel('⟨n⟩')\nplt.title('Photon Number Decay')\nplt.show()\n```\n\n### Two-Qubit Entanglement Dynamics\n\n```python\n# Create Bell state\npsi0 = bell_state('00')\n\n# Local dephasing on each qubit\ngamma = 0.1\nc_ops = [\n    np.sqrt(gamma) * tensor(sigmaz(), qeye(2)),\n    np.sqrt(gamma) * tensor(qeye(2), sigmaz())\n]\n\n# Track entanglement\ndef compute_concurrence(t, psi):\n    rho = ket2dm(psi) if psi.isket else psi\n    return concurrence(rho)\n\ntlist = np.linspace(0, 10, 100)\nresult = mesolve(qeye([2, 2]), psi0, tlist, c_ops)\n\n# Compute concurrence for each state\nC_t = [concurrence(state.proj()) for state in result.states]\n\nplt.plot(tlist, C_t)\nplt.xlabel('Time')\nplt.ylabel('Concurrence')\nplt.title('Entanglement Decay')\nplt.show()\n```\n\n### Jaynes-Cummings Model\n\n```python\n# System parameters\nN = 10  # Cavity Fock space\nwc = 1.0  # Cavity frequency\nwa = 1.0  # Atom frequency\ng = 0.05  # Coupling strength\n\n# Operators\na = tensor(destroy(N), qeye(2))  # Cavity\nsm = tensor(qeye(N), sigmam())  # Atom\n\n# Hamiltonian (RWA)\nH = wc * a.dag() * a + wa * sm.dag() * sm + g * (a.dag() * sm + a * sm.dag())\n\n# Initial state: cavity in coherent state, atom in ground state\npsi0 = tensor(coherent(N, 2), basis(2, 0))\n\n# Dissipation\nkappa = 0.1  # Cavity decay\ngamma = 0.05  # Atomic decay\nc_ops = [np.sqrt(kappa) * a, np.sqrt(gamma) * sm]\n\n# Observables\nn_cav = a.dag() * a\nn_atom = sm.dag() * sm\n\n# Evolve\ntlist = np.linspace(0, 50, 200)\nresult = mesolve(H, psi0, tlist, c_ops, e_ops=[n_cav, n_atom])\n\n# Plot\nfig, axes = plt.subplots(2, 1, figsize=(8, 6), sharex=True)\naxes[0].plot(tlist, result.expect[0])\naxes[0].set_ylabel('⟨n_cavity⟩')\naxes[1].plot(tlist, result.expect[1])\naxes[1].set_ylabel('⟨n_atom⟩')\naxes[1].set_xlabel('Time')\nplt.tight_layout()\nplt.show()\n```\n\n## Tips for Efficient Simulations\n\n1. **Truncate Hilbert spaces**: Use smallest dimension that captures dynamics\n2. **Choose appropriate solver**: `sesolve` for pure states is faster than `mesolve`\n3. **Time-dependent terms**: String format (e.g., `'cos(w*t)'`) is fastest\n4. **Store only needed data**: Use `e_ops` instead of storing all states\n5. **Adjust tolerances**: Balance accuracy with computation time via `Options`\n6. **Parallel trajectories**: `mcsolve` automatically uses multiple CPUs\n7. **Check convergence**: Vary `ntraj`, Hilbert space size, and tolerances\n\n## Troubleshooting\n\n**Memory issues**: Reduce Hilbert space dimension, use `store_final_state` option, or consider Krylov methods\n\n**Slow simulations**: Use string-based time-dependence, increase tolerances slightly, or try `method='bdf'` for stiff problems\n\n**Numerical instabilities**: Decrease time steps (`nsteps` option), increase tolerances, or check Hamiltonian\u002Foperators are properly defined\n\n**Import errors**: Ensure QuTiP is installed correctly; quantum gates require `qutip-qip` package\n\n## References\n\nThis skill includes detailed reference documentation:\n\n- **`references\u002Fcore_concepts.md`**: Quantum objects, states, operators, tensor products, composite systems\n- **`references\u002Ftime_evolution.md`**: All solvers (sesolve, mesolve, mcsolve, brmesolve, etc.), time-dependent Hamiltonians, solver options\n- **`references\u002Fvisualization.md`**: Bloch sphere, Wigner functions, Q-functions, Fock distributions, matrix plots\n- **`references\u002Fanalysis.md`**: Expectation values, entropy, fidelity, entanglement measures, correlation functions, steady states\n- **`references\u002Fadvanced.md`**: Floquet theory, HEOM, permutational invariance, stochastic methods, superoperators, performance tips\n\n## External Resources\n\n- Documentation: https:\u002F\u002Fqutip.readthedocs.io\u002F\n- Tutorials: https:\u002F\u002Fqutip.org\u002Fqutip-tutorials\u002F\n- API Reference: https:\u002F\u002Fqutip.readthedocs.io\u002Fen\u002Fstable\u002Fapidoc\u002Fapidoc.html\n- GitHub: https:\u002F\u002Fgithub.com\u002Fqutip\u002Fqutip\n","# QuTiP: Quantum Toolbox in Python\n\n## Overview\n\nQuTiP provides comprehensive tools for simulating and analyzing quantum mechanical systems. It handles both closed (unitary) and open (dissipative) quantum systems with multiple solvers optimized for different scenarios.\n\n## Installation\n\n```bash\nuv pip install qutip\n```\n\nOptional packages for additional functionality:\n\n```bash\n# Quantum information processing (circuits, gates)\nuv pip install qutip-qip\n\n# Quantum trajectory viewer\nuv pip install qutip-qtrl\n```\n\n## Quick Start\n\n```python\nfrom qutip import *\nimport numpy as np\nimport matplotlib.pyplot as plt\n\n# Create quantum state\npsi = basis(2, 0)  # |0⟩ state\n\n# Create operator\nH = sigmaz()  # Hamiltonian\n\n# Time evolution\ntlist = np.linspace(0, 10, 100)\nresult = sesolve(H, psi, tlist, e_ops=[sigmaz()])\n\n# Plot results\nplt.plot(tlist, result.expect[0])\nplt.xlabel('Time')\nplt.ylabel('⟨σz⟩')\nplt.show()\n```\n\n## Core Capabilities\n\n### 1. Quantum Objects and States\n\nCreate and manipulate quantum states and operators:\n\n```python\n# States\npsi = basis(N, n)  # Fock state |n⟩\npsi = coherent(N, alpha)  # Coherent state |α⟩\nrho = thermal_dm(N, n_avg)  # Thermal density matrix\n\n# Operators\na = destroy(N)  # Annihilation operator\nH = num(N)  # Number operator\nsx, sy, sz = sigmax(), sigmay(), sigmaz()  # Pauli matrices\n\n# Composite systems\npsi_AB = tensor(psi_A, psi_B)  # Tensor product\n```\n\n**See** `references\u002Fcore_concepts.md` for comprehensive coverage of quantum objects, states, operators, and tensor products.\n\n### 2. Time Evolution and Dynamics\n\nMultiple solvers for different scenarios:\n\n```python\n# Closed systems (unitary evolution)\nresult = sesolve(H, psi0, tlist, e_ops=[num(N)])\n\n# Open systems (dissipation)\nc_ops = [np.sqrt(0.1) * destroy(N)]  # Collapse operators\nresult = mesolve(H, psi0, tlist, c_ops, e_ops=[num(N)])\n\n# Quantum trajectories (Monte Carlo)\nresult = mcsolve(H, psi0, tlist, c_ops, ntraj=500, e_ops=[num(N)])\n```\n\n**Solver selection guide:**\n- `sesolve`: Pure states, unitary evolution\n- `mesolve`: Mixed states, dissipation, general open systems\n- `mcsolve`: Quantum jumps, photon counting, individual trajectories\n- `brmesolve`: Weak system-bath coupling\n- `fmmesolve`: Time-periodic Hamiltonians (Floquet)\n\n**See** `references\u002Ftime_evolution.md` for detailed solver documentation, time-dependent Hamiltonians, and advanced options.\n\n### 3. Analysis and Measurement\n\nCompute physical quantities:\n\n```python\n# Expectation values\nn_avg = expect(num(N), psi)\n\n# Entropy measures\nS = entropy_vn(rho)  # Von Neumann entropy\nC = concurrence(rho)  # Entanglement (two qubits)\n\n# Fidelity and distance\nF = fidelity(psi1, psi2)\nD = tracedist(rho1, rho2)\n\n# Correlation functions\ncorr = correlation_2op_1t(H, rho0, taulist, c_ops, A, B)\nw, S = spectrum_correlation_fft(taulist, corr)\n\n# Steady states\nrho_ss = steadystate(H, c_ops)\n```\n\n**See** `references\u002Fanalysis.md` for entropy, fidelity, measurements, correlation functions, and steady state calculations.\n\n### 4. Visualization\n\nVisualize quantum states and dynamics:\n\n```python\n# Bloch sphere\nb = Bloch()\nb.add_states(psi)\nb.show()\n\n# Wigner function (phase space)\nxvec = np.linspace(-5, 5, 200)\nW = wigner(psi, xvec, xvec)\nplt.contourf(xvec, xvec, W, 100, cmap='RdBu')\n\n# Fock distribution\nplot_fock_distribution(psi)\n\n# Matrix visualization\nhinton(rho)  # Hinton diagram\nmatrix_histogram(H.full())  # 3D bars\n```\n\n**See** `references\u002Fvisualization.md` for Bloch sphere animations, Wigner functions, Q-functions, and matrix visualizations.\n\n### 5. Advanced Methods\n\nSpecialized techniques for complex scenarios:\n\n```python\n# Floquet theory (periodic Hamiltonians)\nT = 2 * np.pi \u002F w_drive\nf_modes, f_energies = floquet_modes(H, T, args)\nresult = fmmesolve(H, psi0, tlist, c_ops, T=T, args=args)\n\n# HEOM (non-Markovian, strong coupling)\nfrom qutip.nonmarkov.heom import HEOMSolver, BosonicBath\nbath = BosonicBath(Q, ck_real, vk_real)\nhsolver = HEOMSolver(H_sys, [bath], max_depth=5)\nresult = hsolver.run(rho0, tlist)\n\n# Permutational invariance (identical particles)\npsi = dicke(N, j, m)  # Dicke states\nJz = jspin(N, 'z')  # Collective operators\n```\n\n**See** `references\u002Fadvanced.md` for Floquet theory, HEOM, permutational invariance, stochastic solvers, superoperators, and performance optimization.\n\n## Common Workflows\n\n### Simulating a Damped Harmonic Oscillator\n\n```python\n# System parameters\nN = 20  # Hilbert space dimension\nomega = 1.0  # Oscillator frequency\nkappa = 0.1  # Decay rate\n\n# Hamiltonian and collapse operators\nH = omega * num(N)\nc_ops = [np.sqrt(kappa) * destroy(N)]\n\n# Initial state\npsi0 = coherent(N, 3.0)\n\n# Time evolution\ntlist = np.linspace(0, 50, 200)\nresult = mesolve(H, psi0, tlist, c_ops, e_ops=[num(N)])\n\n# Visualize\nplt.plot(tlist, result.expect[0])\nplt.xlabel('Time')\nplt.ylabel('⟨n⟩')\nplt.title('Photon Number Decay')\nplt.show()\n```\n\n### Two-Qubit Entanglement Dynamics\n\n```python\n# Create Bell state\npsi0 = bell_state('00')\n\n# Local dephasing on each qubit\ngamma = 0.1\nc_ops = [\n    np.sqrt(gamma) * tensor(sigmaz(), qeye(2)),\n    np.sqrt(gamma) * tensor(qeye(2), sigmaz())\n]\n\n# Track entanglement\ndef compute_concurrence(t, psi):\n    rho = ket2dm(psi) if psi.isket else psi\n    return concurrence(rho)\n\ntlist = np.linspace(0, 10, 100)\nresult = mesolve(qeye([2, 2]), psi0, tlist, c_ops)\n\n# Compute concurrence for each state\nC_t = [concurrence(state.proj()) for state in result.states]\n\nplt.plot(tlist, C_t)\nplt.xlabel('Time')\nplt.ylabel('Concurrence')\nplt.title('Entanglement Decay')\nplt.show()\n```\n\n### Jaynes-Cummings Model\n\n```python\n# System parameters\nN = 10  # Cavity Fock space\nwc = 1.0  # Cavity frequency\nwa = 1.0  # Atom frequency\ng = 0.05  # Coupling strength\n\n# Operators\na = tensor(destroy(N), qeye(2))  # Cavity\nsm = tensor(qeye(N), sigmam())  # Atom\n\n# Hamiltonian (RWA)\nH = wc * a.dag() * a + wa * sm.dag() * sm + g * (a.dag() * sm + a * sm.dag())\n\n# Initial state: cavity in coherent state, atom in ground state\npsi0 = tensor(coherent(N, 2), basis(2, 0))\n\n# Dissipation\nkappa = 0.1  # Cavity decay\ngamma = 0.05  # Atomic decay\nc_ops = [np.sqrt(kappa) * a, np.sqrt(gamma) * sm]\n\n# Observables\nn_cav = a.dag() * a\nn_atom = sm.dag() * sm\n\n# Evolve\ntlist = np.linspace(0, 50, 200)\nresult = mesolve(H, psi0, tlist, c_ops, e_ops=[n_cav, n_atom])\n\n# Plot\nfig, axes = plt.subplots(2, 1, figsize=(8, 6), sharex=True)\naxes[0].plot(tlist, result.expect[0])\naxes[0].set_ylabel('⟨n_cavity⟩')\naxes[1].plot(tlist, result.expect[1])\naxes[1].set_ylabel('⟨n_atom⟩')\naxes[1].set_xlabel('Time')\nplt.tight_layout()\nplt.show()\n```\n\n## Tips for Efficient Simulations\n\n1. **Truncate Hilbert spaces**: Use smallest dimension that captures dynamics\n2. **Choose appropriate solver**: `sesolve` for pure states is faster than `mesolve`\n3. **Time-dependent terms**: String format (e.g., `'cos(w*t)'`) is fastest\n4. **Store only needed data**: Use `e_ops` instead of storing all states\n5. **Adjust tolerances**: Balance accuracy with computation time via `Options`\n6. **Parallel trajectories**: `mcsolve` automatically uses multiple CPUs\n7. **Check convergence**: Vary `ntraj`, Hilbert space size, and tolerances\n\n## Troubleshooting\n\n**Memory issues**: Reduce Hilbert space dimension, use `store_final_state` option, or consider Krylov methods\n\n**Slow simulations**: Use string-based time-dependence, increase tolerances slightly, or try `method='bdf'` for stiff problems\n\n**Numerical instabilities**: Decrease time steps (`nsteps` option), increase tolerances, or check Hamiltonian\u002Foperators are properly defined\n\n**Import errors**: Ensure QuTiP is installed correctly; quantum gates require `qutip-qip` package\n\n## References\n\nThis skill includes detailed reference documentation:\n\n- **`references\u002Fcore_concepts.md`**: Quantum objects, states, operators, tensor products, composite systems\n- **`references\u002Ftime_evolution.md`**: All solvers (sesolve, mesolve, mcsolve, brmesolve, etc.), time-dependent Hamiltonians, solver options\n- **`references\u002Fvisualization.md`**: Bloch sphere, Wigner functions, Q-functions, Fock distributions, matrix plots\n- **`references\u002Fanalysis.md`**: Expectation values, entropy, fidelity, entanglement measures, correlation functions, steady states\n- **`references\u002Fadvanced.md`**: Floquet theory, HEOM, permutational invariance, stochastic methods, superoperators, performance tips\n\n## External Resources\n\n- Documentation: https:\u002F\u002Fqutip.readthedocs.io\u002F\n- Tutorials: https:\u002F\u002Fqutip.org\u002Fqutip-tutorials\u002F\n- API Reference: https:\u002F\u002Fqutip.readthedocs.io\u002Fen\u002Fstable\u002Fapidoc\u002Fapidoc.html\n- GitHub: https:\u002F\u002Fgithub.com\u002Fqutip\u002Fqutip\n",{"name":5,"description":7},"main","e3744adb7654df443f12927f3e001252b3a26b6d","cli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates","https:\u002F\u002Fgithub.com\u002FKrismithReddy12","2026-07-29 08:15:10",{"source":8,"skillName":5,"commands":30,"prompt":40,"zipAvailable":41},[31,34,37],{"tool":32,"command":33},"npx","npx skills add KrismithReddy12\u002Fclaude-code-templates --skill qutip",{"tool":35,"command":36},"bunx","bunx skills add KrismithReddy12\u002Fclaude-code-templates --skill qutip",{"tool":38,"command":39},"pnpm","pnpm dlx skills add KrismithReddy12\u002Fclaude-code-templates --skill qutip","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip\u002FSKILL.md",true,[43,49,53,57,61],{"path":44,"resourceType":45,"resourceTypeDesc":46,"sizeBytes":47,"sourceHtmlUrl":48},"references\u002Fadvanced.md","REFERENCE","参考文档",11628,"https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip\u002Freferences\u002Fadvanced.md",{"path":50,"resourceType":45,"resourceTypeDesc":46,"sizeBytes":51,"sourceHtmlUrl":52},"references\u002Fanalysis.md",9387,"https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip\u002Freferences\u002Fanalysis.md",{"path":54,"resourceType":45,"resourceTypeDesc":46,"sizeBytes":55,"sourceHtmlUrl":56},"references\u002Fcore_concepts.md",5595,"https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip\u002Freferences\u002Fcore_concepts.md",{"path":58,"resourceType":45,"resourceTypeDesc":46,"sizeBytes":59,"sourceHtmlUrl":60},"references\u002Ftime_evolution.md",7866,"https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip\u002Freferences\u002Ftime_evolution.md",{"path":62,"resourceType":45,"resourceTypeDesc":46,"sizeBytes":63,"sourceHtmlUrl":64},"references\u002Fvisualization.md",8288,"https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fscientific\u002Fqutip\u002Freferences\u002Fvisualization.md",[66,73,82,89,96,103],{"skillNo":67,"name":68,"nameZh":6,"description":69,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":70,"categories":71,"keywords":72,"publishedAt":18},"01M79YMXJ07S2BQVB7JAM3657Q","zapier-make-patterns","No-code automation democratizes workflow building. Zapier and Make (formerly Integromat) let non-developers automate business processes without writing code. But no-code doesn't mean no-complexity - these platforms have their own patterns, pitfalls, and breaking points.  This skill covers when to use which platform, how to build reliable automations, and when to graduate to code-based solutions. Key insight: Zapier optimizes for simplicity and integrations (7000+ apps), Make optimizes for power","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fworkflow-automation\u002Fzapier-make-patterns\u002FSKILL.md",[],[],{"skillNo":74,"name":75,"nameZh":6,"description":76,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":77,"licenseFileUrl":78,"sourceHtmlUrl":79,"categories":80,"keywords":81,"publishedAt":18},"01M79YMVPMK3Y4JDP2KDJKQ2ZD","yeet","Use only when the user explicitly asks to stage, commit, push, and open a GitHub pull request in one flow using the GitHub CLI (`gh`).","Apache-2.0","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fworkflow-automation\u002Fyeet\u002FLICENSE.txt","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fworkflow-automation\u002Fyeet\u002FSKILL.md",[],[],{"skillNo":83,"name":84,"nameZh":6,"description":85,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":86,"categories":87,"keywords":88,"publishedAt":18},"01M79YMMQ4XXMPJHDQHY8FR7ME","workflow-automation","Workflow automation is the infrastructure that makes AI agents reliable. Without durable execution, a network hiccup during a 10-step payment flow means lost money and angry customers. With it, workflows resume exactly where they left off.  This skill covers the platforms (n8n, Temporal, Inngest) and patterns (sequential, parallel, orchestrator-worker) that turn brittle scripts into production-grade automation.  Key insight: The platforms make different tradeoffs. n8n optimizes for accessibility","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fworkflow-automation\u002Fworkflow-automation\u002FSKILL.md",[],[],{"skillNo":90,"name":91,"nameZh":6,"description":92,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":93,"categories":94,"keywords":95,"publishedAt":18},"01M79YMHQY3CP1XXMQ00TGQFAW","trigger-dev","Trigger.dev expert for background jobs, AI workflows, and reliable async execution with excellent developer experience and TypeScript-first design. Use when: trigger.dev, trigger dev, background task, ai background job, long running task.","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fworkflow-automation\u002Ftrigger-dev\u002FSKILL.md",[],[],{"skillNo":97,"name":98,"nameZh":6,"description":99,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":100,"categories":101,"keywords":102,"publishedAt":18},"01M79YME4Z3DRW0MT6BNYW1D7P","slack-automation","Automate Slack workspace operations including messaging, search, channel management, and reaction workflows through Composio's Slack toolkit.","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fworkflow-automation\u002Fslack-automation\u002FSKILL.md",[],[],{"skillNo":104,"name":105,"nameZh":6,"description":106,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":107,"categories":108,"keywords":109,"publishedAt":18},"01M79YMAX7NFYDFXFZH2TJS7SS","planning-with-files","Transforms workflow to use Manus-style persistent markdown files for planning, progress tracking, and knowledge storage. Use when starting complex tasks, multi-step projects, research tasks, or when the user mentions planning, organizing work, tracking progress, or wants structured output.","https:\u002F\u002Fgithub.com\u002FKrismithReddy12\u002Fclaude-code-templates\u002Fblob\u002Fmain\u002Fcli-tool\u002Fcomponents\u002Fskills\u002Fworkflow-automation\u002Fplanning-with-files\u002FSKILL.md",[],[]]