Related papers: Truncated Modular Exponentiation Operators: A Stra…
The road to computing on quantum devices has been accelerated by the promises that come from using Shor's algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and…
The assumed computationally difficulty of factoring large integers forms the basis of security for RSA public-key cryptography, which specifically relies on products of two large primes or semi-primes. The best-known factoring algorithms…
We show that a classical algorithm efficiently simulating the modular exponentiation circuit, for certain product state input and with measurements in a general product state basis at the output, can efficiently simulate Shor's factoring…
Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions,…
In quantum information processing (QIP), the quantum Fourier transform (QFT) has a plethora of applications [1] [2] [3]: Shor's algorithm and phase estimation are just a few well-known examples. Shor's quantum factorization algorithm, one…
The factorized form of the unitary coupled-cluster approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of…
Properties of Shor's algorithm and the related period-finding algorithm could serve as benchmarks for the operation of a quantum computer. Distinctive universal behaviour is expected for the probability for success of the period-finding…
Shor's algorithm outperforms its classical counterpart in efficient prime factorization. We explore the coherence and entanglement dynamics of the evolved states within Shor's algorithm, showing that the coherence in each step relies on the…
Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…
The operator product expansion (OPE), truncated in dimension, is employed in many contexts. An example is the extraction of the strong coupling, $\alpha_s$, from hadronic $\tau$-decay data, using a variety of analysis methods based on…
For an unknown eigenstate $|\psi\rangle$ of a unitary operator $U$, suppose we have an estimate of the corresponding eigenvalue which is separated from all other eigenvalues by a minimum gap of magnitude $\Delta$. In the eigenstate-marking…
In this paper, we combine the operator splitting methodology for abstract evolution equations with that of stochastic methods for large-scale optimization problems. The combination results in a randomized splitting scheme, which in a given…
We continue the study of truncated matrix-valued moment problems begun in arXiv:2310.00957. Let $q\in\mathbb{N}$. Suppose that $(\mathcal{X},\mathfrak{X})$ is a measurable space and $\mathcal{E}$ is a finite-dimensional vector space of…
Shor's factoring algorithm uses two quantum registers. By introducing more registers we show that the measured numbers in these registers which are of the same pre-measurement state, should be equal if the original Shor's complexity…
The quantum mechanical expression relating two commuting operators is reformulated such that the power method (also called method of moments) for iteratively calculating eigenvalues and eigenvectors becomes applicable. The new iterative…
We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The…
The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing…
Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this…
The integer factorization problem (IFP) underpins the security of RSA, yet becomes efficiently solvable on a quantum computer through Shor's algorithm. Regev's recent high-dimensional variant reduces the circuit size through lattice-based…
Quantum computing (QC) emulators, which simulate quantum algorithms on classical hardware, are indispensable platforms for testing quantum algorithms before scalable quantum computers become widely available. A critical challenge in QC…