"Deutsch–Jozsa algorithm"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎노트: 새 문단)
 
 
(같은 사용자의 중간 판 2개는 보이지 않습니다)
1번째 줄: 1번째 줄:
 
== 노트 ==
 
== 노트 ==
  
−
===위키데이터===
 
−
* ID :  [https://www.wikidata.org/wiki/Q1028209 Q1028209]
 
 
===말뭉치===
 
===말뭉치===
 
# In fact, there is a Deutsch-Jozsa algorithm, a derivative of the Deutsch algorithm, which solve the problem using exactly one run.<ref name="ref_c69dce45">[https://leimao.github.io/blog/Deutsch-Jozsa-Algorithm/ Lei Mao's Log Book – Deutsch-Jozsa Algorithm]</ref>
 
# In fact, there is a Deutsch-Jozsa algorithm, a derivative of the Deutsch algorithm, which solve the problem using exactly one run.<ref name="ref_c69dce45">[https://leimao.github.io/blog/Deutsch-Jozsa-Algorithm/ Lei Mao's Log Book – Deutsch-Jozsa Algorithm]</ref>
29번째 줄: 27번째 줄:
 
===소스===
 
===소스===
 
  <references />
 
  <references />
 +
 +
==메타데이터==
 +
===위키데이터===
 +
* ID :  [https://www.wikidata.org/wiki/Q1028209 Q1028209]
 +
===Spacy 패턴 목록===
 +
* [{'LOWER': 'deutsch'}, {'OP': '*'}, {'LOWER': 'jozsa'}, {'LEMMA': 'algorithm'}]

2021년 2월 17일 (수) 19:21 기준 최신판

노트

말뭉치

  1. In fact, there is a Deutsch-Jozsa algorithm, a derivative of the Deutsch algorithm, which solve the problem using exactly one run.[1]
  2. In this blog post, I would like to discuss the Deutsch-Jozsa algorithm.[1]
  3. To understand how the Deutsch-Jozsa Algorithm works, let's have an input where n=1.[2]
  4. Further improvements to the Deutsch–Jozsa algorithm were made by Cleve et al.[3]
  5. The Deutsch-Jozsa algorithm was the first to show a separation between the quantum and classical difficulty of a problem.[4]
  6. Using the Deutsch-Jozsa algorithm, the question can be answered with just one function evaluation.[4]
  7. In this work, an all-dielectric metamaterial-based model is proposed and realized to demonstrate the quantum Deutsch-Jozsa algorithm.[5]
  8. We prove Deutsch-Jozsa algorithm can compute any symmetric partial Boolean function f with exact quantum 1-query complexity.[6]
  9. Deutsch-Jozsa algorithm first realized the exponential acceleration of classical algorithm and it solved the Deutsch problem of n qubits.[7]
  10. Deutsch-Jozsa algorithm has not completely been implemented on any quantum platform so far.[7]
  11. In this paper, a synthesis algorithm is proposed which can automatically generate all 8 truth tables and quantum circuits of 2-bit Deutsch-Jozsa algorithm.[7]
  12. The correctness of the quantum circuits and Deutsch-Jozsa algorithm is verified by IBM Q Experience.[7]
  13. The Deutsch-Jozsa algorithm can determine whether a function mapping all bitstrings to a single bit is constant or balanced, provided that it is one of the two.[8]
  14. Unlike any deterministic classical algorithm, the Deutsch-Jozsa Algorithm can solve this problem with a single iteration, regardless of the input size.[8]
  15. The Deutsch-Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992.[9]
  16. In 2003, the Deutsch–Jozsa algorithm was implemented on an ion-trap quantum computer by Gulde, Reibe and Lancaster and team.[10]
  17. This paper reviews a popular algorithm called Deutsch–Jozsa algorithm, to demonstrate the exponential quantum advantage quantum computers proved in certain use cases.[10]
  18. The Deutsch-Jozsa algorithm is considered one of the first examples of a quantum algorithm that is exponentially faster than any possible deterministic classical algorithm.[10]
  19. In this section, let’s see we can implement the Deutsch-Jozsa algorithm in a Quantum programming language called QASM (Quantum Assembly language).[10]
  20. In particular, we propose an implementation for the Deutsch Algorithm in a Sagnac interferometer and the Deutsch-Jozsa Algorithm in a ring cavity.[11]
  21. The Deutsch–Jozsa algorithm has been realized experimentally using bulk nuclear magnetic resonance techniques3,4, employing nuclear spins as quantum bits (qubits).[12]
  22. We present sequre quantum key distribution based on a special Deutsch-Jozsa algorithm using Greenberger-Horne-Zeilinger states.[13]
  23. In all quantum algorithms, Deutsch-Jozsa algorithm has been widely studied.[14]

소스

  1. ↑ 1.0 1.1 Lei Mao's Log Book – Deutsch-Jozsa Algorithm
  2. ↑ The Deutsch-Jozsa Algorithm
  3. ↑ Deutsch–Jozsa algorithm
  4. ↑ 4.0 4.1 IBM Quantum Experience
  5. ↑ Simulate Deutsch-Jozsa algorithm with metamaterials
  6. ↑ Revisiting Deutsch-Jozsa algorithm
  7. ↑ 7.0 7.1 7.2 7.3 Synthesis of Deutsch-Jozsa Circuits and Verification by IBM Q
  8. ↑ 8.0 8.1 Deutsch-Jozsa Algorithm — Grove 1.7.0 documentation
  9. ↑ Deutsch-Jozsa algorithm
  10. ↑ 10.0 10.1 10.2 10.3 Implementation of the Deutsch–Jozsa algorithm on IBM quantum computer
  11. ↑ Implementation of Deutsch and Deutsch-Jozsa algorithms with classical light
  12. ↑ Implementation of the Deutsch–Jozsa algorithm on an ion-trap quantum computer
  13. ↑ Quantum Cryptography Based on the Deutsch-Jozsa Algorithm
  14. ↑ Realization of seven-qubit Deutsch-Jozsa algorithm on NMR qua..

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'deutsch'}, {'OP': '*'}, {'LOWER': 'jozsa'}, {'LEMMA': 'algorithm'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=Deutsch–Jozsa_algorithm&oldid=52556"