You are not logged in. Your edit will be placed in a queue until it is peer reviewed.
We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.
Required fields*
- $\begingroup$ The first part only answers the question "how is the set of efficient algorithms on quantum circuits called". Although looking at the problems in the class gives an idea of what problems are known to currently have better quantum algorithms than classical algorithms, this doesn't lead to a general statement. The second part comes closer to what is being asked for, although those are examples, not a general statement. The general statement is of course beyond current knowledge, but I think that is worth mentioning. $\endgroup$Discrete lizard– Discrete lizard2018-04-04 07:43:24 +00:00Commented Apr 4, 2018 at 7:43
- $\begingroup$ To be clear, the fact that a problem is in BQP doesn't mean that quantum computing "can help". We can only say for a problem A that QC helps if A is in BQP, but not in P (or BPP?). $\endgroup$Discrete lizard– Discrete lizard2018-04-04 07:45:14 +00:00Commented Apr 4, 2018 at 7:45
- $\begingroup$ sorry, i can accept one answer only... thanks a lot! $\endgroup$hiro protagonist– hiro protagonist2018-04-07 09:49:44 +00:00Commented Apr 7, 2018 at 9:49
- $\begingroup$ One aspect I can not find clearly back in your answer is the kind of problems that can be solved more efficiently by a quantum computer. In the first paragraph you mention that we have a rough idea but is this rough idea documented in the answer ? $\endgroup$JanVdA– JanVdA2018-06-19 12:34:00 +00:00Commented Jun 19, 2018 at 12:34
- $\begingroup$ @JanVdA All the standard quantum algorithms like Grover's, Shor's, etc give us rough ideas of what type of problems could be solved more efficiently by a quantum computer. I didn't feel the need of covering that in the answer as you'd find it in any general textbook on the subject or even Wiikipedia. The point is that we're not sure that there can't exist classical algorithms which will perform as well or better than those. $\endgroup$Sanchayan Dutta– Sanchayan Dutta2018-06-19 13:20:26 +00:00Commented Jun 19, 2018 at 13:20
| Show 2 more comments
How to Edit
- Correct minor typos or mistakes
- Clarify meaning without changing it
- Add related resources or links
- Always respect the author’s intent
- Don’t use edits to reply to the author
How to Format
- create code fences with backticks ` or tildes ~ ```
like so
``` - add language identifier to highlight code ```python
def function(foo):
print(foo)
``` - put returns between paragraphs
- for linebreak add 2 spaces at end
- _italic_ or **bold**
- indent code by 4 spaces
- backtick escapes
`like _so_` - quote by placing > at start of line
- to make links (use https whenever possible) <https://example.com>[example](https://example.com)<a href="https://example.com">example</a>
- MathJax equations
$\sin^2 \theta$
How to Tag
A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.
- complete the sentence: my question is about...
- use tags that describe things or concepts that are essential, not incidental to your question
- favor using existing popular tags
- read the descriptions that appear below the tag
If your question is primarily about a topic for which you can't find a tag:
- combine multiple words into single-words with hyphens (e.g. quantum-gate), up to a maximum of 35 characters
- creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you