# Tag Info

1

Given an arbitrary classical algorithm, you can trivially convert it into a "quantum algorithm" by simply making it into a reversible circuit. There are standard ways to do this. Of course, this doesn't really give you any "quantum advantage". Any quantum algorithm obtained this way will have the same efficiency as the same algorithm run ...

6


2

No. For instance, if I either give you $|00\rangle$ or $|11\rangle$ with 50% probability each, or $|00\rangle\pm|11\rangle$ with 50% probability each, there is no way to distinguish these two cases - not even with any whatsoever small probability. The mathematical reason is that those are described by the same density matrix - but you always get some pure ...

3

In general, you want to understand the process by which you compute the matrix elements if you were doing it by hand. In the example you give, for instance, you're effectively computing $|i-j|==1$. This has a classical algorithm which you can figure out, and there's your oracle. In this specific instance there are probably some smarter things you can do. For ...

3

It is referring the the "function variable" register of figure 1. It consists of $\log_2N$ qubits, all prepared in the $|0\rangle$ state.

3

To be more specific and as an addendum to Drito's answer which provides a good starting point for your search, I would like to narrow it down for you, by recommending Quantum Information Processing. Since this journal is good, and moreover it has papers regarding Image Processing related topics like its Representation, security.

2

This is a good list made by Prof. Rod Van Meter. Maybe you could look at the papers you based your work off of and see where they were published? That should give you a sense of which journals are interested in the sort of work you've done.

5

No, quantum computers can't run for-loops faster in general. There are certain specific tasks that can be done using a for-loop that can instead be done in a different way on a quantum computer, with fewer total operations. For example, Grover search can replace the loop for x in range(N): if predicate(x): y = x with something that uses $O(\sqrt{N})$ calls ...

0

On paper I think this a cool idea. Though the terms you are using like cost threshold, cost function, and weights will all have to be transformed. Classically this a well thought out idea and then to ask "If done on classical can I just tweak a few things and make them quantum?" is an awesome idea. The terms you used must be extended to the quantum ...

Top 50 recent answers are included