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 条
  • [1] Oversimplifying quantum factoring
    Smolin, John A.
    Smith, Graeme
    Vargo, Alexander
    NATURE, 2013, 499 (7457) : 163 - 165
  • [2] A Quantum Leap in Factoring
    Monroe, Don
    COMMUNICATIONS OF THE ACM, 2024, 67 (06) : 20 - 21
  • [3] Variational Quantum Factoring
    Anschuetz, Eric
    Olson, Jonathan
    Aspuru-Guzik, Alan
    Cao, Yudong
    QUANTUM TECHNOLOGY AND OPTIMIZATION PROBLEMS, 2019, 11413 : 74 - 85
  • [4] Contributions of Quantum Factoring on Quantum Research
    Ferner, Clayton
    COMPUTER, 2022, 55 (08) : 5 - 7
  • [5] An Efficient Quantum Factoring Algorithm
    Regev, Oded
    JOURNAL OF THE ACM, 2025, 72 (01)
  • [6] Decoherence limits to quantum factoring
    Plenio, MB
    Knight, PL
    NEW DEVELOPMENTS ON FUNDAMENTAL PROBLEMS IN QUANTUM PHYSICS, 1997, 81 : 311 - 316
  • [7] Factoring in a dissipative quantum computer
    Miquel, C
    Paz, JP
    Perazzo, R
    PHYSICAL REVIEW A, 1996, 54 (04): : 2605 - 2613
  • [8] Factoring on a quantum annealing computer
    Lockheed Martin Corporation, United States
    Quantum Inf. Comput., 2019, 3-4 (252-261): : 252 - 261
  • [9] FACTORING ON A QUANTUM ANNEALING COMPUTER
    Warren, Richard H.
    QUANTUM INFORMATION & COMPUTATION, 2019, 19 (3-4) : 252 - 261
  • [10] Efficient networks for quantum factoring
    Beckman, D
    Chari, AN
    Devabhaktuni, S
    Preskill, J
    PHYSICAL REVIEW A, 1996, 54 (02): : 1034 - 1063
12345