Oversimplifying quantum factoring

被引：0

作者：

John A. Smolin

Graeme Smith

Alexander Vargo

机构：

[1] IBM T. J. Watson Research Center,

来源：

Nature | 2013年 / 499卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Building a device capable of factoring large numbers is a major goal of quantum computing; an algorithm for quantum factoring (Shor’s algorithm) exists, and a simple coin-tossing exercise is used to illustrate the dangers of oversimplification when implementing this algorithm experimentally.

引用

页码：163 / 165

页数：2

共 50 条

[41] Faster quantum number factoring via circuit synthesis
Markov, Igor L.
Saeedi, Mehdi
PHYSICAL REVIEW A, 2013, 87 (01):
[42] Fearful symmetries: Quantum computing, factoring, and graph isomorphism
Moore, C
ALGORITHMS - ESA 2005, 2005, 3669 : 10 - 10
[43] Quantum factoring, discrete logarithms, and the hidden subgroup problem
Jozsa, R
COMPUTING IN SCIENCE & ENGINEERING, 2001, 3 (02) : 34 - 43
[44] Extension of quantum factoring applying white noise analysis
Asghari, R.
JOURNAL OF OPTOELECTRONICS AND ADVANCED MATERIALS, 2018, 20 (3-4): : 133 - 139
[45] Exact analyses of computational time for factoring in quantum computers
Kunthiro, N
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (01) : 105 - 111
[46] Oversimplifying Primary Care Supply and Shortages
Freed, Gary L.
Stockman, James A.
JAMA-JOURNAL OF THE AMERICAN MEDICAL ASSOCIATION, 2009, 301 (18): : 1920 - 1922
[47] Oversimplifying the Islamic Scientific Tradition
Sonja Brentjes
Metascience, 2004, 13 (1) : 83 - 86
[48] Shuffling cards, factoring numhers and the quantum baker's map
Lakshminarayan, A
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2005, 38 (37): : L597 - L605
[49] Factoring semi-primes with (quantum) SAT-solvers
Mosca, Michele
Verschoor, Sebastian R.
SCIENTIFIC REPORTS, 2022, 12 (01)
[50] SIMPLER TIMES + OVERSIMPLIFYING THE PAST
SNOW, RF
AMERICAN HERITAGE, 1991, 42 (05) : 7 - 7

← 1 2 3 4 5 →