I don't see why Quantum would be faster than classical. I see quantum having more depth than speed.

I however no knowledge of the subject other than that you can turn a binary bit in to a 2.

packetlost 3 days ago | parent | next [-]

It's better to think of QPUs as highly specialized coprocessors that do certain things really well. You would only every really use them for problems they're good at. Like ALU vs FPU vs GPU.

▲

superb_dev 2 days ago | parent [-]

What problems are they good at?

	▲	packetlost 2 days ago \| parent [-]
		Shor's algorithm is the quintessential example, but there are other algorithms (mostly graph algorithms) that are NP and hard would be very efficient on a quantum computer.

▲

freetonik 3 days ago | parent | prev [-]

It’s healthier to think of neither depth nor speed. The space of problems best suited for quantum computers is altogether orthogonal to those dimensions.