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

DOI10.1007/s11128-015-1189-4zbMath1358.81078arXiv1505.04584OpenAlexW3103771696MaRDI QIDQ513864

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 sumsGauss sumsfactorizationquantum computationoptical interferometryanalogue computers

Mathematics Subject Classification ID

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

Related Items (3)

Multi-boson correlation sampling ⋮ The Road to Quantum Computational Supremacy ⋮ Multipath correlation interference and controlled-NOT gate simulation with a thermal source

Cites Work

• Unnamed Item
• Multi-boson correlation sampling
• Boson sampling with non-identical single photons
• Factorization of numbers with physical systems
• Factorization with exponential sums
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• 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
• Sampling of bosonic qubits
• Factorization of numbers with truncated Gauss sums at rational arguments
• New factorization algorithm based on a continuous representation of truncated Gauss sums

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