qvm
RE2
qvm | RE2 | |
---|---|---|
7 | 49 | |
408 | 8,628 | |
0.7% | 0.5% | |
4.0 | 8.9 | |
21 days ago | 2 days ago | |
Common Lisp | C++ | |
GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
qvm
-
I am planning my master's thesis to be about quantum computing and Lisp. Which books do you recommand on the subject ?
Quil's semantics are based off of an idea called the "quantum abstract machine". A piece of software which emulates the quantum abstract machine is called the Quantum Virtual Machine or QVM. It's open source and available here.
-
Lisp For Quantum Simulation?
More interestingly, the QVM repository includes a program called the dqvm which is the QVM but able to be run on an MPI cluster. This doesn't use any advanced state representation (such as matrix product states) and instead just very cleverly arranges for huge wavefunctions to be distributed across a cluster of arbitrary size and worked on in parallel.
-
The one-more-re-nightmare compiler – A fast regex compiler in Common Lisp
and/or in-line assembly code, and still can't optimize specific matrix shapes and structures, or do algebraic simplifications to eliminate work altogether.
The regex library FTA is a great, and clean, example of a long standing practice of compiling regexen, except it doesn't use any fancy VMs or any fancy JITs, just "when you see this regex, automatically turn it into this Common Lisp code, and let the Lisp compiler handle the rest."
[0a] https://github.com/quil-lang/qvm
[0b] COMPILE-OPERATOR: https://github.com/quil-lang/qvm/blob/master/src/compile-gat...
[1] https://www.gnu.org/software/libjit/
-
How do you use Lisp at work?
quantum computer simulator
-
Anybody using Common Lisp or clojure for data science
Yes, simulator, compiler, paper is some of it.
-
A compact quantum-computer that fits in 19-inch server racks
You can also do this with purely free and open source software like [0].
[0] https://github.com/quil-lang/qvm
-
Berkeley Lab Debuts Perlmutter, World’s Fastest AI Supercomputer
I wish I could try running the DQVM, the distributed quantum simulator written in Common Lisp [0], on this thing.
[0] https://github.com/quil-lang/qvm/tree/master/dqvm
RE2
-
C Is the Greenest Programming Language
Looking at the benchmark where C++ is worst compared to other languages, it's depending on the library used. I would guess if they used Google's re2 Regex library instead of Boost's, the result would be different.
https://github.com/google/re2
https://github.com/greensoftwarelab/Energy-Languages/blob/ma...
-
what does this + do in the regular expression "(^A-Za-z)+"
That page says it just includes "some of the most common special characters", and following the link to the Examples page in turn includes a link to the full list.
-
On a Great Interview Question
Python uses backtracking, so this probably isn't O(n), especially with the ability to choose the dictionary.
But with there are non-backtracking matchers which would make this O(n). Here's re2 from https://github.com/google/re2 :
>>> import re2
-
RE2 VS hyperscan - a user suggested alternative
2 projects | 17 Mar 2023
-
hyperscan VS RE2 - a user suggested alternative
2 projects | 17 Mar 2023
RE2 is a Google regular expression library
-
Projects ideas to learn C++/OOP
google's regex library: https://github.com/google/re2
-
Regex: is there a difference between * and {0,}, as well as + and {1,}?
I am currently working with Regex, specifically Re2, and was wondering if there is a real difference between the above expressions for repeated sub-regex.
-
First release of SPVM::File::Spec - complex regular expressions, file tests, SPVM::Cwd, inheritance
I ported Google RE2, a regular expression library, to SPVM as Resource::Re2, and created SPVM::Regex, a wrapper for it.
-
SPVM::File::Basename is released. This is the first module of SPVM using regular expressions.
I searched for I found that there is a Perl compatible regular expression called Google RE2. It is written in C++, and with Google RE2, I can use Perl-compatible regular expressions as a library.
-
Ruby 3.2.0 Is from Another Dimension
Yes, but there is an interesting clarification here. RE2 has used the "caching" approach documented in the Ruby bug ticket linked for quite some time (since its birth?): https://github.com/google/re2/blob/954656f47fe8fb505d4818da1...
It is mentioned only briefly in Cox's article on regex matching in the wild. Look for the word "bitstate": https://swtch.com/~rsc/regexp/regexp3.html
I didn't know Perl had implemented this trick too.
The paper[1] cited in the Ruby bug ticket was published very recently. When I first read the Ruby bug ticket, I immediately wondered how they sidestepped the memory use problem. The paper's abstract seems to suggest there is some technique for doing so, as it rebuffs the idea of doing "full" memoization. Alas, I do not have access the paper. (Which is fucking ridiculous.)
[1]: https://ieeexplore.ieee.org/abstract/document/9519427
What are some alternatives?
screenshotbot-oss - A Screenshot Testing service to tie with your existing Android, iOS and Web screenshot tests
compile-time-regular-expressions - Compile Time Regular Expression in C++
neanderthal - Fast Clojure Matrix Library
semver.c - Semantic version in ANSI C
quilc - The optimizing Quil compiler.
Boost.Signals - Boost.org signals2 module
weblog - a weblog
libevil - The Evil License Manager
pyquil - A Python library for quantum programming using Quil.
constexpr-8cc - Compile-time C Compiler implemented as C++14 constant expressions
CLPython - An implementation of Python in Common Lisp
Cppcheck - static analysis of C/C++ code