Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · quant-ph/9907020

Quantum Probabilistic Subroutines and Problems in Number Theory

A. Carlini·A. Hosoya
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for extracting the periodicity of a function, and their combined use in the counting algorithm originally introduced by Brassard et al. One of the main features of our quantum probabilistic algorithm is its full unitarity and reversibility, which would make its use possible as part of larger and more complicated networks in quantum computers. As an example of this we describe polynomial time algorithms for studying some important problems in number theory, such as the test of the primality of an integer, the so called 'prime number theorem' and Hardy and Littlewood's conjecture about the asymptotic number of representations of an even integer as a sum of two primes.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Carlini, A. Hosoya. 2000-02-07. Quantum Probabilistic Subroutines and Problems in Number Theory. https://doi.org/10.1103/physreva.62.032312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Diagrammatic Method for Non-Gaussian Photon Correlations in Weakly Coupled Atomic Ensembles

We develop a scattering-theory formalism and use it to predict that a resonantly driven atomic ensemble weakly coupled to an optical mode can generate light with non-Gaussian correlations. Our approach---based on a perturbative diagrammatic expansion of multi-photon interactions---shows that photon-photon interaction mediated by the emitters causes the transmitted light to have a connected third-order correlation function $g_c^{(3)}$ containing non-Gaussian field correlations. The temporal pattern of $g_c^{(3)}$ is explained using the microscopic transport processes in terms of our diagrams. We derive an optical-depth-dependent bound on the perturbative truncation error and benchmark our predictions against cascaded master-equation and quantum trajectory simulations for small ensembles with $\mathrm{OD}\leq 2$, identifying a regime of controlled accuracy under weak driving. Our predictions can be experimentally demonstrated in state-of-the-art nanofibre-coupled atomic ensembles.

quant-ph↗
arXiv2026

A $k$-entanglement measure complying with the many-body resource theory and its evaluation

$k$-entanglement provides a hierarchical characterization of multipartite correlations according to their entanglement structure, ranging from multipartite entanglement ($k=n$) to genuine multipartite entanglement ($k=2$). Its quantitative treatment for mixed states faces three related obstacles: the standard axioms for such quantifications does not incorporate the requirements from many-body resource theory, as it does not regulate how to quantify the entanglement assigned to part systems of the same multipartite state and how to describe the rule that the entanglement possessed by a part system never exceeds the entanglement possed by whole system; no explicit measures are known that satisfy the above requirements from many-body resource theory; and the extreme difficulty in numerical evaluation at mixed states of known quantifications. In this work, we first formulate an axiomatic framework for \emph{true} $k$-entanglement measures that obeys the many-body resource theory, by supplementing usual faithfulness and LOCC monotonicity with two new ones: unification condition and hierarchy condition. Then, for every $2\leq k\leq n$, we construct a witness-based true $k$-entanglement measure $E_w^{(k,n)}$ without the convex-roof extension, which is valid for both finite- and infinite-dimensional $n$-partite systems. Finally, we derive a method of constructing finite-dimensional $k$-entanglement witnesses from positive operator and $k$-separable-state optimizations, design an evaluation scheme of $E_w^{(k,n)}$ based on pre-established database of $k$-entanglement witnesses sampled by positive operators. To check the feasibility of this computing scheme, we develop a software tool, which implements the computation of the approximation of $E_w^{(k,n)}$ for systems up to four qubits. Numerical tests show that the software is sufficiently accurate and reliable.

quant-ph↗
arXiv2026

Bandwidth-Cost Reduction for Photon-Matter Simulation at the Single-Photon Level

Simulations of quantum dynamics of traveling photons interacting with matter can be used to model and design photonic quantum-network components. Such simulations require selecting a finite set of photonic modes, where smaller sets are more desirable for computational efficiency. In this work, however, we show that opting for smaller subsets alters simulation results, if done naively. We therefore provide a consistency condition that can be used to calibrate the simulation input parameters to increase efficiency while preserving accuracy, simultaneously. This condition is then used to derive a simple prescription that reduces the propagation cost by two order of magnitude in a waveguide benchmark. Finally, we extend the same calibration principle to a two-dimensional atomic array, demonstrating the simultaneous benefits beyond analytically solvable waveguide models.

quant-ph↗