NP-completeness is a property of problems, while BQP is a complexity class (set of problems). If any NP-complete problem is in BQP, then NP is a subset of BQP.
But it's not even known whether BQP > P,
so we could have P = BQP < NP.
Did they give any numbers on the quality of the qubits? For example, IBM's 20 qubit chip has 2-qubit operations with error rates on the order of 5% [1] (some pairs of qubits are better, some are worse). Quantum supremacy experiments require thousands of operations (tens of layers of parallel operations). Qubits with even a 1% error rate per operation just won't cut it.
Better drugs/more complex medicines should be possible. Chemical interactions are hard to do on classical computers (operating on 5D+ arrays), true quantum computers should be able to help with those computations.
Do you have easy material for me to understand how quantum computing enables that kind of things?
And does it use clasic numerical method computing or using different kind of mathematical approach?
Actually I'm not sure whether my question makes sense or not
18 comments
[ 2.0 ms ] story [ 54.6 ms ] threadhttp://fortune.com/2018/01/06/breaking-bitcoin-cybersaturday...
Quantum Resistant Ledger
https://theqrl.org/
But it's not even known whether BQP > P, so we could have P = BQP < NP.
(disclosure: IBMer, but very different area)
One that can perform a computation task fastest with least energy would clearly be superior to another.
1: https://youtu.be/T-8uuq7Izl8?t=26m58s "Experimental quantum computing at IBM" [26:58]
(Disclosure: I work on Google's quantum team.)
No they didn't. I've also had problems finding the benchmarks for their 17 qubit processor. I would appreciate if someone could link them to me.
https://arxiv.org/pdf/0708.0261.pdf
(This is me failing my saving throw vs urge to make terrible nerd jokes.)