"Grover's algorithm"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎메타데이터: 새 문단)
 
1번째 줄: 1번째 줄:
−
== 노트 ==
 
−
 
−
===말뭉치===
 
−
# Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O(N1/2) time and using O(logN) storage space (see big O notation).<ref name="ref_099620d2">[https://www.quantiki.org/wiki/grovers-search-algorithm Grover's search algorithm]</ref>
 
−
# Grover's algorithm, which takes O(N1/2) time, is the fastest possible quantum algorithm for searching an unsorted database.<ref name="ref_099620d2" />
 
−
# Like all quantum computer algorithms, Grover's algorithm is probabilistic, in the sense that it gives the correct answer with high probability.<ref name="ref_099620d2" />
 
−
# Although the purpose of Grover's algorithm is usually described as "searching a database", it may be more accurate to describe it as "inverting a function".<ref name="ref_099620d2" />
 
−
# This is faster than the O ( N ) {\displaystyle O({\sqrt {N}})} steps taken by Grover's algorithm.<ref name="ref_06eccfca">[https://en.wikipedia.org/wiki/Grover%27s_algorithm Grover's algorithm]</ref>
 
−
# Grover's algorithm could brute-force a 128-bit symmetric cryptographic key in roughly 264 iterations, or a 256-bit key in roughly 2128 iterations.<ref name="ref_06eccfca" />
 
−
# Like many quantum algorithms, Grover's algorithm is probabilistic in the sense that it gives the correct answer with a probability of less than 1.<ref name="ref_06eccfca" />
 
−
# Grover's algorithm has implications for the security of symmetric-key cryptography as it can be used to search the key space.<ref name="ref_06eccfca" />
 
−
# Grover's algorithm searches a list of unstructured data for specific items.<ref name="ref_74570053">[https://docs.microsoft.com/en-us/azure/quantum/tutorial-qdk-grovers-search Run Grover's search algorithm in Q# - Quantum Development Kit - Azure Quantum]</ref>
 
−
# You can build Grover's search algorithm with just a few lines of code.<ref name="ref_74570053" />
 
−
# What does Grover's search algorithm do?<ref name="ref_74570053" />
 
−
# Grover's algorithm asks whether an item in a list is the one we are searching for.<ref name="ref_74570053" />
 
−
# To clear the role coherence plays on the essential operator level in Grover's search algorithm, here we discuss the coherence dynamics of the state after each basic operator is applyied.<ref name="ref_0e3e6391">[https://link.aps.org/doi/10.1103/PhysRevA.100.012349 Operator coherence dynamics in Grover's quantum search algorithm]</ref>
 
−
# Grover's algorithm searches a function for a single satisfying input.<ref name="ref_68cbbb9e">[http://twistedoakstudios.com/blog/Post2644_grovers-quantum-search-algorithm Grover’s Quantum Search Algorithm]</ref>
 
−
# So, if Grover's algorithm searches a function, how is that function represented?<ref name="ref_68cbbb9e" />
 
−
# However, since Grover's algorithm is almost entirely made up of Hadamard gates, I won't be covering them here.<ref name="ref_68cbbb9e" />
 
−
# We now return to Grover's algorithm.<ref name="ref_68cbbb9e" />
 
−
# Essentially, Grover's algorithm applies when you have a function which returns True for one of its possible inputs, and False for all the others.<ref name="ref_b2edcd50">[https://quantumcomputing.stackexchange.com/questions/1385/is-there-a-laymans-explanation-for-why-grovers-algorithm-works Is there a layman's explanation for why Grover's algorithm works?]</ref>
 
−
# Grover's algorithm requires only O ( N ) \mathcal{O}(\sqrt{N}) O(N ​) evaluations of the Oracle.<ref name="ref_d21db1c6">[https://www.quantum-inspire.com/kbase/grover-algorithm/ Code example: Grover's algorithm]</ref>
 
−
# Other examples where Grover's algorithm or similar methods are used are for instance minimization problems.<ref name="ref_d21db1c6" />
 
−
# For comparison, we implemented the same approach for the 2 and 3 Grover's algorithms.<ref name="ref_44192fa0">[https://ui.adsabs.harvard.edu/abs/2019APS..MARE42002W/abstract Implementation of Grover's quantum search algorithm with error mitigation at IBM Q computers]</ref>
 
−
# Previous research has shown that Grover's search algorithm, proposed in 1996, is an optimal quantum search algorithm, meaning no other quantum algorithm can search faster.<ref name="ref_7ff90efc">[https://phys.org/news/2018-01-qubit-grover-quantum.html Researchers implement 3-qubit Grover search on a quantum computer]</ref>
 
−
# However, implementing Grover's algorithm on a quantum system has been challenging.<ref name="ref_7ff90efc" />
 
−
# Now in a new study, researchers have implemented Grover's algorithm with trapped atomic ions.<ref name="ref_7ff90efc" />
 
−
# Grover's algorithm, on the other hand, first initializes the system in a quantum superposition of all 8 states, and then uses a quantum function called an oracle to mark the correct solution.<ref name="ref_7ff90efc" />
 
−
# Grover's search algorithm is designed to be executed on a quantum-mechanical computer.<ref name="ref_f612e569">[https://dl.acm.org/doi/abs/10.1145/319301.319303 Reasoning about Grover's quantum search algorithm using probabilistic wp]</ref>
 
−
# In this article, the probabilistic wp-calculus is used to model and reason about Grover's algorithm.<ref name="ref_f612e569" />
 
−
===소스===
 
−
<references />
 
−
 
−
== 메타데이터 ==
 
−
 
−
===위키데이터===
 
−
* ID :  [https://www.wikidata.org/wiki/Q1028292 Q1028292]
 
−
===Spacy 패턴 목록===
 
−
* [{'LOWER': 'grover'}, {'LOWER': "'s"}, {'LEMMA': 'algorithm'}]
 
−
* [{'LOWER': 'grover'}, {'LOWER': 'database'}, {'LOWER': 'search'}, {'LEMMA': 'algorithm'}]
 
−
* [{'LOWER': 'grover'}, {'LOWER': "'s"}, {'LOWER': 'search'}, {'LEMMA': 'algorithm'}]
 
−
 
 
== 노트 ==
 
== 노트 ==
  

2021년 2월 12일 (금) 22:47 기준 최신판

노트

말뭉치

  1. Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O(N1/2) time and using O(logN) storage space (see big O notation).[1]
  2. Grover's algorithm, which takes O(N1/2) time, is the fastest possible quantum algorithm for searching an unsorted database.[1]
  3. Like all quantum computer algorithms, Grover's algorithm is probabilistic, in the sense that it gives the correct answer with high probability.[1]
  4. Although the purpose of Grover's algorithm is usually described as "searching a database", it may be more accurate to describe it as "inverting a function".[1]
  5. This is faster than the O ( N ) {\displaystyle O({\sqrt {N}})} steps taken by Grover's algorithm.[2]
  6. Grover's algorithm could brute-force a 128-bit symmetric cryptographic key in roughly 264 iterations, or a 256-bit key in roughly 2128 iterations.[2]
  7. Like many quantum algorithms, Grover's algorithm is probabilistic in the sense that it gives the correct answer with a probability of less than 1.[2]
  8. Grover's algorithm has implications for the security of symmetric-key cryptography as it can be used to search the key space.[2]
  9. Grover's algorithm searches a list of unstructured data for specific items.[3]
  10. You can build Grover's search algorithm with just a few lines of code.[3]
  11. What does Grover's search algorithm do?[3]
  12. Grover's algorithm asks whether an item in a list is the one we are searching for.[3]
  13. To clear the role coherence plays on the essential operator level in Grover's search algorithm, here we discuss the coherence dynamics of the state after each basic operator is applyied.[4]
  14. Grover's algorithm searches a function for a single satisfying input.[5]
  15. So, if Grover's algorithm searches a function, how is that function represented?[5]
  16. However, since Grover's algorithm is almost entirely made up of Hadamard gates, I won't be covering them here.[5]
  17. We now return to Grover's algorithm.[5]
  18. Essentially, Grover's algorithm applies when you have a function which returns True for one of its possible inputs, and False for all the others.[6]
  19. Grover's algorithm requires only O ( N ) \mathcal{O}(\sqrt{N}) O(N ​) evaluations of the Oracle.[7]
  20. Other examples where Grover's algorithm or similar methods are used are for instance minimization problems.[7]
  21. For comparison, we implemented the same approach for the 2 and 3 Grover's algorithms.[8]
  22. Previous research has shown that Grover's search algorithm, proposed in 1996, is an optimal quantum search algorithm, meaning no other quantum algorithm can search faster.[9]
  23. However, implementing Grover's algorithm on a quantum system has been challenging.[9]
  24. Now in a new study, researchers have implemented Grover's algorithm with trapped atomic ions.[9]
  25. Grover's algorithm, on the other hand, first initializes the system in a quantum superposition of all 8 states, and then uses a quantum function called an oracle to mark the correct solution.[9]
  26. Grover's search algorithm is designed to be executed on a quantum-mechanical computer.[10]
  27. In this article, the probabilistic wp-calculus is used to model and reason about Grover's algorithm.[10]

소스

  1. ↑ 1.0 1.1 1.2 1.3 Grover's search algorithm
  2. ↑ 2.0 2.1 2.2 2.3 Grover's algorithm
  3. ↑ 3.0 3.1 3.2 3.3 Run Grover's search algorithm in Q# - Quantum Development Kit - Azure Quantum
  4. ↑ Operator coherence dynamics in Grover's quantum search algorithm
  5. ↑ 5.0 5.1 5.2 5.3 Grover’s Quantum Search Algorithm
  6. ↑ Is there a layman's explanation for why Grover's algorithm works?
  7. ↑ 7.0 7.1 Code example: Grover's algorithm
  8. ↑ Implementation of Grover's quantum search algorithm with error mitigation at IBM Q computers
  9. ↑ 9.0 9.1 9.2 9.3 Researchers implement 3-qubit Grover search on a quantum computer
  10. ↑ 10.0 10.1 Reasoning about Grover's quantum search algorithm using probabilistic wp

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'grover'}, {'LOWER': "'s"}, {'LEMMA': 'algorithm'}]
  • [{'LOWER': 'grover'}, {'LOWER': 'database'}, {'LOWER': 'search'}, {'LEMMA': 'algorithm'}]
  • [{'LOWER': 'grover'}, {'LOWER': "'s"}, {'LOWER': 'search'}, {'LEMMA': 'algorithm'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=Grover%27s_algorithm&oldid=50941"