Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

An Optical System for Prime Factorization Based on Parallel Processing

Kouichi Nitta, Osamu Matoba

Published Jan 1, 2011• 2 citations
Publisher
DOI
10.1007/978-3-642-22494-2_2

Related papers

Parallel Processing for Prime Factorization with Spatial Amplitude Modulation in Optics

Kouichi Nitta, Takashi Kamigiku, Takeshi Nakajima +1 more

Lecture notes in computer science•Jan 1, 2013•0 citations

Improvement of a System for Prime Factorization Based on Optical Interferometer

Kouichi Nitta, Nobuto Katsuta, Osamu Matoba

Lecture notes in computer science•Jan 1, 2009•4 citations

An Optical Parallel System for Prime Factorization

Kouichi Nitta, Nobuto Katsuta, Osamu Matoba

A system for prime factorization with optical modulo operations is developed and demonstrated. In the system, two-dimensional parallel processing is employed to achieve large-scale information processing for modulo multiplication, which is one of the important elements in an algorithm for prime factorization. This optical component is implemented on a Michelson interferometer. Electronic signal processing for pre-processing, postprocessing, and control of optical hardware is prepared as graphic user interface (GUI) software. With the constructed system, effective results can be obtained using the proposed method.

Japanese Journal of Applied Physics•Sep 24, 2009•4 citations

A Parallel Quantum Computer Simulator

Kevin Obenland, Alvin M. Despain

A Quantum Computer is a new type of computer which can efficiently solve complex problems such as prime factorization. A quantum computer threatens the security of public key encryption systems because these systems rely on the fact that prime factorization is computationally difficult. Errors limit the effectiveness of quantum computers. Because of the exponential nature of quantum com puters, simulating the effect of errors on them requires a vast amount of processing and memory resources. In this paper we describe a parallel simulator which accesses the feasibility of quantum computers. We also derive and validate an analytical model of execution time for the simulator, which shows that parallel quantum computer simulation is very scalable.

arXiv:quant-ph/9804039•Apr 16, 1998•52 citations

Analogue algorithm for parallel factorization of an exponential number of large integers: II—optical implementation

Vincenzo Tamma

arXiv:1505.04584•Quantum Information Processing•Nov 26, 2015•11 citations

Optical computing implementation of Shor's factorization algorithm

Songyuan Chen, Haosen Chen, Xin Tang +2 more

Physical Review A•May 14, 2026•0 citations
A system for prime factorization with optical modulo operations is developed and demonstrated. In the system, two-dimensional parallel processing is employed to achieve large-scale information processing for modulo multiplication, which is one of the important elements in an algorithm for prime factorization. This optical component is implemented on a Michelson interferometer. Electronic signal processing for pre-processing, postprocessing, and control of optical hardware is prepared as graphic user interface (GUI) software. With the constructed system, effective results can be obtained using the proposed method.
A Quantum Computer is a new type of computer which can efficiently solve complex problems such as prime factorization. A quantum computer threatens the security of public key encryption systems because these systems rely on the fact that prime factorization is computationally difficult. Errors limit the effectiveness of quantum computers. Because of the exponential nature of quantum com puters, simulating the effect of errors on them requires a vast amount of processing and memory resources. In this paper we describe a parallel simulator which accesses the feasibility of quantum computers. We also derive and validate an analytical model of execution time for the simulator, which shows that parallel quantum computer simulation is very scalable.