Analogue algorithm for parallel factorization of an exponential number of large integers. I: Theoretical description
From MaRDI portal
Publication:513865
DOI10.1007/S11128-015-1190-YzbMATH Open1358.81079arXiv1505.04577OpenAlexW2222015269MaRDI QIDQ513865FDOQ513865
Authors: Vincenzo Tamma 
Publication date: 8 March 2017
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring" interferograms measured at the output of an analogue computer that allows the selection of the factors of each integer [1,2,3,4]. At the present stage the algorithm manifests an exponential scaling which may be overcome by an extension of this method to correlated qubits emerging from n-order quantum correlations measurements. We describe the conditions for a generic physical system to compute such an analogue algorithm. A particular example given by an "optical computer" based on optical interference will be addressed in the second paper of this series [5].
Full work available at URL: https://arxiv.org/abs/1505.04577
Recommendations
- Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation
- Factorization of integers with multi-path optical interference
- Factorization
- New factorization algorithm based on a continuous representation of truncated Gauss sums
- Asymptotically Fast Factorization of Integers
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Factorization (11Y05)
Cites Work
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Multi-boson correlation sampling
- Boson sampling with non-identical single photons
- Sampling of bosonic qubits
- New factorization algorithm based on a continuous representation of truncated Gauss sums
- Quantum Computer Science
- Factorization of numbers with physical systems
- Random renormalization in the semiclassical long-time limit of a precessing spin
- Factorization with exponential sums
- Factorization of numbers with Gauss sums. I: Mathematical background
- Factorization of numbers with Gauss sums. II: Suggestions for implementation with chirped laser pulses
- Factorization of numbers with Gauss sums: III. Algorithms with entanglement
- Factorization of numbers with truncated Gauss sums at rational arguments
Cited In (4)
- Multipath correlation interference and controlled-NOT gate simulation with a thermal source
- Multi-boson correlation sampling
- Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation
- Factorization of integers with multi-path optical interference
This page was built for publication: Analogue algorithm for parallel factorization of an exponential number of large integers. I: Theoretical description
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513865)
