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

Adaptive Optics: Analysis and Methods/Computational Optical Sensing and Imaging/Information Photonics/Signal Recovery and Synthesis Topical Meetings on CD-ROM

A Simulation Method for Quantum Algorithm Using Optical Array Logic

Kouichi Nitta, Yasunori Tado, Osamu Matoba, Takeaki Yoshimura

Published Jan 1, 2005• 1 citation
Publisher

Abstract

A simulator for exponential function in Shor’s quantum algorithm is presented. It is based on optical array logic (OAL) which is one of paradigm for digital optical computing. In the method, a quantum statement with superposition and entanglement is represented by twodimensional spatial pattern. Parallel processing set by OAL simulates quantum properties.

DOI
10.1364/aopt.2005.jwb8

Related papers

Array Representation of Entanglement for Pseudo-Quantum Gate Computing on Conventional Digital Circuits

Takeshi Hirano

Entanglement is important on quantum gate based computer. Simple implementation of simulated entanglement on conventional digital circuits requires spatial complexity O(2^N) where N is number of qubits. In this article, array representation of entanglement which requires spatial complexity O(N^2) is proposed for simulated quantum gate on conventional digital circuits. Simulation shows proposed method can solve the problem which Deutsch-Jozsa algorithm solves.

•Jun 25, 2020•0 citations

Classical and Quantum Optical Computing

Rupert C. D. Young, Philip M. Birch, Chris R. Chatwin

The quantum Fourier transform (QFT);Similarities and differences of coherent optical FFT to the QFT. Grover’s search algorithm implemented with a coherent optical correlator. Quantum algorithms requiring bit entanglement -Shor’s algorithm for large number factorisation. Spatial Light Modulator (SLM) pixels placed in a binary superposition state. Addressed with an “interaction free” measurement. Allows exponential increase in processing power. Quantum search algorithm for a decryption problem based on superposition state of coherent wavefront.

•Jan 1, 2017•0 citations

[Wrong]Array Representation of Entanglement for Pseudo-Quantum Gate Computing on Conventional Digital Circuits

Takeshi Hirano

[Note] Method in this article found as wrong and does not work. Entanglement is important on quantum gate based computer. Simple implementation of simulated entanglement on conventional digital circuits requires spatial complexity O(2^N) where N is number of qubits. In this article, array representation of entanglement which requires spatial complexity O(N^2) is proposed for simulated quantum gate on conventional digital circuits. Simulation shows proposed method can solve the problem which Deutsch-Jozsa algorithm solves.

•Jun 25, 2020•0 citations

[Wrong]Array Representation of Entanglement for Pseudo-Quantum Gate Computing on Conventional Digital Circuits

Takeshi Hirano

[Note] Method in this article found as wrong and does not work. Entanglement is important on quantum gate based computer. Simple implementation of simulated entanglement on conventional digital circuits requires spatial complexity O(2^N) where N is number of qubits. In this article, array representation of entanglement which requires spatial complexity O(N^2) is proposed for simulated quantum gate on conventional digital circuits. Simulation shows proposed method can solve the problem which Deutsch-Jozsa algorithm solves.

•Aug 12, 2020•0 citations

Implementation of Quantum Computation Algorithm Based on Spatial Coding

Naoya Tate, Yusuke Ogura, Jun Tanida

Spatial coding, which is an effective digital optical computing technique, is studied as an efficient implementation method of quantum computation algorithms. In the proposed scheme, quantum information is represented by intensity and phase of the elemental cells. We confirmed correct operation of the quantum teleportation algorithm by computer simulation. We also demonstrated an optical implementation of quantum gates experimentally.

Adaptive Optics: Analysis and Methods/Computational Optical Sensing and Imaging/Information Photonics/Signal Recovery and Synthesis Topical Meetings on CD-ROM•Jan 1, 2005•0 citations

An Efficient Quantum Computing technique for cracking RSA using Shor’s Algorithm

Vaishali Bhatia, K. R. Ramkumar

Quantum Computing is a prominent word in this era as it allows computation to be performed in no time. The motive of using Quantum Computing (QC) is that even exponentially large number of problems can be solved using it which was earlier difficult with the classical computing. Conventional methods are based on usage of bits which consist of 0's and 1's while QC works with qubits. The main issue is that conventional computing has issue of storage as well as computation even when parallel computation is performed on it. Concept of quantum parallelism allows the computation to be performed in exponentially very low time as compared to conventional method. This paper will discuss about Quantum Computing Algorithms and how Shor's algorithm is able to break RSA algorithms is discussed. Entanglement and superposition of qubits helps fast computation. The demonstration of the applicability has been evaluated based on Computation time, storage capacity, accuracy, confidentiality, efficiency, integrity, and availability. Among various algorithms Shor's technique is able to break various encryption algorithm with more supremacy as compared to conventional computing methods. In nutshell, paper will discuss about various QC algorithms and will illustrate how shor's algorithm is able to crack RSA.

International Conference on Computing, Communication and Automation•Oct 30, 2020•109 citations
A simulator for exponential function in Shor’s quantum algorithm is presented. It is based on optical array logic (OAL) which is one of paradigm for digital optical computing. In the method, a quantum statement with superposition and entanglement is represented by twodimensional spatial pattern. Parallel processing set by OAL simulates quantum properties.
The quantum Fourier transform (QFT);Similarities and differences of coherent optical FFT to the QFT. Grover’s search algorithm implemented with a coherent optical correlator. Quantum algorithms requiring bit entanglement -Shor’s algorithm for large number factorisation. Spatial Light Modulator (SLM) pixels placed in a binary superposition state. Addressed with an “interaction free” measurement. Allows exponential increase in processing power. Quantum search algorithm for a decryption problem based on superposition state of coherent wavefront.
[Note] Method in this article found as wrong and does not work. Entanglement is important on quantum gate based computer. Simple implementation of simulated entanglement on conventional digital circuits requires spatial complexity O(2^N) where N is number of qubits. In this article, array representation of entanglement which requires spatial complexity O(N^2) is proposed for simulated quantum gate on conventional digital circuits. Simulation shows proposed method can solve the problem which Deutsch-Jozsa algorithm solves.
[Note] Method in this article found as wrong and does not work. Entanglement is important on quantum gate based computer. Simple implementation of simulated entanglement on conventional digital circuits requires spatial complexity O(2^N) where N is number of qubits. In this article, array representation of entanglement which requires spatial complexity O(N^2) is proposed for simulated quantum gate on conventional digital circuits. Simulation shows proposed method can solve the problem which Deutsch-Jozsa algorithm solves.
Quantum Computing is a prominent word in this era as it allows computation to be performed in no time. The motive of using Quantum Computing (QC) is that even exponentially large number of problems can be solved using it which was earlier difficult with the classical computing. Conventional methods are based on usage of bits which consist of 0's and 1's while QC works with qubits. The main issue is that conventional computing has issue of storage as well as computation even when parallel computation is performed on it. Concept of quantum parallelism allows the computation to be performed in exponentially very low time as compared to conventional method. This paper will discuss about Quantum Computing Algorithms and how Shor's algorithm is able to break RSA algorithms is discussed. Entanglement and superposition of qubits helps fast computation. The demonstration of the applicability has been evaluated based on Computation time, storage capacity, accuracy, confidentiality, efficiency, integrity, and availability. Among various algorithms Shor's technique is able to break various encryption algorithm with more supremacy as compared to conventional computing methods. In nutshell, paper will discuss about various QC algorithms and will illustrate how shor's algorithm is able to crack RSA.