按年被提到
20122015 · 1 次2026
物理与量子›量子计算·arXiv:1202.5707 · quant-ph

Computing prime factors with a Josephson phase qubit quantum processor

Erik Lucero, Rami Barends, Yu Chen, Julian Kelly, Matteo Mariantoni, Anthony Megrant, Peter O'Malley, Daniel Sank, Amit Vainsencher, James Wenner, Ted White, Yi Yin 等 14 人 · 2012
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2015-07-22 · 最近 2024-11-23
2不同的人
2活跃月份
2讨论串
311被引(OpenAlex)
arXiv 摘要(候选层不写导读)

A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor's algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3-5], however this has yet to be shown using solid state quantum bits (qubits). Two advantages of superconducting qubit architectures are the use of conventional microfabrication techniques, which allow straightforward scaling to large numbers of qubits, and a toolkit of circuit elements that can be used to engineer a variety of qubit types and interactions[6, 7]. Using a number of recent qubit control and hardware advances [7-13], here we demonstrate a nine-quantum-element solid-state QuP and show three experiments to highlight its capabilities. We begin by characterizing the device with spectroscopy. Next, we produces coherent interactions between five qubits and verify bi- and tripartite entanglement via quantum state tomography (QST) [8, 12, 14, 15]. In the final experiment, we run a three-qubit compiled version of Shor's algorithm to factor the number 15, and successfully find the prime factors 48% of the time. Improvements in the superconducting qubit coherence times and more complex circuits should provide the resources necessary to factor larger composite numbers and run more intricate quantum algorithms.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论andyjohnson0 · 2015-07

“The paper describes a "proposed" algorithm with a lot of theoretical justification [1]. Is there any way to verify it on a real quantum computer or reliable simulation? I'm thinking of the way that Shor's algorithm was verified [2] using a real quantum device. [1] I'm not qualified to understand the detail of the paper, although I can appreciate its gene…”

A Polynomial Time Bounded-Error Quantum Algorithm for Boolean Satisfiability原评论 ↗
评论Strilanc · 2024-11

“I'm not trying to be evasive. I'm directly saying quantum computers won't factor interesting numbers for years. That's more typically described as biting the bullet. There are several experiments that claim to factor 15 with a quantum computer (e.g. [1][2]). But beware these experiments cheat to various degrees (e.g. instead of performing period finding …”

Understanding Google's Quantum Error Correction Breakthrough原评论 ↗