3 ms·
That's not true at all. Scaling quantum computers is exponentially hard - each bit is twice as hard to keep coherent as the last. And the higher-qubit demos yo
by akvadrako 8y ago
That's not true at all. Scaling quantum computers is exponentially hard - each bit is twice as hard to keep coherent as the last.
And the higher-qubit demos you've heard about have quite low fidelity, meaning they'll need multiple physical qubits to represent each logical qubit.
When a problem scales like 2^(2x), you can easily reach an insurmountable barrier. I'm not saying they will, mind you.
- perl4ever 8y ago"That's not true at all. Scaling quantum computers is exponentially hard - each bit is twice as hard to keep coherent as the last." I am very interested to know if that is the case. From my perspective, your claim seems like an intuitively obvious application of TANSTAAFL, but there are experts who actually understand quantum physics who think otherwise. Layman's intuition is not to be trusted. Therefore quantum computing remains tantalizingly more plausible to me than, say, cold fusion.