使用2n+3量子位的肖尔算法电路

IF 0.7 4区物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS

Quantum Information & Computation Pub Date : 2003-03-01 DOI:10.5555/2011517.2011525

BeauregardStephane

引用次数: 226

摘要

我们尝试在量子计算机上使用肖尔算法来最小化分解n位整数所需的量子比特数。我们介绍了一个使用2n + 3个量子比特和0(n3lg(n))个初等电路的电路。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Circuit for Shor's algorithm using 2n+3 qubits

We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n + 3 qubits and 0(n3lg(n)) elementary...

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Quantum Information & Computation 物理-计算机：理论方法

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

3.3 months

期刊介绍： Quantum Information & Computation provides a forum for distribution of information in all areas of quantum information processing. Original articles, survey articles, reviews, tutorials, perspectives, and correspondences are all welcome. Computer science, physics and mathematics are covered. Both theory and experiments are included. Illustrative subjects include quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum communication and measurements, proposals and experiments on the implementation of quantum computation, communications, and entanglement in all areas of science including ion traps, cavity QED, photons, nuclear magnetic resonance, and solid-state proposals.