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 networks and systems

An Optical Quantum Computer that Uses Both Quantum Logic Gate and Quantum Annealing

Pushpendra Singh, Pathik Sahoo, C. S. Yadav, Laxmidhar Behera, Anirban Bandyopadhyay

Published Jan 1, 2024• 1 citation
Publisher
DOI
10.1007/978-981-97-1923-5_42

Related papers

Toward Practical-Scale Quantum Annealing Machine for Prime Factoring

Masaaki Maezawa, Go Fujii, Mutsuo Hidaka +8 more

We propose a prime factorizer operated in a framework of quantum annealing (QA). The idea is inverse operation of a multiplier implemented with QA-based Boolean logic circuits. We designed the QA machine on an application-specific-annealing-computing architecture which efficiently increases available hardware budgets at the cost of restricted functionality. The invertible operation of QA logic gates consisting of superconducting flux qubits was confirmed by circuit simulation with classical noise sources. The circuits were implemented and fabricated by using superconducting integrated circuit technologies with Nb/AlOx/Nb Josephson junctions. We also propose a 2.5Dimensional packaging scheme of a qubit-chip/interpose /package-substrate structure for realizing practically large-scale QA systems.

arXiv:1809.01425•Journal of the Physical Society of Japan•Apr 11, 2019•46 citations

Nondeterministic Logic Gates in Optical Quantum Computing

Hwang Lee, Jonathan P. Dowling, Federico M. Spedalieri

Chapman & Hall/CRC applied mathematics and nonlinear science series•Sep 19, 2007•0 citations

An elementary optical logic circuit for quantum computing: a review

Ankur Saharia, Ravi Kumar Maddila, Jalil Ali +2 more

Optical and Quantum Electronics•Jun 22, 2019•20 citations

Optimizing Optical Quantum Logic Gates using Genetic Algorithms

Zhanghan Wu, Sean D. Huver, Dmitry B. Uskov +2 more

We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with the highest known maximum success probability for a CZ gate (2/27) while maintaining a fidelity of 0.9997. Since the purpose of our algorithm is to optimize a unitary matrix for quantum transformations, it could easily be applied to other areas of interest such as quantum optics and quantum sensors.

arXiv:0708.1498•Aug 10, 2007•0 citations

Integrated waveguide circuits for optical quantum computing

Mark G. Thompson, A Politi, JCF Matthews +1 more

•Jan 1, 2011•0 citations

Designing unit Ising models for logic gate simulation through integer linear programming

Shunsuke Tsukiyama, Koji Nakano, Victor Parque +4 more

Ising models minimizing a quadratic objective function with spin variables of either −1 or +1 are instrumental in tackling combinatorial optimization problems by programmable Quantum Annealers. This paper introduces unit Ising models, where non-zero coefficients are restricted to −1 or +1. Due to the limited resolution of quantum annealers, unit Ising models are more suitable for quantum annealers. A fixed unit Ising model for logic circuits could lead to Application-Specific Unit Quantum Annealers (ASUQAs) for inverse function computation, similar to ASICs. Our findings suggest a powerful new method for compromising the RSA cryptosystem by leveraging ASUQAs for factorization.

arXiv:2406.18130•International Journal of Parallel Emergent and Distributed Systems•Dec 5, 2024•3 citations
We propose a prime factorizer operated in a framework of quantum annealing (QA). The idea is inverse operation of a multiplier implemented with QA-based Boolean logic circuits. We designed the QA machine on an application-specific-annealing-computing architecture which efficiently increases available hardware budgets at the cost of restricted functionality. The invertible operation of QA logic gates consisting of superconducting flux qubits was confirmed by circuit simulation with classical noise sources. The circuits were implemented and fabricated by using superconducting integrated circuit technologies with Nb/AlOx/Nb Josephson junctions. We also propose a 2.5Dimensional packaging scheme of a qubit-chip/interpose /package-substrate structure for realizing practically large-scale QA systems.
We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with the highest known maximum success probability for a CZ gate (2/27) while maintaining a fidelity of 0.9997. Since the purpose of our algorithm is to optimize a unitary matrix for quantum transformations, it could easily be applied to other areas of interest such as quantum optics and quantum sensors.
Ising models minimizing a quadratic objective function with spin variables of either −1 or +1 are instrumental in tackling combinatorial optimization problems by programmable Quantum Annealers. This paper introduces unit Ising models, where non-zero coefficients are restricted to −1 or +1. Due to the limited resolution of quantum annealers, unit Ising models are more suitable for quantum annealers. A fixed unit Ising model for logic circuits could lead to Application-Specific Unit Quantum Annealers (ASUQAs) for inverse function computation, similar to ASICs. Our findings suggest a powerful new method for compromising the RSA cryptosystem by leveraging ASUQAs for factorization.