Earlier quoted context omitted.
That's great. Now next thing that needs to be solved is to make this tech available for general public use just like computers are these days. Problems that are waiting to be solved by it are very large and of huge impact.
Problems that are waiting to be solved by it are very large and of huge impact I know virtually nothing about quantum computing, so can you give some examples? Whenever I've asked anyone who seemed to know anything about the field, all they can come up with is weather forecasting and simulating nuclear explosions. Not exactly "general use," as you put it. In the back of my mind, I know that quantum computing is a big…
Chinese Researchers Achieve Quantum Entanglement Record
131–140 of 152 posts
Re: Chinese Researchers Achieve Quantum Entanglement Record
#132Earlier quoted context omitted.
I’m not sure I follow your argument, but if I understand you right, I don’t believe what you’re quoting is relevant. From the article you are (I think?) criticizing: We measure a Bell signal S of 2.0732 ± 0.0003, exceeding the maximum value |S| = 2 for a classical system by 244 standard deviations. In the experiment, we deterministically generate the entangled state, and measure both qubits in a single-shot manner, c…
Uh, wow, at no point have I made the claim that an electrical circuit is not a quantum system. Nor have I claimed that they are incapable of simulating quantum phenomena. Quite the very opposite. What I did clearly state, and insist as quite relevant, is that entanglement and double slit experiments are hocus pocus and irrelevant distractions. In fact, I stated that this experiment says basically nothing because it m…
I don’t believe that you could, even theoretically, produce the data from a loophole-free Bell test without invoking superdeterminism, superluminality, or quantum entanglement.
Can you describe how this would be theoretically possible?
Re: Chinese Researchers Achieve Quantum Entanglement Record
#133Earlier quoted context omitted.
So the number of raw qubits are in the order of a million for large prime factorization or to make Shor's algorithm a reality. This is because the physical qubits are highly unstable and prone to errors. The error correction methodologies will result in a fault-tolerant logical qubit. Depending on the error correction algorithm, the ratio of logical: data/physical qubit is 1:1000 at the minimum. You need 4000 logical…
This is probably a dumb question, but could you spread out the error correction in time? I know it's hard to create very large entangled systems, so would it be possible/easier to do the calculation with 4000 real qubits 1000 times and use the repetition for error correction? (Checking for correct factorization is easy, after all.)
Re: Chinese Researchers Achieve Quantum Entanglement Record
#134Earlier quoted context omitted.
They haven't seen counterexamples because there are virtually none. If what you said was correct wouldn't there be many examples of big bodies of code written in a language like C? (And you can't say "linux kernel" - low-level code needs to be written in a low-level language, in order to communicate with the lower levels like hardware and controllers and such. There is a practical reason to write that in C.) > becaus…
The trend is to make solving problems easier for the untrained; giving the heavy lifting to the machines, making the machines slower for the actual task at hand. Nobody is actually targeting the experts who will love to have more power over safety
So far, reality seems to confirm my intuition.
Re: Chinese Researchers Achieve Quantum Entanglement Record
#135Earlier quoted context omitted.
That's great. Now next thing that needs to be solved is to make this tech available for general public use just like computers are these days. Problems that are waiting to be solved by it are very large and of huge impact.
We all have these things in our pockets that are massive supercomputers by the standards of my college days. And we all use them just to rant at each other about political things that we in reality are totally misinformed about ... and otherwise just waste our lives. I am not sure why quantum computing is supposed to change this. Even software that is supposed to be useful is so terribly slow. Computers are between 2…
Re: Chinese Researchers Achieve Quantum Entanglement Record
#136Earlier quoted context omitted.
The trend is to make solving problems easier for the untrained; giving the heavy lifting to the machines, making the machines slower for the actual task at hand. Nobody is actually targeting the experts who will love to have more power over safety
This won't be popular here, but maybe the economics work against the experts. If most problems out there can be solved with mediocre interchangeable cogs much faster than with the available pool of experts, the cogs will win long term. So far, reality seems to confirm my intuition.
Re: Chinese Researchers Achieve Quantum Entanglement Record
#137Earlier quoted context omitted.
There are already lots of 'practical' applications in the literature. A famous one is Shor's factorisation algorithm. But there are others - everything from doing pagerank to simulating other quantum systems. Many classical algorithms, which run in ~O(poly(n)) can have an 'equivalent' quantum algorithm in ~O(log(n)) - an exponential speedup. There is still debate as to how the complexity class of problems which are e…
> Its suspected P lies entirely within BQP. It's actually known that BQP contains P[1]. It also contains BPP. What's not known is the relationship between BQP and NP (most experts suspect there's no containment in either direction). [1] See this for an easy proof: https://people.eecs.berkeley.edu/~vazirani/f04quantum/notes/...
Re: Chinese Researchers Achieve Quantum Entanglement Record
#138Earlier quoted context omitted.
There are already lots of 'practical' applications in the literature. A famous one is Shor's factorisation algorithm. But there are others - everything from doing pagerank to simulating other quantum systems. Many classical algorithms, which run in ~O(poly(n)) can have an 'equivalent' quantum algorithm in ~O(log(n)) - an exponential speedup. There is still debate as to how the complexity class of problems which are e…
> Its suspected P lies entirely within BQP. It's actually known that BQP contains P[1]. It also contains BPP. What's not known is the relationship between BQP and NP (most experts suspect there's no containment in either direction). [1] See this for an easy proof: https://people.eecs.berkeley.edu/~vazirani/f04quantum/notes/...
Re: Chinese Researchers Achieve Quantum Entanglement Record
#139Earlier quoted context omitted.
What's the size needed for cracking large-primes based encryption? If not at 100 qubits, what are some useful calculations that we can do at that size?
So the number of raw qubits are in the order of a million for large prime factorization or to make Shor's algorithm a reality. This is because the physical qubits are highly unstable and prone to errors. The error correction methodologies will result in a fault-tolerant logical qubit. Depending on the error correction algorithm, the ratio of logical: data/physical qubit is 1:1000 at the minimum. You need 4000 logical…
newbie question : are they naturally instable (so we won't fix that) or is it just because we don't master them well enough right now (and we'll fix them "soon") ?
Re: Chinese Researchers Achieve Quantum Entanglement Record
#140Earlier quoted context omitted.
So the number of raw qubits are in the order of a million for large prime factorization or to make Shor's algorithm a reality. This is because the physical qubits are highly unstable and prone to errors. The error correction methodologies will result in a fault-tolerant logical qubit. Depending on the error correction algorithm, the ratio of logical: data/physical qubit is 1:1000 at the minimum. You need 4000 logical…
>>> qubits are highly unstable newbie question : are they naturally instable (so we won't fix that) or is it just because we don't master them well enough right now (and we'll fix them "soon") ?