Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation

DOI10.1007/S11128-015-1189-4MaRDI QIDQ513864zbMATH OpenOpenAlexFDO

Authors Vincenzo Tamma

Publication date 8 March 2017

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.04584

zbMATH Keywords

algorithmsexponential sumsfactorizationGauss sumsquantum computationoptical interferometryanalogue computers

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum optics (81V80) Factorization (11Y05)

Abstract: We report a detailed analysis of the optical realization [1, 3, 2, 4] of the analogue algorithm described in the first paper of this series [5] for the simultaneous factorization of an exponential number of integers. Such an analogue procedure, which scales exponentially in the context of first order interference, opens up the horizon to polynomial scaling by exploiting multi-particle quantum interference.

Recommendations

• Analogue algorithm for parallel factorization of an exponential number of large integers. I: Theoretical description
• Factorization of integers with multi-path optical interference
• New factorization algorithm based on a continuous representation of truncated Gauss sums
• Publication:4934743
• scientific article; zbMATH DE number 554529

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Boson sampling with non-identical single photons
• 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 physical systems
• Factorization of numbers with truncated Gauss sums at rational arguments
• Factorization with exponential sums
• Multi-boson correlation sampling
• New factorization algorithm based on a continuous representation of truncated Gauss sums
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Sampling of bosonic qubits

Cited in

(5)

• 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. I: Theoretical description
• Factorization of integers with multi-path optical interference
• The road to quantum computational supremacy

This page was built for publication: Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513864)