Quantum Computing 2
I was reading a post by a woman on using Lorenz curves to determine the “cost and yield of moving from one quantum state to another”.
She states that when there is no information about a given quantum state the graph of the Lorenz curve is linear from (0,0) to (1,1).
If there is information on (you know the state), say, in one direction like up and down, if you measure in that direction you’ll get a +1.
With more information on the quantum state the line becomes more curved.
She goes on to say you can combine the curves dictating the various information on the quantum states to create a combination of their output which can subsequently can be represented by a corresponding Lorenz curve between the to previous two curves.
This is a separate but related topic. If you could graph and document the various stable quantum states as a piece of information established as a quantum state, could you then combine the functions the describe them (combine their graphs) to point to the specific point within memory at which that piece of information is? What type of algorithm would you have to develop to parse the various functions out of the resulting function to determine where the various symbols are placed within memory?
This would be related to using entanglement and superposition to cut down on the amount of memory necessary for computing. and yield of changing quantum states.
She has a paper coming out on the topic of Lorenz curves and using them to determine the cost