With Shor's algorithm QC can "see" the right private key from public key without going through all the possibilities.
I don't think this is quite correct. A classical bit can be 0 or 1, either/or. A qubit, because of quantum superposition, is in a sense partially both values, a probability smear across the two, until it is measured, when it resolves to a definite classical 0 or 1 outcome. In a system with multiple entangled qubits, the number of values covered increases 2^n. Two entangled qubits cover 2^2=4 possibilities, 00, 01, 10, 11. Three entangled qubits cover 2^3=8, 000, 001, 010, 011, 100, 101, 110, 111. And so on. A QC
will assess the probabilities associated with all possible classical values.
---
Edit:
It might also be worth mentioning the distinction between universal gate quantum computers, and quantum annealers. A universal, gate-based QC is what you would use to run Shor's algorithm to attack asymmetric cryptography. Quantum annealers on the other hand (such as D-Wave), would be used to solve optimisation problems (e.g., travelling salesman). If we hear a news report about a breakthrough QC that has x qubits, but it is an annealer, then it is not going to run Shor against bitcoin.