New answers tagged

1

BQP (the quantum analog of BPP) is closed under polynomial time reductions, so if some NP-complete problem is in BQP, then all NP-complete problems are in BQP. For more arguments, check this Quora question or that Quora question.


-1

For a parallel computer, we need to have one billion different processors. In a quantum computer, a single register can perform a billion computations. This is known as quantum parallelism. Also a quantum computer returns a single randomly-selected correct result, while a parallel computer can directly return all valid results. That's the reason why reading ...


2

I'll try to answer your remaining question: what are analog and digital in computer science? The trouble is that these terms aren't from computer science. They are from the field called "signal processing". When someone says "analog computer", they simply mean that the computer is designed on principles of analog signal processing and ...


1

Before we had electric or electronic calculators, there were mechanical calculators. These worked with whole numbers, so they were digital, but they were powered by hand (typically by turning a crank) not by electricity. On the other hand, in the period 1900 to 1960 there were a variety of analogue computers that were powered by electricity. Even though ...


1

There is a distinction between continuous phenomena and discrete. It's the former than is called analog in computer science and the latter, digital. After all, the digits 0 and 1 are discrete. Whilst [0,1], the interval between 0 and 1 is continuous and so analog. (I don't know if you are familiar with the notation [a,b]. It simply means all numbers between ...


Top 50 recent answers are included