Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q940334> ?p ?o }
Showing triples 1 to 96 of
96
with 100 triples per page.
- Q940334 subject Q7005305.
- Q940334 subject Q7066518.
- Q940334 subject Q7783886.
- Q940334 subject Q8266681.
- Q940334 subject Q8787745.
- Q940334 abstract "Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994. Informally it solves the following problem: given an integer N, find its prime factors.On a quantum computer, to factor an integer N, Shor's algorithm runs in polynomial time (the time taken is polynomial in log N, which is the size of the input). Specifically it takes quantum gates of order O((log N)2(log log N)(log log log N)) using fast multiplication, demonstrating that the integer factorization problem can be efficiently solved on a quantum computer and is thus in the complexity class BQP. This is substantially faster than the most efficient known classical factoring algorithm, the general number field sieve, which works in sub-exponential time – about O(e1.9 (log N)1/3 (log log N)2/3). The efficiency of Shor's algorithm is due to the efficiency of the quantum Fourier transform, and modular exponentiation by repeated squarings.If a quantum computer with a sufficient number of qubits could operate without succumbing to noise and other quantum decoherence phenomena, Shor's algorithm could be used to break public-key cryptography schemes such as the widely used RSA scheme. RSA is based on the assumption that factoring large numbers is computationally intractable. So far as is known, this assumption is valid for classical (non-quantum) computers; no classical algorithm is known that can factor in polynomial time. However, Shor's algorithm shows that factoring is efficient on an ideal quantum computer, so it may be feasible to defeat RSA by constructing a large quantum computer. It was also a powerful motivator for the design and construction of quantum computers and for the study of new quantum computer algorithms. It has also facilitated research on new cryptosystems that are secure from quantum computers, collectively called post-quantum cryptography.In 2001, Shor's algorithm was demonstrated by a group at IBM, who factored 15 into 3 × 5, using an NMR implementation of a quantum computer with 7 qubits. After IBM's implementation, two independent groups, one at the University of Science and Technology of China, and the other one at the University of Queensland, have implemented Shor's algorithm using photonic qubits, emphasizing that multi-qubit entanglement was observed when running the Shor's algorithm circuits. In 2012, the factorization of 15 was repeated. Also in 2012, the factorization of 21 was achieved, setting the record for the largest number factored with a quantum computer. In April 2012, the factorization of 143 was achieved, although this used adiabatic quantum computation rather than Shor's algorithm. It was discovered in November 2014, that this adiabatic quantum computation in 2012, had in fact also factored larger numbers, the largest being 56153, which is currently the record for the largest integer factored on a quantum device.".
- Q940334 wikiPageExternalLink a-step-towards-quantum-computing-entangling-10-billion-particles.
- Q940334 wikiPageExternalLink survey.ps.
- Q940334 wikiPageExternalLink ?p=208.
- Q940334 wikiPageExternalLink comment-9958.
- Q940334 wikiPageExternalLink chap3.pdf.
- Q940334 wikiPageExternalLink comp.html.
- Q940334 wikiPageExternalLink 3540669132.
- Q940334 wikiPageExternalLink lec9.ps.
- Q940334 wikiPageExternalLink quantumchap.pdf.
- Q940334 wikiPageExternalLink high-level.html.
- Q940334 wikiPageExternalLink ~schmuel.
- Q940334 wikiPageExternalLink survey1.ps.
- Q940334 wikiPageExternalLink comment-5187.
- Q940334 wikiPageExternalLink chap6.ps.
- Q940334 wikiPageExternalLink quantum-algorithms.herokuapp.com.
- Q940334 wikiPageExternalLink paper.pdf.
- Q940334 wikiPageExternalLink paper.ps.
- Q940334 wikiPageExternalLink paper.tex.
- Q940334 wikiPageExternalLink index.html.
- Q940334 wikiPageWikiLink Q1014065.
- Q940334 wikiPageWikiLink Q104752.
- Q940334 wikiPageWikiLink Q1074103.
- Q940334 wikiPageWikiLink Q1137759.
- Q940334 wikiPageWikiLink Q1151850.
- Q940334 wikiPageWikiLink Q1169249.
- Q940334 wikiPageWikiLink Q1228841.
- Q940334 wikiPageWikiLink Q131752.
- Q940334 wikiPageWikiLink Q136980.
- Q940334 wikiPageWikiLink Q140770.
- Q940334 wikiPageWikiLink Q1464944.
- Q940334 wikiPageWikiLink Q168756.
- Q940334 wikiPageWikiLink Q1751823.
- Q940334 wikiPageWikiLink Q176555.
- Q940334 wikiPageWikiLink Q1799665.
- Q940334 wikiPageWikiLink Q181551.
- Q940334 wikiPageWikiLink Q184743.
- Q940334 wikiPageWikiLink Q185410.
- Q940334 wikiPageWikiLink Q190026.
- Q940334 wikiPageWikiLink Q193796.
- Q940334 wikiPageWikiLink Q193878.
- Q940334 wikiPageWikiLink Q194213.
- Q940334 wikiPageWikiLink Q201339.
- Q940334 wikiPageWikiLink Q206816.
- Q940334 wikiPageWikiLink Q2118982.
- Q940334 wikiPageWikiLink Q230848.
- Q940334 wikiPageWikiLink Q2361771.
- Q940334 wikiPageWikiLink Q2393193.
- Q940334 wikiPageWikiLink Q2526250.
- Q940334 wikiPageWikiLink Q2623817.
- Q940334 wikiPageWikiLink Q263865.
- Q940334 wikiPageWikiLink Q269878.
- Q940334 wikiPageWikiLink Q2835770.
- Q940334 wikiPageWikiLink Q319400.
- Q940334 wikiPageWikiLink Q370071.
- Q940334 wikiPageWikiLink Q378201.
- Q940334 wikiPageWikiLink Q4054157.
- Q940334 wikiPageWikiLink Q43260.
- Q940334 wikiPageWikiLink Q4682635.
- Q940334 wikiPageWikiLink Q471906.
- Q940334 wikiPageWikiLink Q4846249.
- Q940334 wikiPageWikiLink Q50707.
- Q940334 wikiPageWikiLink Q50708.
- Q940334 wikiPageWikiLink Q513028.
- Q940334 wikiPageWikiLink Q5752087.
- Q940334 wikiPageWikiLink Q589491.
- Q940334 wikiPageWikiLink Q601325.
- Q940334 wikiPageWikiLink Q7005305.
- Q940334 wikiPageWikiLink Q7066518.
- Q940334 wikiPageWikiLink Q7233576.
- Q940334 wikiPageWikiLink Q7269018.
- Q940334 wikiPageWikiLink Q7269075.
- Q940334 wikiPageWikiLink Q756747.
- Q940334 wikiPageWikiLink Q7783886.
- Q940334 wikiPageWikiLink Q8266681.
- Q940334 wikiPageWikiLink Q829546.
- Q940334 wikiPageWikiLink Q830791.
- Q940334 wikiPageWikiLink Q83478.
- Q940334 wikiPageWikiLink Q8366.
- Q940334 wikiPageWikiLink Q847019.
- Q940334 wikiPageWikiLink Q8539.
- Q940334 wikiPageWikiLink Q864003.
- Q940334 wikiPageWikiLink Q864127.
- Q940334 wikiPageWikiLink Q866012.
- Q940334 wikiPageWikiLink Q868169.
- Q940334 wikiPageWikiLink Q8787745.
- Q940334 wikiPageWikiLink Q907385.
- Q940334 wikiPageWikiLink Q908207.
- Q940334 wikiPageWikiLink Q945127.
- Q940334 comment "Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994. Informally it solves the following problem: given an integer N, find its prime factors.On a quantum computer, to factor an integer N, Shor's algorithm runs in polynomial time (the time taken is polynomial in log N, which is the size of the input).".
- Q940334 label "Shor's algorithm".