Quantum Computing Stack Exchange
Quantum Computing Stack Exchange

Questions tagged [classical-computing]

For questions about the relation between quantum computing and classical computing, such as their relative performance.

159 questions
179
votes
13 answers

Is quantum computing just pie in the sky?

I have a computer science degree. I work in IT, and have done so for many years. In that period "classical" computers have advanced by leaps and bounds. I now have a terabyte disk drive in my bedroom drawer amongst my socks, my phone has phenomenal…
John Duffield
  • 1,642
  • 2
  • 10
  • 12
50
votes
2 answers

Is there proof that the D-wave (one) is a quantum computer and is effective?

I'm admittedly a novice in this field, but I have read that, while the D-wave (one) is an interesting device, there is some skepticism regarding it being 1) useful and 2) actually a 'quantum computer'. For example, Scott Aaronson has expressed…
Discrete lizard
  • 3,154
  • 2
  • 20
  • 42
43
votes
7 answers

Why is it harder to build quantum computers than classical computers?

Is it because we don't know exactly how to create quantum computers (and how they must work), or do we know how to create it in theory, but don't have the tools to execute it in practice? Is it a mix of the above two? Any other reasons?
PiMan
  • 2,235
  • 1
  • 21
  • 32
38
votes
6 answers

If quantum speed-up is due to the wave-like nature of quantum mechanics, why not just use regular waves?

The intuition I have for why quantum computing can perform better than classical computing is that the wavelike nature of wavefunctions allow you to interfere multiple states of information with a single operation, which theoretically could allow…
Steven Sagona
  • 1,149
  • 7
  • 17
38
votes
3 answers

Can a quantum computer simulate a normal computer?

Similar to the question Could a Turing Machine simulate a quantum computer?: given a 'classical' algorithm, is it always possible to formulate an equivalent algorithm which can be performed on a quantum computer? If yes, is there some kind of…
Glorfindel
  • 628
  • 1
  • 9
  • 24
29
votes
4 answers

Are quantum computers just a variant on Analog computers of the 50's & 60's that many have never seen nor used?

In the recent Question "Is Quantum Computing just Pie in the Sky" there are many responses regarding the improvements in quantum capabilities, however all are focussed on the current 'digital' computing view of the world. Analog computers of old…
Philip Oakley
  • 391
  • 4
  • 6
29
votes
5 answers

Does Moore's law apply to quantum computing?

Plain and simple. Does Moore's law apply to quantum computing, or is it similar but with the numbers adjusted (ex. triples every 2 years). Also, if Moore's law doesn't apply, why do qubits change it?
Alex Jone
  • 633
  • 7
  • 8
25
votes
3 answers

What makes quantum computers so good at computing prime factors?

One of the common claims about quantum computers is their ability to "break" conventional cryptography. This is because conventional cryptography is based on prime factors, something which is computationally expensive for conventional computers to…
Paul Turner
  • 353
  • 3
  • 8
24
votes
3 answers

Is quantum cryptography safer than classical cryptography?

Quantum computing allows us to encrypt information in a different way compared to what we use today, but quantum computers are much more powerful than today's computers. So if we manage to build quantum computers (hence use quantum cryptography),…
PiMan
  • 2,235
  • 1
  • 21
  • 32
22
votes
3 answers

Is it possible to "calculate" the absolute value of a permanent using Boson Sampling?

In boson sampling, if we start with 1 photon in each of the first $M$ modes of an interferometer, the probability of detecting 1 photon in each output mode is: $|\textrm{Perm}(A)|^2$, where the columns and rows of $A$ are the first $M$ columns of…
user1271772 No more free time
  • 14,286
  • 2
  • 26
  • 76
18
votes
4 answers

Quantum circuits explain algorithms, why didn't classical circuits?

When explaining a quantum algorithm, many revert to 'circuit-speak' by drawing a diagram of how qubits split off into transformations and measurements, however, rarely if not never would someone explaining a classical math algorithm revert to its…
develarist
  • 995
  • 7
  • 15
18
votes
5 answers

Implementing "Classical AND Gate" and "Classical OR Gate" with a quantum circuit

Quantum cNOT Gate (Classical XOR Gate) A "Controlled NOT (cNOT) Gate" flips the 2nd qubit if the 1st qubit is $\left|1\right>$, and returns the 2nd qubit as-is if the 1st qubit is $\left|0\right>$. The 1st qubit is simply not changed. The net effect…
Siu Ching Pong -Asuka Kenji-
  • 403
  • 1
  • 3
  • 10
18
votes
2 answers

In a Quantum Turing Machine, how is the decision to move along the memory tape made?

Let, for a Quantum Turing machine (QTM), the state set be $Q$, and the alphabet of symbols be $\sum=\{0,1\}$, which appear at the tape head. Then, as per my understanding, at any given time while the QTM is calculating, the qubit that appears at its…
Prem
  • 233
  • 1
  • 8
14
votes
4 answers

Is the common Computer Science usage of 'ignoring constants' useful when comparing classical computing with quantum computing?

Daniel Sank mentioned in a comment, responding to (my) opinion that the constant speed-up of $10^8$ on a problem admitting a polynomial time algorithm is meager, that Complexity theory is way too obsessed with infinite size scaling limits. What…
Discrete lizard
  • 3,154
  • 2
  • 20
  • 42
13
votes
2 answers

Does quantum computing already possess the level of abstraction to be explicable even without knowledge of physics?

Currently, quantum computer science (in contrast to classical computer science) can mostly only be understood if one has a good inside knowledge of physics, or more precisely quantum physics. Only then one can really understand the explanations of…
Tetragrammaton
  • 133
  • 6
1
2 3
…
10 11