Factorization of numbers with Gauss sums: III. Algorithms with entanglement
From MaRDI portal
Publication:5137602
DOI10.1088/1367-2630/14/1/013049zbMath1448.81260arXiv1210.6491OpenAlexW3099329168MaRDI QIDQ5137602
Publication date: 2 December 2020
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6491
Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Entanglement measures, concurrencies, separability criteria (81P42)
Related Items (3)
Factorization with a logarithmic energy spectrum ⋮ Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation ⋮ Analogue algorithm for parallel factorization of an exponential number of large integers. I: Theoretical description
Cites Work
- Quantum entanglement
- Factorization of numbers with Gauss sums: I. Mathematical background
- Factorization of numbers with Gauss sums: II. Suggestions for implementation with chirped laser pulses
- New factorization algorithm based on a continuous representation of truncated Gauss sums
- Quantum Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Factorization of numbers with Gauss sums: III. Algorithms with entanglement