A library for implementing Quantum Algorithms

qchas alternatives and similar packages

Based on the "Algorithms" category

• arithmoi

  9.4 8.7 qchas VS arithmoi

  Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

• build

  9.4 7.8 qchas VS build

  Build systems a la carte

• toysolver

  9.1 7.8 qchas VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• ersatz

  9.1 5.4 qchas VS ersatz

  A monad for expressing SAT or QSAT problems using observable sharing.

• iproute

  8.8 3.3 qchas VS iproute

  IP Routing Table

• primes

  8.3 0.0 qchas VS primes

  Efficient, purely functional generation of prime numbers

• graphs

  8.2 3.8 qchas VS graphs

  A simple monadic graph library

• funsat

  8.1 0.0 qchas VS funsat

  A modern DPLL-style SAT solver

• HMM

  7.9 0.0 qchas VS HMM

  A hidden markov model library

• aeson-diff

  7.8 2.4 qchas VS aeson-diff

  Extract and apply patches to JSON documents.

• imj-animation

  7.8 0.4 qchas VS imj-animation

  Animation Framework

• union-find

  7.8 0.0 qchas VS union-find

  Efficient union and equivalence testing of sets.

• presburger

  7.4 0.4 qchas VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• text-metrics

  7.2 5.1 qchas VS text-metrics

  Calculate various string metrics efficiently

• Adaptive

  7.1 0.0 qchas VS Adaptive

  Library for incremental computing.

• edit-distance

  7.0 2.7 qchas VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• lca

  6.8 3.8 qchas VS lca

  O(log n) persistent on-line lowest common ancestor calculation without preprocessing

• dtw

  6.5 0.0 qchas VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.3 0.0 qchas VS treeviz

  Visualization of computation decomposition trees.

• ADPfusion

  6.2 0.0 qchas VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 qchas VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  5.3 0.0 qchas VS ListTree

  Trees and monadic trees expressed as monadic lists where the underlying monad is a list

• search-algorithms

  5.0 0.0 qchas VS search-algorithms

  Common graph search algorithms

• cmaes

  5.0 0.0 L1 qchas VS cmaes

  CMA-ES wrapper in Haskell

• integer-logarithms

  4.8 3.6 qchas VS integer-logarithms

  Integer logarithms.

• edit-distance-vector

  4.8 0.0 qchas VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• sgd

  4.8 7.0 qchas VS sgd

  Stochastic gradient descent

• binary-search

  4.6 0.0 qchas VS binary-search

  Binary and exponential searches

• KMP

  4.3 0.7 qchas VS KMP

  Knuth–Morris–Pratt string searching algorithm

• primesieve

  4.3 1.9 qchas VS primesieve

  FFI bindings for the primesieve library.

• TrieMap

  4.3 0.0 qchas VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• union-find-array

  4.3 0.0 qchas VS union-find-array

  union find data structure

• DP

  4.1 0.0 qchas VS DP

  Pragmatic framework for dynamic programming

• graph-generators

  4.1 0.0 qchas VS graph-generators

  Functions for generating structured or random FGL graphs

• infinite-search

  4.1 0.0 qchas VS infinite-search

  Exhaustively searchable infinite sets.

• pathfinding

  3.8 0.0 qchas VS pathfinding

  pathfinding in grid and graphs

• jps

  3.8 0.0 qchas VS jps

  Jump point search for Haskell

• spacefill

  3.5 0.0 qchas VS spacefill

  Generators for space-filling curves.

• nonlinear-optimization-ad

  3.5 0.0 qchas VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• edit-distance-linear

  3.1 7.1 qchas VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 qchas VS GraphSCC

  Tarjan's algorithm for computing the strongly connected components of a graph.

• twentyseven

  2.9 0.0 qchas VS twentyseven

  Rubik's cube solver

• epanet-haskell

  2.9 0.0 L2 qchas VS epanet-haskell

  Haskell binding for EPANET

• fibonacci

  2.9 0.0 qchas VS fibonacci

  Fast computation of Fibonacci numbers.

• pell

  2.5 0.0 qchas VS pell

  Package to solve the Generalized Pell Equation.

• dgim

  2.5 0.0 qchas VS dgim

  Implementation of DGIM algorithm

• learning-hmm

  2.5 0.0 qchas VS learning-hmm

  Yet another library for hidden Markov models

• stable-marriage

  2.5 0.0 qchas VS stable-marriage

  algorithms around stable marriage

• adp-multi

  2.1 0.0 qchas VS adp-multi

  ADP for multiple context-free languages

• ADPfusionSet

  1.1 0.0 qchas VS ADPfusionSet

  Dynamic programming for Set data structures.

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

Do you think we are missing an alternative of qchas or a related project?

Add another 'Algorithms' Package

Popular Comparisons

• qchas
  vs
  twentyseven
• qchas
  vs
  lca
• qchas
  vs
  arithmoi
• qchas
  vs
  graph-generators
• qchas
  vs
  ADPfusionSet