Talk:Quantum algorithm

Physics C‑class Mid‑importance

	Physics portal This article is within the scope of WikiProject Physics, a collaborative effort to improve the coverage of Physics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.PhysicsWikipedia:WikiProject PhysicsTemplate:WikiProject Physicsphysics articles
C	This article has been rated as C-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-importance on the project's importance scale.

Computer science C‑class High‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

C

This article has been rated as C-class on Wikipedia's content assessment scale.

High

This article has been rated as High-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Merging with the Quantum Algorithm Zoo?

I've been in contact with Stephen Jordan of the Quantum Algorithm Zoo, and he is open to the possibility of merging the very extensive information available there into Wikipedia.

What do you think? — Preceding unsigned comment added by Shai mach (talk • contribs) 00:35, 4 November 2019 (UTC)[reply]

Typically one adds a section at the *bottom* of the talk page; adding it at the top may cause it to be lost.

Regarding the Quantum Algorithm Zoo, it looks like a great resource, yet it looks to me to give much more detail than is appropriate for a Wikipedia article. Sanpitch (talk) 23:56, 5 November 2019 (UTC)[reply]

Experimental Quantum Computing to Solve Systems of Linear Equations

Maybe we should add something about this: Experimental Quantum Computing to Solve Systems of Linear Equations

--Vitalij zad (talk) 14:39, 29 August 2013 (UTC)[reply]

It took six years, yet I just added something on this. 107.0.94.194 (talk) 21:45, 14 February 2019 (UTC)[reply]

Quantum / Classical 'equivalence'?

"All problems which can be solved on a quantum computer can be solved on a classical computer."

Although the above may be true in some abstract mathematical sense, I don't think it is true in reality.

David Deutsch describes, in 'The Fabric of Reality' some problems which could be rapidly solved by a quantum computer that could not be solved by any classical computer that could ever conceivably be constructed. (Put another way: classical computers could solve any problem a quantum computer could solve, it the universe didn't impose the constraints that it actually *does* impose.) At the moment, I think the lead into this article might suggest that quantum computers are a bit (or a *lot*) faster than classical computers - but really, it is more than that: quantum computers can actually solve, in the physical universe, problems that will never, ever be solved (in our actual, real universe - as opposed to an abstract, hypothetical one) by a classical computer. 62.232.250.50 (talk) 18:37, 10 January 2014 (UTC)[reply]

BQP-complete

Perhaps the article should explain the BQP acronym (I think I can guess, but...) 62.232.250.50 (talk) 19:00, 10 January 2014 (UTC)[reply]

Yep, just added a description. Jaydavidmartin (talk) 22:58, 7 April 2020 (UTC)[reply]

"Exponential speedup"

It is extremely common to use "exponential speedup" very loosely, and say that Shor's algorithm provides an exponential speedup over GNFS. However, given that GNFS already provides sub-exponential factoring (that is, faster than $$c^n$$ for any $$c > 0$$), we should probably change the last sentence in the leading paragraph which claims that Shor's algorithm provides an "exponential speedup". Thoughts?

I changed the lede to say "much (almost exponentially) faster" rather than "exponentially faster". Sanpitch (talk) 20:31, 19 March 2019 (UTC)[reply]

Quadratically faster than linear?

The introduction says: Grover's algorithm runs quadratically faster than the best possible classical algorithm for the same task, a linear search.

What does that even mean? Surely it doesn't want to imply Grover's algorithm runs in $O\left({\frac {1}{N}}\right)$ , making it faster the more there is to search in. 62.216.5.216 (talk) 15:28, 21 April 2021 (UTC)[reply]