Jump to content

Quantum complexity theory: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

22 October 2023

18 August 2023

8 August 2023

  • curprev 17:0317:03, 8 August 2023Citation bot talk contribs 27,703 bytes +7 Alter: title, template type. Add: chapter-url, chapter. Removed or converted URL. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox3 | #UCB_webform_linked 1635/2306 undo

22 July 2023

12 July 2023

2 July 2023

10 May 2023

5 April 2023

8 February 2023

29 July 2022

30 January 2022

7 December 2021

15 November 2021

1 September 2021

5 April 2021

4 April 2021

20 March 2021

15 March 2021

12 February 2021

19 January 2021

13 January 2021

28 December 2020

16 December 2020

7 December 2020

2 December 2020

26 November 2020

23 November 2020

22 September 2020

  • curprev 01:2301:23, 22 September 2020ColeDU talk contribs 8,671 bytes +153 I added a statement explaining that Grover's algorithm is not a completely optimized method. undo Tag: Visual edit
  • curprev 01:0501:05, 22 September 2020ColeDU talk contribs 8,518 bytes +25 I added the specific form of the best possible classical query complexity for searching unstructured databases. undo Tag: Visual edit
  • curprev 00:5500:55, 22 September 2020ColeDU talk contribs 8,493 bytes +326 I added the reference Ambainis, Andris (October 28, 2005). "Polynomial degree vs. quantum query complexity". Journal of Computer and System Sciences. 72 (2): 220–238. doi:10.1016/j.jcss.2005.06.006. and an in-text citation to the claim that the quantum query complexity of Grover's algorithm is {\textstyle O{\left({\sqrt {N}}\right)}} {\textstyle O{\left({\sqrt {N}}\right)}}, wich is "a quadratic improvement over the best possible classical query complexity, which is a linear." undo Tag: Visual edit
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)