Skill Claude CodeCodex
A quantum-computing skill for explaining, running, and modifying the linear-combination method with Qiskit's LinCombEstimatorGradient. It generates quantum circuits for calculating derivatives using a linear combination of terms.
Skill Claude CodeCodex
A local open-source workflow for molecular density matrix renormalization group (DMRG), a method for estimating molecular quantum states and energies. It combines PySCF molecular integrals with quimb's tensor-network calculations.
Skill Claude CodeCodex
A quantum-computing skill for explaining, running, and modifying the Möttönen state-preparation method with PennyLane. This method prepares a quantum state with controlled rotations while retaining complex-number phase information.
Skill Claude CodeCodex
A matrix-product-state (MPS) workflow for representing and preparing quantum states. An MPS stores a large state as linked smaller arrays, and singular-value decomposition can optionally truncate those links to reduce the representation.
Skill Claude CodeCodex
A quantum-computing skill for explaining, running, and modifying multiplexer state preparation with Qiskit. A multiplexer uses control qubits to select among operations for preparing a quantum state.
Skill Claude CodeCodex
A NumPy solver for the eigenvalues and eigenvectors of a dense Hermitian matrix. Hermitian matrices have matching real-valued eigenvalues, and the solver reports the error in the computed result.
Skill Claude CodeCodex
A NumPy-based solver for finding the smallest eigenvalue and its matching vector. An eigenvalue is a number describing how a matrix transforms a vector; this implementation is a classical, non-quantum calculation and reports the remaining error.
Skill Claude CodeCodex
An implementation of the parameter-shift rule, a way to calculate how a quantum circuit's result changes when a gate angle changes by evaluating shifted versions of the circuit. It uses Qiskit's gradient estimator for RY rotation gates.
Skill Claude CodeCodex
A state-preparation method that uses Pauli rotations, rotations based on common quantum operators, to approximate a requested quantum state. It uses PennyLane's arbitrary-state preparation and reports fidelity, which measures similarity to the target, plus optimisation status.
Skill Claude CodeCodex
An implementation of QAOA, a hybrid quantum-classical method for searching for good solutions to optimisation problems. This version builds alternating cost and mixing circuits for unweighted MaxCut, which divides a graph's nodes to maximise crossing edges.
Skill Claude CodeCodex
A quantum circuit method that fits a probability distribution using a parameterised circuit, whose measurement probabilities are called a Born distribution. It compares the fit with KL divergence and total variation distance, two measures of difference between distributions.
Skill Claude CodeCodex
An implementation of QDrift, a quantum simulation method that approximates how a system changes over time by applying randomly selected terms from its Hamiltonian, the mathematical description of its energy. It builds explicit Qiskit circuits and reports simulated probabilities or state vectors.
Skill Claude CodeCodex
A tool for calculating quantum Fisher information (QFI), a measure of how much a quantum state changes when a parameter changes. It uses Qiskit's QFI and reverse quantum geometric tensor methods for pure states.
Skill Claude CodeCodex
A runnable implementation of the quantum Fourier transform (QFT), a quantum circuit that changes how information is represented so periodic patterns can be analysed. It uses Qiskit and can explain, calculate, or modify the circuit.
Skill Claude CodeCodex
A tool for constructing and checking HGP quantum LDPC codes. These are error-correcting codes built from sparse binary matrices; it checks their parity constraints, commutation, binary rank, and error syndromes.
Skill Claude CodeCodex
An implementation of quantum phase estimation, a quantum algorithm for estimating the phase associated with a unitary operation, which is a reversible quantum transformation. It uses explicit Qiskit circuits and reports the resulting probabilities or state vector.
Skill Claude CodeCodex
An implementation of quantum signal processing (QSP) and quantum singular value transformation (QSVT), methods for applying a chosen polynomial transformation to encoded quantum data. This version constructs a bounded even polynomial for cos(t x) and reports truncation error and block scaling.
Skill Claude CodeCodex
A local implementation of a quantum linear-system method using QSVT, a technique for applying a polynomial transformation to a matrix through quantum circuits. It targets non-singular Hermitian matrices and reports the actual residual of the computed solution.
Skill Claude CodeCodex
A local implementation of a reverse estimator gradient, which calculates how a quantum circuit's output changes as its parameters change. It uses Qiskit's ReverseEstimatorGradient and state-vector derivatives.
Skill Claude CodeCodex
A local open-source implementation of Shor's algorithm, a quantum method for finding factors of some integers. It includes reversible modular multiplication, phase estimation, continued fractions, and factor checking.
Skill Claude CodeCodex
A local implementation of Simon's algorithm, a quantum method for finding a hidden bit string from a two-to-one XOR function. It samples with Hadamard gates and uses arithmetic over bits to recover the hidden string.
Skill Claude CodeCodex
A local implementation of the SPSA estimator gradient, which estimates parameter changes by comparing measurements at randomly perturbed settings. It uses an explicit perturbation size, batch size, and random seed.
Skill Claude CodeCodex
A local implementation for preparing a quantum state as a weighted combination of computational-basis states. The weights may be complex numbers, and the method also clears its auxiliary qubits.
Skill Claude CodeCodex
A local implementation of a truncated Taylor-series method for simulating Hamiltonian evolution. It represents the series with Pauli terms and runs the PREPARE, SELECT, and cleanup steps, reporting the probability of the desired post-selected result.
At most 3 mods per repository are shown here, and a mod shipped inside a plugin is left to that plugin's page — the rest are on their repository pages: