NCTSSOS is a non-commutative polynomial optimization tool based on the moment-SOHS hierarchy.
☆14Jan 9, 2026Updated 4 months ago
Alternatives and similar repositories for NCTSSOS
Users that are interested in NCTSSOS are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Automated discovery of optimal branching rules for the branch-and-bound algorithm☆19Dec 15, 2025Updated 5 months ago
- Implementation of the tree width algorithms.☆19Nov 24, 2025Updated 5 months ago
- A parallelized, arbitrary precision semidefinite program solver based on the primal-dual interior-point method.☆21Feb 3, 2024Updated 2 years ago
- A Julia library for computing tree decompositions and chordal completions of graphs.☆37Updated this week
- A sparse polynomial optimization tool based on the moment-SOS hierarchy.☆65Apr 17, 2026Updated last month
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- The fastest Tropical number matrix multiplication on GPU☆10Aug 23, 2025Updated 9 months ago
- NPA in Julia☆26Nov 19, 2025Updated 6 months ago
- Toolbox for quantum information, nonlocality, and entanglement☆36Apr 28, 2026Updated 3 weeks ago
- quantum information toolbox☆22Nov 26, 2025Updated 5 months ago
- Julia中文社区报告：罗秀哲的开源工具箱☆12Dec 6, 2022Updated 3 years ago
- JuliaCN 2022 archived demo repo: How Julia beats MATLAB's C codes by 1000x☆10May 25, 2023Updated 2 years ago
- Topological Evaluation of Quantum Information☆11Dec 13, 2021Updated 4 years ago
- Julia Bit Manipulation Functions☆14Nov 29, 2021Updated 4 years ago
- ☆15Apr 20, 2026Updated last month
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A semidefinite programming solver for clustered low-rank SDPs☆15May 1, 2026Updated 3 weeks ago
- Solve global polynomial optimization problems of either commutative variables or noncommutative operators through a semidefinite programm…☆58Jun 4, 2018Updated 7 years ago
- Coding every Saturday 5PM-8PM at Maker Space, HKUST (GZ)☆14Mar 1, 2024Updated 2 years ago
- bosonic quantum circuits☆19Jul 13, 2025Updated 10 months ago
- Julia package for contraction of tensor networks, based on the sweep line algorithm outlined in the paper "General tensor network decodin…☆55Oct 18, 2023Updated 2 years ago
- Amazing package to compute decompositions into irreducibles of explicit group representations and the Wedderburn decomposition for endomo…☆12Apr 7, 2026Updated last month
- ☆29May 7, 2026Updated 2 weeks ago
- A fermionic linear optics simulator backend for Yao.jl☆16Feb 27, 2026Updated 2 months ago
- quantum circuit systems☆20Jul 13, 2025Updated 10 months ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- string diagrams for the working programmer☆14Jul 17, 2023Updated 2 years ago
- Conic solver for optimization problems in quantum information theory☆26Apr 20, 2025Updated last year
- Examples of scripts implementing the method presented in arXiv:2106.13692.☆13Apr 5, 2024Updated 2 years ago
- Reduced basis methods for parametrised eigenproblems☆15Nov 28, 2024Updated last year
- Python package to heuristically solve optimization problems on quasi-2d lattices using approximate tensor network contractions.☆12Sep 24, 2021Updated 4 years ago
- A massively parallel distributed computational fluid dynamics facility with adaptive mesh refinement.☆21May 12, 2026Updated last week
- ☆22Mar 30, 2023Updated 3 years ago
- Structured decompositions!☆15Mar 26, 2025Updated last year
- Probabilistic inference using contraction of tensor networks☆25Sep 9, 2025Updated 8 months ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- A Julia interface to the SDPA-GMP, SDPA-DD, and SDPA-QD high precision semidefinite programming solvers.☆13Mar 12, 2024Updated 2 years ago
- Bayesian inference on wiring diagrams.☆18Sep 28, 2023Updated 2 years ago
- Solver for sparse matrix cone programs☆16Mar 2, 2026Updated 2 months ago
- ManiSDP aims to efficiently solve low-rank semidefinite programs via manifold optimization.☆28Dec 5, 2025Updated 5 months ago
- ☆15Oct 3, 2023Updated 2 years ago
- Program to calculate SDPs using Noisy intermediate scale quantum (NISQ) computers.☆12Feb 3, 2025Updated last year
- Bayesian inference on spatial and spatiotemporal data, faster than you can say "Cholesky!"☆13May 12, 2026Updated last week