@TanMath in some abstract sense all optimization problems are equivalent. some of this is related to the NP class. in practice the "conversion efficiency" can be a factor. the Vattay/ Kauffman ideas are about utilizing "light harvesting processes" for quantum computation. apparently they have sketched out some of the math. sounds like ~½-way plausible idea but but havent heard of anyone building on this direction "yet".
@TanMath need to look at the paper in more detail what pg are you talking about? (iiuc) they are noting that the general eqn for the FMO complex "looks" like an optimization problem. these types of eqns generally "optimize" for something like "least energy levels" aka something like "principle of least action"
Another problem I think is that finding the optimum of a function with only 7 values is useless... same with finding the shortest path of a graph with seven nodes... so clearly, bigger protein-pigment complexes would need to be used...
"For the simplicity let this function have only discrete values from 0 to K. If we are able to map the values of this function to the electrostatic site energies of the chromophores Hnn = 0fn and we 5 deploy reaction centers near to them trapping the excitons with some rate κ and can access the current at each reaction center it will be proportional with the probability to find the exciton on the chromophore $jn ∼ \kappa \rho_{nn}$." - Vattay and Kauffman
In quantum computing, quantum walks are the quantum analogue of classical random walks. Analogous to the classical random walk, where the walker's current state is described by a probability distribution over positions, the walker in a quantum walk is in a superposition of positions.
Like classical random walks, there are two types of quantum walks: discrete-time quantum walks and continuous-time quantum walks.
== Motivation ==
Quantum walks are motivated by the widespread use of classical random walks in the design of randomized algorithms, and are part of several quantum algorithms. For some...
V&K p4-5 is where they sketch how to map the computation problem onto chromophores. the idea seems to be to put multiple reaction chambers near different chromophores as the energy measuring devices. and maybe to control the initial energy in the chromophores? and the interactions between them? and then the exciton "samples" this energy field quantum mechanically aka "in parallel" and arrives at a destination reaction chamber, and apparently its destination encodes the problem solution...?
@vzn I thought they randomly select the coupling constants (which determine the interactions between the chromophores)... they talk about the requirements needed for measurement...
TM its an intriguing paper and seems like it might be a sort of adiabatic computation, but not sure right now... seems quite novel/ unprecedented... it seems adiabatic because they seem not to be trying to micromanage/ precisely control qubit transport...
@BernardoMeurer, oh, it would just give a blank screen, so i then switched the chromebook back into normal mode to get rid of it and try reinstall, and then switched back, and then the download had trouble so i had to delete it (can't remember quite what happened), and then i had to go do something so i left it for the moment
on top of that i was also having more than a few memory issues for some reason (on the computer)
think they need to explain better what they are controlling in the setup. presumably chromophore initial energies and their interactions/ couplings, but think its a bit unclear
@vzn i am simply explaining the situation, i am not commenting either way. please don't say DS is "not on speaking terms" with either of you, because that isn't true.
also, phrases like that frustrate people - we're not trying to be rude, just help you out.
It's fine not talking physics; I talk math and philosophy here with a bunch of other people. Some talk about food and music. Some about JEE. I just think meta-babbles are super tedious. If you don't think this that's fine.
In open quantum systems, we model a process known as thermal relaxation. What is this process? Why is it that only the Redfield equation models this process, and the Lindblad equation doesn't (does it have to do with the secular approximation)? Is it possible to add a Lindblad superoperator to mo...
I have been reading two articles on the quantum transport of the FMO complex (https://arxiv.org/abs/1311.4688, https://arxiv.org/abs/0807.0929). In these papers, each model different processes occuring that affect the quantum transport of the excitons in the FMO complex. In the first article they...
@TanMath C has high performance, and it's really expandable. You can control memory with a lot of precision. I'm a computer engineer, that's what I need
However, @TanMath, I must say: if I become frustrated in our conversations, I will either 1) Just stop participating in the conversation or 2) Type out an expletive like the one above.
I have gone way, way past what I would consider to be normal levels of patience with you in the past, and frankly I'm not interested in exercising that any more until we have some more productive exchanges.
Roger Godement (French: [ɡɔdmɑ̃]; October 1, 1921 – July 21, 2016) was a French mathematician, known for his work in functional analysis as well as his expository books.
== Biography ==
Godement started as a student at the École normale supérieure in 1940, where he became a student of Henri Cartan. He started research into harmonic analysis on locally compact abelian groups, finding a number of major results; this work was in parallel but independent of similar investigations in the USSR and Japan. Work on the abstract theory of spherical functions published in 1952 proved very influentia...
Then you have a choice to either allocate space for each of those pointer to point to and later copy boards (clear but clunky), or to redirect those pointer to existing boards and then allocate new space for the new board (the idomatic K&R way).
so if the probability of finding an exciton on a chromophore is 1/N (N = number of chromophores), whats so directed about the quantum walk of FMo complex?:
So the way I want to do it is to have a history array that can hold up to UNDO_DEPTH copies of cells. Whenever I want to retrieve a copy I get the first entry of the array, if I want to add a more recent copy I shift the array to the right and insert the new copy on [0]
UNDO_DEPTH is a define way up there and is set to 25
I have a drawing tool I use to teach pointer and to work out what is going on in complciated pointer situations (akin to the way that free body diagrams are used to teach and solve Newtonian physics).
It involves a lot of boxes and arrows and I'm not sure that I can explain it in chat.
But it is your responsibility to know where every pointer points, if those locations are legally addressable, and if so how much such memory is out there.