Yes, this is not on the quantum computing stuff, but there is a ton to
do on the continuous rep stuff. That PR still requires a ton of work
and design thinking, but it is a great place to start.
On Sun, Jan 26, 2014 at 1:13 AM, F. B. wrote:
>
>
> On Saturday, January 18, 2014 1:15:49 AM UTC+1, Aa
On Saturday, January 18, 2014 1:15:49 AM UTC+1, Aaron Meurer wrote:
> There was one from a GSoC project but I can't find it (I guess it was
> closed).
>
Did you mean this one?
https://github.com/lazovich/sympy/tree/represent2
I had a look at this some time ago, there are several merge confl
May I suggest to pick up a collection of quantum mechanics problems, and
try to solve them using SymPy. I think this is the best way to get a list
of missing features.
By the way, you can also take the code you write to solve specific problems
in order to later create a tutorial.
--
You rece
Sachith,
Hi, welcome. Thanks for getting in touch with us. There isn't really
much work going on with the Quantum Computing stuff right now, but
there is definitely a lot to work on. It would require a lot of
initiative on your part though to study the code and come up with good
ideas as to the ne
Take a look at the open pull requests relating to the quantum module:
https://github.com/sympy/sympy/search?q=quantum&ref=cmdform&state=open&type=Issues.
There was one from a GSoC project but I can't find it (I guess it was
closed).
Aaron Meurer
On Fri, Jan 3, 2014 at 8:53 AM, Sachith Seneviratn
Hello everyone,
I am Sachith Seneviratne. I am currently a 2nd year undergraduate studying
Computer Science and Engineering at University of Moratuwa, and I'm also a
4th year at the College of Chemical Sciences (where I've followed quite a
few courses on quantum mechanics and the like). I'd lik
Hello everyone,
My name is Sachith Seneviratne. I am currently a 2nd year undergraduate
studying Computer Science and Engineering at University of Moratuwa, and
I'm also a 4th year at the College of Chemical Sciences (where I've
followed a few courses on quantum mechanics and the like). I'd lik
