Skip to main content

Questions tagged [classical-computing]

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

Filter by
Sorted by
Tagged with
4 votes
1 answer
420 views

Will standard programming languages be applicable for quantum computing?

I'm new to quantum computers and computing, so it's possible my question is pointless or unnecessary ... but what about current programming languages such as Java, C++, Python in terms of quantum ...
37 votes
3 answers
3k views

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 ...
17 votes
4 answers
4k views

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 ...
1 vote
0 answers
59 views

Can a Hankel matrix $H$ be efficiently decomposed into a linear combination of unitaries (LCU), so that $H=\sum_k a_k U_k$

Suppose I have a Hankel matrix of arbitrary size $N\times M=2^n\times 2^m$ for integers $n<m$ (the qubit numbers of two circuits I have at my possession), given by: $H=\begin{pmatrix}x_1&x_2&...
7 votes
1 answer
325 views

What is the relationship between the size of the Hilbert space for boson sampling and the complexity of classical simulating it?

My intuition is that the fastest classical algorithm for simulating some kind of noiseless quantum sampling process should scale roughly with the dimension of the Hilbert space: you would need to ...
5 votes
1 answer
230 views

Has the possibility of there being a classical cryptography algorithm able to withstand quantum computing been proven?

Has it been proven, that a classical codec (encoder-decoder) (classical meaning one that doesn't require a quantum system for its operation) is possible, such that a quantum computer cannot crack it? ...
4 votes
1 answer
156 views

Could we use varying voltage with programmable gates?

One of the benefits I'm reading about qubits is that they can be in an infinite number of states. I'm aware of Holevo's bound (even though I don't fully understand it). However, it made me think of ...
29 votes
4 answers
7k views

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' ...
4 votes
2 answers
154 views

Can error correction for a classical algorithm with bit flips be easier than for a general quantum circuit?

Assume one runs a purely classical algorithm on $n$ logical qubits on a physical device with some bit flip probability. Can implementing error correction in this case be any easier than in the case of ...
4 votes
2 answers
1k views

Does 1 qubit correspond to 2 bits?

In a lot of presentation I always see people say that $n$ qbit are approximately $2^n$ classical bit. Those talks where oriented for a broad audience, so they left out a lot of things. Deep down I ...
8 votes
3 answers
2k views

What exactly makes quantum computers faster than classical computers?

What feature of a quantum algorithm makes it better than its classical counterpart? Are quantum computers faster than classical ones in all respects?
3 votes
1 answer
211 views

What's the difference between open-source QRNG and Quantis Device?

qRNG is an open-source quantum random number generator written in python and Quantis RNG is a physical quantum random number generator. Both are capable of generating quantum random numbers, but how ...
6 votes
2 answers
2k views

Aren't qubits just ternary?

Qubits have 3 states: 1, 0, and 1 and 0 at the same time. If a qubit can have 3 states, then how come they are seen as different from ternary computing, which also has 3 states? Is it that the 3 ...
2 votes
2 answers
737 views

Are there problems that a classical computer can solve and a quantum computer can never solve?

Apologies if this is a silly question. But I've heard quantum computers can solve problems that classical computers can't. What about the converse, are there any problems that a classical computer can ...
1 vote
0 answers
94 views

Why is sampling considered difficult on a classical computer but easy on a quantum computer? [closed]

It is my understanding that classical computers have a hard time sampling results from an output from a quantum circuit, but quantum computers find it very easy to do so. Why is this?
1 vote
1 answer
126 views

What are the types of models of computation aside from the quantum query model?

It looks like in a lot of quantum algorithms, we use the quantum query model. I wanted to know what are the other types of models of computation, used in quantum computing as well as in classical ...
1 vote
1 answer
101 views

What is the counting argument for the number of elementary operations required for a random function?

What is the counting argument for the following statement (classical)? "A random function on n bits requires $e^{\Omega(n)}$ elementary operations." It appears in the introduction of PRL 116,...
9 votes
5 answers
3k views

Why can't quantum computation replace classical computation?

I am not a total novice of quantum computation (have read the first 6 chapters of Nielsen and Chuang, though not familiar with every part), but there are some fundamental questions that I don't know ...
12 votes
1 answer
2k views

Are circuits with more than 1000 gates common?

I have seen circuits with 30 qubits and around 500 gates. Also circuits with 32 qubits and 6000 gates. Are circuits with more than 1000 gates common in quantum computing? Are there many quantum ...
10 votes
3 answers
884 views

What is the simplest algorithm to demonstrate intuitively quantum speed-up?

What's the simplest algorithm (like Deutsch's algorithm and Grover's Algorithm) for intuitively demonstrating quantum speed-up? And can this algorithm be explained intuitively? Ideally this would be ...
4 votes
2 answers
163 views

Can the difference between quantum and classical circuits be attributed to different paths in the Hilbert space?

One of the explanations I have encountered for why quantum computation can provide speed-up over the classical is a picture that in the Hilbert space much more paths are allowed quantum-mechanically ...
2 votes
0 answers
193 views

When is a Quantum Computer Slower Than a Classical Computer?

Someone offhandedly mentioned to me that quantum computers are sometimes significantly (I guess they meant asymptotically) slower than classical computers. Unfortunately, I didn't get any arguments ...
4 votes
1 answer
94 views

Quantum computer speedups for classically efficient applications

I'm interested in learning about cases where a quantum computer could be used to perform tasks with only a constant (albeit large) factor of improvement in execution speed over classical computers. ...
9 votes
4 answers
5k views

Does a quantum computer have a clock signal and if yes how big is it?

I think there can't be a computer running software without having a clock signal. A fast classical computer has a clock rate between 4 to 5 GHz. If quantum computers are so much faster they must have ...
4 votes
1 answer
416 views

Using principle of deferred measurement to replace gates conditional on classical bits (c_if)

I am trying to implement the Iterative Phase Estimation algorithm on one of Qiskit's labs. I can do it for a 'nice' phase, such as 1/4 : But if I want to implement the algo generally (as a subroutine ...
3 votes
0 answers
65 views

Shor vs Schnorr: A classical algorithm for breaking RSA? [duplicate]

I am not sure why I haven't heard much chatter about this paper by Dr. Claus Peter Schnorr where he claims to have come up with a classical algorithm to break the RSA protocol. The construction is ...
9 votes
1 answer
1k views

Classical algorithm with complexity similar to Shor's discovered: Are there more efficient quantum algorithms than Shor's?

In the article Fast Factoring Integers by SVP Algorithms the author claims that he discovered classical algorithm for factoring integers in polynomial time. The Quantum Report mentioned here that it ...
2 votes
0 answers
21 views

Are classical analogues of quantum computers using superposed waves possible? [duplicate]

The trick of quantum computing is to take the advantage of wave mechanics (superposition) and entanglement. This allows to perform parallel computations/manipulations with $2^n$ superposed waves for $...
3 votes
2 answers
255 views

Generally speaking, are quantum speedups always due to parallelization of a given problem?

We know that quantum computers use the wave-like nature of quantum mechanics to perform interference. Sometimes we can use this interference to perform specific algorithms that will cause enough ...
6 votes
3 answers
217 views

Will Moore's Law be no longer effective once quantum computers are created? [duplicate]

Moore's law states that computer power doubles in every 18 months (more formally: "the number of transistors in a dense integrated circuit doubles about every two years."). Statistics suggest that ...
2 votes
2 answers
257 views

How do qubits in quantum computers work? [closed]

I was reading about quantum computers and qubits. While a classical bit can be either 0 or 1, a qubit can be 0 or 1 or both at the same time (can it be none too?). But how is this useful at all? If it ...
7 votes
1 answer
166 views

what matrix operations have better known time complexity on a quantum computer?

I'm exploring quantum computers for a semester project. I'm mainly interested in making faster matrix calculations than a regular computer. I was wondering what arithmetic operations (irrespective of ...
9 votes
5 answers
2k views

If quantum computing always return random measurement (or uncertain measurement), why do we still need it?

I am very new to quantum computing and currently studying quantum computing on my own through various resources (Youtube Qiskit, Qiskit website, book). As my mindset is still "locked" with ...
2 votes
1 answer
374 views

No. of bits in 160 qubits computer [duplicate]

I read in a book that (https://hub.packtpub.com/quantum-expert-robert-sutor-explains-the-basics-of-quantum-computing/) 160 qubits (quantum bits) could hold $2^{160} \approx1.46\times 10^{48}$ bits ...
3 votes
2 answers
189 views

Question on practical quantum computing programming code [duplicate]

Has anyone tried any quantum computing programming code that shows or demonstrates the advantage of a quantum computer over classical computers? Thanks a lot.
5 votes
1 answer
331 views

STO-3G Basis Set

Can someone please explain why STO-3G is considered to be a good basis set for quantum computing, while it does not help in classical computing? I would also be very grateful for any references to ...
3 votes
3 answers
353 views

Is there an explanation for why, to search through an unstructured database, the average number of checks is $\frac{N}{2}$ in classical computation?

I have came across many books online that all explain that if $N$ is large enough, then the average number of checks in $N/2$ but is there a mathematical explanation or derivation for why this is true?...
13 votes
2 answers
2k views

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 ...
3 votes
1 answer
100 views

Papers on classical optimization in QAOA

Are there any papers on the classical optimization part of QAOA? What is the most efficient method now? And how is the classical optimization classified?
9 votes
2 answers
439 views

Are we certain that quantum computers are more efficient than classical computers can be built?

I mean are we certain that they will be able to provide us a huge improvements (in some tasks) compared to clasical computers?
5 votes
0 answers
110 views

What is the best way to use loop statements on a quantum computer?

I am interested in solving a time dependent linear partial differential equation of the form $Ax=b$ which, in classical computing, would amount to looping over solutions of $Ax=b$ where $b$ is updated ...
1 vote
0 answers
135 views

Can hash functions speed up quantum simulation? (Generalizing May and Schlieper's idea)

Recently May and Schlieper have published a preprint (https://arxiv.org/abs/1905.10074) arguing that the modular exponential register in Shor's algorithms can be replaced with a universally hashed ...
4 votes
2 answers
783 views

Can classical linear algebra solvers implement quantum algorithms with similar speed-ups?

A quantum algorithm begins with a register of qubits in an initial state, a unitary operator (the algorithm) manipulates the state of those qubits, and then the state of the qubits is read out (or at ...
4 votes
2 answers
980 views

Is it possible to convert classical algorithms to quantum ones?

I am new in this field and I am considering to do research for my engineering degree. First, I would like to have an opinion from more experienced people. Do you think it is possible to convert ...
0 votes
1 answer
120 views

What are some general concepts of how a classical computer would interface with a quantum computer?

Very general question so I'm not looking for an exact answer. I just want a basic description of certain ways it can be done and then if possible the names of those ways, so that I can look them up ...
24 votes
3 answers
3k views

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 ...
8 votes
3 answers
1k views

Compiling a classical function to a quantum circuit in practice

It can be shown that any classical function $f$ can be implemented by a quantum circuit $Q_f$, so that $$ \sum_{x}|x,0^k\rangle \xrightarrow{\mathit{Q_f}} \sum_{x}|x,f(x)\rangle $$ where $f$ has $k$ ...
4 votes
2 answers
264 views

How does a classical computer simulate nonclassical correlations?

This may be a dumb question, if so please forgive me, it is late at night. I have learned that a classical computer can simulate a quantum computer in exponential time and space, but classical ...
5 votes
2 answers
486 views

References on quantum arithmetic circuit complexity

In classical computing, arithmetic circuit complexity is apparently a big topic. But I couldn't find much about the complexity of quantum arithmetic circuits. Almost all references like arXiv:1805....
3 votes
2 answers
353 views

Classical computations from restricted quantum gates

The CNOT gate together with phase shift gates for all possible angles are not universal for quantum computing. Are they also not universal for classical (reversible) computing? Is it possible to ...