All categories
Research
Research, evidence gathering, literature, reports, investigation, and synthesis
- 21,409
- 893
Security grades appear on each card once the skill has been scanned. Newly imported skills may briefly show without a grade until the backfill job runs.
Open in full browserBrowse research skills
Showing 10,537–10,560 of 21,409 skills
- Pce Quantum Portfolio OptimizationScalable Variational Quantum Optimization via Pauli Correlation Encoding (PCE) methodology for large-scale combinatorial optimization problems, particularly power demand portfolio optimization. Uses expectation values of Pauli correlation operators to represent binary variables with compact qubit representations.Votes: 0GitHub stars: 3
- Pauli Structured PreconditioningPauli-structured preconditioning methodology for quantum linear system solvers. Based on arXiv:2606.01733 — reduces normalization overhead via Pauli expansion regrouping.Votes: 0GitHub stars: 3
- Pauli Propagation Error MitigationHybrid quantum-classical error mitigation framework embedding Pauli propagation with noise-canceling inverse channels. Use when mitigating errors in observable estimation on NISQ processors, combining classical simulation (Pauli propagation) with quantum hardware measurements, or extending observable estimation beyond classical/quantum limits alone. Activation: Pauli propagation, noise-canceling observable, hybrid error mitigation, quantum-centric supercomputing, observable estimation, invers...Votes: 0GitHub stars: 3
- Partially Blind Single Qubit ClassificationPartially-Blind Single-Qubit Classification (PB-SQC) methodology for quantum-secured delegated machine learning on untrusted quantum networks. Combines single-qubit classifiers with blind quantum computation to deliver privacy-preserving quantum ML classifications. Activation: partially-blind classification, PB-SQC, blind quantum classification, quantum-secured ML, delegated quantum computation, SQC with privacyVotes: 0GitHub stars: 3
- Operator Frame Geometry Non Compact QuantumOperator-frame geometry framework for non-compact bosonic quantum systems where vacuum instability renders conventional state-space quantum geometry ill-defined (arXiv: 2607.06994)Votes: 0GitHub stars: 3
- Nonmarkovian Quantum Feedback ControlMethodology for non-Markovian quantum systems under continuous measurement-based feedback using projection operator stochastic equations, where previously deterministic terms become stochastic ones depending on measurement records.Votes: 0GitHub stars: 3
- Non Isometric Qec TheoryGeneral theory of non-isometric quantum error-correcting codes using approximate QEC framework. Quantifies fundamental limitations imposed by non-isometric encodings on QEC accuracy and logical operation implementation. Applied to GKP and tiger codes under energy constraints, with implications for holography. (arXiv: 2606.13559)Votes: 0GitHub stars: 3
- Non Abelian Anyon Proliferation Stat MechStatistical mechanics and symmetry methodology for analyzing stability of non-Abelian topological order under wavefunction deformations and decoherence. Maps topological order instability to stat-mech models whose symmetries expose corrupting anyonic excitations.Votes: 0GitHub stars: 3
- Noise Aware Quantum Ldpc SynthesisNoise-aware synthesis methodology for quantum LDPC encoder circuits using two-sided Hamming descent. Enables hardware-aware circuit synthesis for fault-tolerant QEC that accounts for physical noise characteristics.Votes: 0GitHub stars: 3
- Multiple Quantum Hypothesis TestingDimension-free one-shot bounds for multiple quantum state discrimination with sharp asymptoticsVotes: 0GitHub stars: 3
- Monitored Clifford PurificationUniversal purification dynamics of monitored Clifford circuits methodology — shows purification reduces to exactly solvable Markovian death process, bypassing replica trick. Computes universal scaling functions for all Renyi entropies.Votes: 0GitHub stars: 3
- Module Lattice SecurityModule lattice security methodology for post-quantum cryptography. Covers unconditional verification of Weber's conjecture, Principal Ideal Problem solvability, Ring-LWE and Module-LWE security reductions, and cyclotomic field arithmetic. Combines computational number theory (Fukuda-Komatsu sieve, Herbrand's theorem) with lattice-based cryptographic security analysis. Activation: module lattice security, Weber conjecture, Ring-LWE, Module-LWE, post-quantum cryptography, lattice cryptography, ...Votes: 0GitHub stars: 3
- Model Predictive Quantum ControlModel Predictive Control (MPC) methodology applied to quantum state preparation and quantum system control. Combines system identification with receding-horizon optimization for robust quantum operations under noise and uncertainty.Votes: 0GitHub stars: 3
- Metabolic Quantum MegMetabolic quantum limit methodology for magnetoencephalography - deriving technology-independent bound on brain information capacity using energy resolution and Planck's constantVotes: 0GitHub stars: 3
- Metabolic Quantum Limit Brain ImagingQuantum-metabolic bounds on information capacity of noninvasive brain imaging (arXiv:2511.06401)Votes: 0GitHub stars: 3
- Mcts Quantum EncodingMonte Carlo Tree Search (MCTS) methodology for discovering optimal data encoding circuits for quantum-classical neural networks, using effective rank as a performance predictor.Votes: 0GitHub stars: 3
- Low Rank Hessian Quantum Gate CalibrationLow-rank Hessian optimization methodology for calibrating high-dimensional optimal-control quantum gates. Identifies principal waveform directions affecting fidelity using Hessian sensitivity analysis, enabling efficient closed-loop experimental feedback calibration. Achieves raw fidelity 0.9959 and postselected fidelity 0.9990 on amplitude-robust CZ gates for neutral atom qubits. Use when: (1) Calibrating optimal-control quantum gates, (2) Reducing calibration parameter space dimensionality,...Votes: 0GitHub stars: 3
- Low Rank Hessian Quantum ControlLow-rank Hessian optimization methodology for quantum optimal control calibration. Uses Hessian eigenanalysis to identify principal error directions in high-dimensional gate waveforms, optimizing only in that subspace via closed-loop feedback. Applicable to neutral atom, superconducting, and trapped-ion qubit platforms.Votes: 0GitHub stars: 3
- Logical Catalyst Dyadic PhaseSurface-code cultivation protocol for reusable logical catalyst states implementing exact fine dyadic phase gates Z^{2^{-b}} by phase kickback in fault-tolerant quantum computingVotes: 0GitHub stars: 3
- Logarithmic Negativity Entanglement CostQuantum entanglement analysis methodology using logarithmic negativity — proving that logarithmic negativity typically equals exact entanglement cost. Use when quantifying entanglement, analyzing state preparation costs, or studying quantum resource theory.Votes: 0GitHub stars: 3
- Logarithmic Negativity Entanglement CostLogarithmic negativity as exact entanglement cost methodology — proving logarithmic negativity equals the exact entanglement cost for typical quantum states. Use when analyzing quantum entanglement quantification, entanglement cost computation, quantum resource theory, or logarithmic negativity measures.Votes: 0GitHub stars: 3
- Llm Quantum Operator AlignmentAlign Large Language Models with quantum operator representations (unitary matrices). Enables LLMs to reason about quantum circuits, predict operator properties, and bridge natural language with quantum mechanics. Use when: translating quantum operators to/from natural language, analyzing LLM understanding of quantum mechanics, designing quantum-classical interfaces, or building LLM-assisted quantum circuit optimization tools.Votes: 0GitHub stars: 3
- Llm Evolved Quantum EncodingLLM-driven evolutionary program synthesis for quantum error-correcting code discovery. Uses language model to mutate constructor programs, external verifier to score results, and iterative search to discover interpretable quantum encoding schemes with improved code distance and resource efficiency.Votes: 0GitHub stars: 3
- Limited Memory Quantum TestingStabilizer state testing and learning under quantum memory constraints. Proves testing complexity is Θ(n-k) with k-qubit memory, learning is Θ(n²/k), and exponential lower bound for purity testing. Identifies coherent quantum memory as the resource enabling testing-vs-learning separation.Votes: 0GitHub stars: 3