首页/论文/quant-ph/0601097

arXiv quant-ph/06010972006-01-15quant-ph

Shor's algorithm with fewer (pure) qubits

Christof Zalka

备注：: 12 pages

英文摘要：

In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which none of the about 2n qubits need to be initialised (though we still have to make the usual 2n measurements later on). Then I show how the modular additions in the algorithm can be carried out with a superposition of an arithmetic sequence. This makes parallelisation of Shor's algorithm easier. Finally I show how one can factor with only about 1.5n qubits, and maybe even fewer.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Local-dimension-invariant Calderbank-Shor-Steane Codes with an Improved Distance Promise

Quantum computers will need effective error-correcting codes. Current quantum processors require precise control of each particle, so having fewer particles to control might be beneficial. Although traditionally quantum computers are considered as using qubits (2-level systems), qudits (systems with more than 2-levels) are appealing since they can have an equivalent computational space using fewer particles, meaning fewer particles need to be controlled. In this work we prove how to construct codes with parameters $[[2^N,2^N-1-2N,\geq 3]]_q$ for any choice of prime $q$ and natural number $N$. …

2021-10-21quant-ph

Pure State Tomography with Fourier Transformation

Extracting information from quantum devices has long been a crucial problem in the field of quantum mechanics. By performing elaborate measurements, quantum state tomography, an important and fundamental tool in quantum science and technology, can be used to determine unknown quantum states completely. In this study, we explore methods to determine multi-qubit pure quantum states uniquely and directly. Two adaptive protocols are proposed, with their respective quantum circuits. Herein, two or three observables are sufficient, while the number of measurement outcomes is either the same as or fe…

2022-06-23quant-ph

量子相干与退相干在广义和噪声Shor算法中的研究

Coherence and decoherence in generalized Shor's algorithm

Nanchang University（南昌大学）；Shanghai University of Engineering Science（上海工程技术大学）

本文研究了广义和噪声Shor算法中的量子相干与退相干，推导了算法性能的上下界，并探讨了不同初始态下计算r的概率关系。

2026-10-05quant-ph

Pure state tomography with parallel unentangled measurements

Quantum state tomography (QST) aims at estimating a quantum state from averaged quantum measurements made on copies of the state. Most quantum algorithms rely on QST at some point and it is a well explored topic in the literature, mostly for mixed states. In this paper we focus on the QST of a pure quantum state using parallel unentangled measurements. Pure states are a small but useful subset of all quantum states, their tomography requires fewer measurements and is essentially a phase recovery problem. Parallel unentangled measurements are easy to implement in practice because they allow the…

2022-08-08quant-ph

多量子比特Toffoli门：T门数量指数级减少

Multi-qubit Toffoli with exponentially fewer T gates

本文提出随机Clifford+$T$电路，以指数级减少T门数量实现多量子比特Toffoli门，并给出最优上下界，同时扩展至其他布尔函数。

2025-10-08quant-ph

Efficient factorization with a single pure qubit and $log N$ mixed qubits

It is commonly assumed that Shor's quantum algorithm for the efficient factorization of a large number $N$ requires a pure initial state. Here we demonstrate that a single pure qubit together with a collection of $log_2 N$ qubits in an arbitrary mixed state is sufficient to implement Shor's factorization algorithm efficiently.

2005-11-20quant-ph

更多相关论文收起更多论文

Reliable channel-adapted error correction: Bacon-Shor code recovery from amplitude damping

We construct two simple error correction schemes adapted to amplitude damping noise for Bacon-Shor codes and investigate their prospects for fault-tolerant implementation. Both consist solely of Clifford gates and require far fewer qubits, relative to the standard method, to achieve correction to a desired order in the damping rate. The first, employing one-bit teleportation and single-qubit measurements, needs only one fourth as many physical qubits, while the second, using just stabilizer measurements and Pauli corrections, needs only half. We show that existing fault-tolerance methods can b…

2017-04-19quant-ph

Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three

To perform achieve fault-tolerant quantum computation, one can use flagged syndrome extraction with fewer ancilla qubits. However, it suffers from long circuit depth if one stabilizer is measured at a time. Previously, Reichardt showed that it is possible to measure multiple stabilizers with at most one shared flag qubit for certain small quantum codes. In this paper, we propose a procedure for general Calderbank-Shor-Steane codes of distance three so that multiple $Z$-stabilizers ($X$-stabilizers) can be fault-tolerantly measured in parallel with one shared flag qubit. We simulate the memory …

2023-02-17quant-ph

A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations indicate that the running time grows only quadratically with the number of qubits.

2008-08-14quant-ph

使用通用对称量子克隆的单量子比特多方传输

Single Qubit Multi-Party Transmission Using Universal Symmetric Quantum Cloning

研究在量子网络中利用最优对称通用量子克隆机作为中继，将单量子比特纯态高效传输给多方的问题，证明该方法能使所需传输的量子比特数比直接传输减少多个数量级。

2025-06-01quant-ph

更少Bacon，更高阈值

Less Bacon More Threshold

通过删除电路门，利用晶格手术和局部平面连接将Bacon-Shor码自级联，发现所得电路是更大Bacon-Shor码电路的子集，从而为Bacon-Shor码赋予阈值。

2023-05-20quant-ph

Universality of Uhrig dynamical decoupling for suppressing qubit pure dephasing and relaxation

The optimal $N$-pulse dynamical decoupling discovered by Uhrig for a spin-boson mmodel [Phys. Rev. Lett, {\bf 98}, 100504 (2007)] is proved to be universal in suppressing to $O(T^{N+1})$ the pure dephasing or the longitudinal relaxation of a qubit (or spin-1/2) coupled to a generic bath in a short-time evolution of duration $T$. It is also found that for the purpose of suppressing the longitudinal relaxation, an ideal Uhrig $π$-pulse sequence can be generalized to a sequence consisting of the ideal one superimposed with finite-duration pulses satisfying certain symmetry requirements.

2008-07-25cond-mat.mes-hallquant-ph

Qubit-environment entanglement outside of pure decoherence: hyperfine interaction

In spin-based architectures of quantum devices, the hyperfine interaction between the electron spin qubit and the nuclear spin environment remains one of the main sources of decoherence. This paper provides a short review of the current advances in the theoretical description of the qubit decoherence dynamics. Next, we study the qubit-environment entanglement using negativity as its measure. For an initial maximally mixed state of the environment, we study negativity dynamics as a function of environment size, changing the numbers of environmental nuclei and the total spin of the nuclei. Furth…

2022-10-19cond-mat.mes-hallquant-ph

在现有量子平台上执行Shor算法的实际挑战

Practical Challenges in Executing Shor's Algorithm on Existing Quantum Platforms

研究现有量子平台执行Shor算法的实际限制，发现当前硬件在分解密码相关整数方面存在显著差距，电路构造和保真度稳定性不足。

2026-01-13cs.CRcs.ETquant-ph

最近用于因数分解和计算离散对数的量子算法的无条件正确性

Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms

University of Oxford（牛津大学）

本文通过解析数论工具证明了Regev改进的量子算法在因数分解和计算离散对数问题上的无条件正确性。

2026-08-26cs.CCmath.NTquant-ph

Quantum Entanglement involved in Grover's and Shor's algorithms: the four-qubit case

In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures (numerical ones most of the time). One can ask a different question: what about a qualitative measure of entanglement ? In other words, we try to find what are the different entanglement SLOCC classes that can be generated by these two algorithms. We treat in this article the case of pure four-qubit systems.

2018-12-04math-phmath.MPquant-ph