Open wslu42 opened 4 years ago
Hi, @wslu42. This project sounds fun! May I join this team?
Hi, @wslu42. This project sounds fun! May I join this team?
Welcome on board :)
Is this related to quantum walk?
I think so, Grover search is a typical application of quantum walk.
Nice, I think maybe I am suitable in this object. Could I join with u?
Welcome! @leo07010
thx, @wslu42
Hi @leo07010, I am happy to have you in the team! Btw, my slack ID is @Arnie, you can add my contact :)
ok,I had already send a message to u
Does anyone commented on question six?LOL
Hello, @wslu42. This idea sounds great! May I join this team?
you may discuss with us . www
This idea sounds fun! May I join this team? I'm the chemical engineering student
@leo07010 where are you guys? there are so many people lol
We are in the middle of this room.You can come to discuss with us.LOL
@Lufter are you joining this group? You can assign yourself from the top right if you're interested. Never mind, I think you're joining another issue :)
Sorry, I want to join another group.
@yaya870611 no problem, please comment under that group and remove your assignment from here when you do. Thanks!
may i join this issue?
Welcome folks! I'm running on US east coast time zone so I'm 12hr behind your local time. When you are ready to start introduce ourselves please let me know either here or over Slack. Good luck and have fun!
our work link https://github.com/leo07010/-6
Abstract
Random sequential absorption (RSA) processes for dimers are a typical toy model find great applications in many critical surface science problems including H2 and O2 catalyst efficiency in fuel cells. In this project by generating a 1D RSA simulation code participants are expecting to showcase how to generate a classical algorithm potentially benefits from quantum advantages.
Description
Let me quote the wikipedia real quick here: Random sequential adsorption (RSA) refers to a process where particles are randomly introduced in a system, and if they do not overlap any previously adsorbed particle, they adsorb and remain fixed for the rest of the process. RSA can be carried out in computer simulation, in a mathematical analysis, or in experiments. It was first studied by one-dimensional models: the attachment of pendant groups in a polymer chain by Paul Flory, and the car-parking problem by Alfréd Rényi.[1]
Ok to be exact, we want to study a 1D discrete Rényi parking problem, which can be found at the end of this paper [2].
The reasons why I propose this project are:
[1] Rényi, A. (1958). "On a one-dimensional problem concerning random space filling". Publ. Math. Inst. Hung. Acad. Sci. 3 (109–127): 30–36. [2] MATTHEW P. CLAY AND NANDOR J. SIMANYI (2014) "RENYI’S PARKING PROBLEM REVISITED " https://arxiv.org/pdf/1406.1781.pdf
Members
@Wen-SenLu
email:wslu42@gmail.com
Deliverable
An backend code simulates the 1D dimer RSA process, which should be including below features:
GitHub repo