I gave a light warning not to confuse quantum computers with quantum communication. They are different beasts. Even the documentary tries to explain that notion.
“Most of my friends (scientist speaking) ask me when are quantum computers going to let me play my video games faster? I have to tell them that they probably won’t. We have regular computers to perform that task. Quantum computers have a limited type of data it acts efficiently upon which also limits its applications.”
(Thus far, as far as we can tell.)
However, one of the benefits of quantum computers is that they allow for quantum communication. A quantum computer network, as any other network, has to have at least two computers. Theoretically and as already successfully tested, quantum computers that are linked together experience quantum entanglement. Through magic that is greater than even the author’s pixie dust, quantum computers can
teleport their results to the other computer via quantum entanglement. Even if the MAlign’s application needs quantum repeaters positioned in the system whose range might greatly exceed light speed
OR it might even exceed the needed range of the application.
I have been interested in quantum entanglement for a long long time. I think it has the potential to affect many varied disciplines, one of which is religion.
I won’t go there.
However, the range of quantum entanglement is a mystery. What is this exact range in spacetime? It is something that is going to have to be determined, much like the speed of light once had to be measured? We will have to answer questions like.
“What is an actual frame of reference of spacetime?”
“What is the smallest indivisible reference?”
“What is the largest indivisible reference of spacetime?”
If two QCs (quantum conputers) are initially connected, then their results -- even over long distances -- would be the same acting upon the same variables.
Are quantum computers brute force devices? Wiki:
No, quantum computers are not simply brute force devices. While they can offer significant speedups for certain problems, they don't universally outperform classical computers in all tasks, and they don't work by trying every possible combination. Quantum computers leverage quantum mechanics to perform computations in ways that are fundamentally different from classical computers, and they are particularly well-suited for specific types of problems, like factoring large numbers, that are difficult for classical computers.
Here's a more detailed explanation:
1. Quantum computers are not brute-force machines:
• They don't simply try every possible solution until they find the right one. This is a common misconception.
• They solve problems using quantum algorithms that leverage quantum phenomena like superposition and entanglement.
2. Quantum computers can solve certain problems much faster than classical computers:
• Shor's algorithm:
This algorithm can factor large numbers much faster than any known classical algorithm. This is a key concern for cryptography as many encryption systems rely on the difficulty of factoring large numbers.
• Grover's algorithm:
This algorithm can speed up searches in an unsorted database by a factor of the square root of the number of elements. While not a brute-force method, it can still significantly improve search time.
3. Quantum computers have limitations:
• Not a universal speedup:
They don't offer a universal speedup over classical computers for all tasks. Many everyday computational tasks, like sorting or simple arithmetic, are not significantly faster on a quantum computer.
• Specific algorithms:
Quantum algorithms are tailored to specific problems and don't offer a general-purpose solution for any computation.
4. Quantum computers and cryptography:
• They pose a threat to existing encryption methods that rely on the difficulty of factoring large numbers or solving discrete logarithm problems.
• This has led to the development of post-quantum cryptography, which aims to create encryption methods that are resistant to quantum attacks.
It is like some people who ask why a GPU is not used instead of a CPU, since a GPU can do certain things much faster than a CPU. Answer, the CPU has a swiss army knife of needed tools that computing as a whole needs. A GPU simply has "a saw" and the CPU cannot come close to the GPU in matters that need a saw.
tlb wrote:
But it does not matter, because it is irrelevant to the question of FTL communication in the Honorverse; unless you can show how to create a Qubit out of distinct gravity pulses. Here is a Wikipedia article for more information: No-communication theorem
That would be the wrong application of the technology. Hence, my warning not to mix quantum computers with quantum communication.
First, if you are certain that quantum entanglement is affected by or is controlled by gravity, or that it has anything at all to do with gravity, then please do submit your theory. It might help to answer other problems. Like the frame of reference questions I submitted. And I do mean that in the kindest way possible. I’d be interested in your theory .
At any rate, using gravity would seem to undermine the characteristics of quantum communication. Defeating the purpose.
Quantum computers are compatible with quantum algorithms. Algorithms that cannot be run by regular computers.
Note:I have never had any doubt that true artificial intelligence will need quantum computing to even have a snowball's chance in hell of happening.
.
.
.
The artist formerly known as cthia.
Now I can talk in the third person.