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

International Conference on Information Photonics

A simulation method for quantum algorithm using optical array logic

Nitta, Tado, Matoba, Yoshimura

Published Jan 1, 2005• 0 citations
OpenAlex

Related papers

Optical simulations of quantum logic

John C. Howell

•Aug 1, 2000•0 citations

A Simulation Method for Quantum Algorithm Using Optical Array Logic

Kouichi Nitta, Yasunori Tado, Osamu Matoba +1 more

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.

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

Optical implementation of quantum computers

John Rarity, Harald Weinfurter

Journal of Optics B Quantum and Semiclassical Optics•Sep 15, 2004•0 citations

A Fast Rearrangement Method for Defect-Free Atom Arrays

Yuqing Zhang, Zeyan Zhang, Guoqing Zhang +7 more

Defect-free atom arrays provide new possibilities for exploring exotic quantum phenomena and realizing quantum computing. However, quickly and efficiently preparing defect-free atom arrays poses challenges. This paper proposes an innovative parallel rearrangement method, namely the parallel compression filling algorithm (PCFA), wherein multiple movable optical tweezers operate simultaneously. By limiting the shape of the initial loading, the method reduces movement complexity. The simulation comparisons show that this algorithm is more efficient in preparing defect-free atom arrays and can also be applied to the generation of other periodic structure arrays. The simulation results show that, in most cases, preparing a defect-free array of 400 atoms requires no more than 30 steps.

Photonics•Jan 28, 2025•1 citation

Synthesis of quantum arrays with low quantum costs from Kronecker Functional Lattice Diagrams

Dipal Shah, Marek A. Perkowski

Reversible logic has many applications such as Quantum computing, low power CMOS circuit design, Optical computing. Hence reversible logic synthesis has attracted attention especially in quantum computing community. A logic function is reversible if it is a one-to-one mapping between input and output vectors. In this paper we present a new approach to synthesis of reversible circuits using Kronecker Functional Lattice Diagrams. Unlike other contemporary algorithms for synthesis of reversible function that use n × n Toffoli gates, our method invariably synthesizes functions using only 3×3 Toffoli gates, Feynman gates and NOT gates. This reduces the quantum cost. Our method adds small cost by adding extra ancilla bits. Moreover, our circuits are always (4-neighbors) regular, which is an asset when they are mapped to 2-Dimensional arrays in Ion Trap (quantum) technology.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2010•4 citations

An Optical Approach to Quantum Computing

J. D. Franson, T. B. Pittman

Lecture notes in computer science•Jan 1, 1999•2 citations
Defect-free atom arrays provide new possibilities for exploring exotic quantum phenomena and realizing quantum computing. However, quickly and efficiently preparing defect-free atom arrays poses challenges. This paper proposes an innovative parallel rearrangement method, namely the parallel compression filling algorithm (PCFA), wherein multiple movable optical tweezers operate simultaneously. By limiting the shape of the initial loading, the method reduces movement complexity. The simulation comparisons show that this algorithm is more efficient in preparing defect-free atom arrays and can also be applied to the generation of other periodic structure arrays. The simulation results show that, in most cases, preparing a defect-free array of 400 atoms requires no more than 30 steps.
Reversible logic has many applications such as Quantum computing, low power CMOS circuit design, Optical computing. Hence reversible logic synthesis has attracted attention especially in quantum computing community. A logic function is reversible if it is a one-to-one mapping between input and output vectors. In this paper we present a new approach to synthesis of reversible circuits using Kronecker Functional Lattice Diagrams. Unlike other contemporary algorithms for synthesis of reversible function that use n × n Toffoli gates, our method invariably synthesizes functions using only 3×3 Toffoli gates, Feynman gates and NOT gates. This reduces the quantum cost. Our method adds small cost by adding extra ancilla bits. Moreover, our circuits are always (4-neighbors) regular, which is an asset when they are mapped to 2-Dimensional arrays in Ion Trap (quantum) technology.