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

Electromagnetic waves

Variational Quantum Algorithm for Photonic Crystals(Invited Paper)

Long Chen, Xinyu Li, Jianlin Su, Siqi Huang, Zixuan Cai, Zhicai Yu, Yuming Ning, Qiang Xiao, Jianan Zhang, Qian Ma, Zhihao Lan, Jian Wei You, Tie-Jun Cui

Published Jan 1, 2025• 2 citations
Publisher
DOI
10.2528/pier25081203

Related papers

Variational Quantum Algorithms with Large-Scale Integrated Photonics

David D Roberts

•Jan 1, 2024•0 citations

Utilising Non-Unitary Integrated Quantum Photonics to realise Variational Quantum Algorithms

Owain C R Strassburg

•May 1, 2024•0 citations

Scalable Optimization of Binary Neural Networks Using Variational Quantum Algorithms

Anton Naim Ibrahim

I present a novel approach to training Binary Neural Networks (BiNNs) by leveraging Variational Quantum Algorithms (VQAs). My method employs the hybrid quantum-classical framework of VQAs to train simulated quantum circuits as hypernetworks that generate effective BiNN configurations. By developing approximate methods for calculating the VQA objective and gradient, I significantly scale quantum hypernetworks—over two orders of magnitude larger than previous capabilities, overcoming the constraints of exact computations. Quantum circuits are trained to produce effective BiNNs for binary classification tasks on resized and native resolution MNIST datasets. My empirical investigation extends to various VQA hyperparameters, including sample and batch sizes, circuit depth, and Multi-Basis Encoding (MBE). The results reveal that my optimized circuits consistently generate BiNN configurations with competitive cross-entropy losses. This work showcases the practical scalability of quantum hypernetworks and demonstrates significant interdisciplinary contribution in quantum machine learning, inviting further exploration into hybrid quantum-classical computational techniques.

•Aug 1, 2024•0 citations

The impact of quantum circuit architecture and hyperparameters on variational quantum algorithms exemplified in the electronic structure of the GaAs crystal

Ivana Miháliková, Michal Krejčí, Martin Friák

Variational Quantum Algorithms (VQAs) provide a promising framework for solving electronic structure problems using the computational capabilities of quantum computers to explore high-dimensional Hilbert spaces efficiently. This research investigates the performance of VQAs in electronic structure calculations of gallium arsenide (GaAs), a semiconductor with a zinc-blende structure. Utilizing a tight-binding Hamiltonian and a Jordan-Wigner-like transformation, we map the problem to a 10-qubit Hamiltonian. We analyze the impact of quantum circuit architectures, algorithm hyperparameters, and optimization methods on two VQAs: Variational Quantum Deflation (VQD) and Subspace Search Variational Quantum Eigensolver (SSVQE). We observed that while both algorithms offer promising results, the choice of ansatz and hyperparameter tuning were especially critical in achieving reliable outcomes, particularly for higher energy states. Adjusting the hyperparameters in VQD significantly enhanced the accuracy of higher energy state calculations, reducing the error by an order of magnitude, whereas tuning the hyperparameters in SSVQE had minimal impact. Our findings provide insights into optimizing VQAs for electronic structure problems, paving the way for their application to more complex systems on near-term quantum devices.

Scientific Reports•May 5, 2025•6 citations

Variational quantum algorithms

Marco Cerezo, Andrew Arrasmith, Ryan Babbush +8 more

arXiv:2012.09265•Nature Reviews Physics•Aug 12, 2021•4,270 citations

Post Quantum Cryptography(PQC) - An overview: (Invited Paper)

Manoj Kumar, Pratap Pattnaik

We discuss the Post Quantum Cryptography algorithms for key establishment under consideration by NIST for standardization. Three of these, Crystals- Kyber, Classic McEliece and Supersingular Isogeny based Key Encapsulation (SIKE), are representatives of the three classes of hard problems underlying the security of almost all 69 candidate algorithms accepted by NIST for consideration in round 1 of evaluation. For each algorithm, we briefly describe the hard problem underlying the algorithm's cryptographic strength, the algebraic structure i.e., the groups or finite fields, underlying the computations, the basic computations performed in these algorithms, the algorithm itself, and the performance considerations for efficient implementation of the basic algorithm on conventional many-core processors. For Crystals- Kyber and SIKE, we will discuss the potential solutions to improve their performance on many-core processors.

IEEE High Performance Extreme Computing Conference•Sep 22, 2020•80 citations
I present a novel approach to training Binary Neural Networks (BiNNs) by leveraging Variational Quantum Algorithms (VQAs). My method employs the hybrid quantum-classical framework of VQAs to train simulated quantum circuits as hypernetworks that generate effective BiNN configurations. By developing approximate methods for calculating the VQA objective and gradient, I significantly scale quantum hypernetworks—over two orders of magnitude larger than previous capabilities, overcoming the constraints of exact computations. Quantum circuits are trained to produce effective BiNNs for binary classification tasks on resized and native resolution MNIST datasets. My empirical investigation extends to various VQA hyperparameters, including sample and batch sizes, circuit depth, and Multi-Basis Encoding (MBE). The results reveal that my optimized circuits consistently generate BiNN configurations with competitive cross-entropy losses. This work showcases the practical scalability of quantum hypernetworks and demonstrates significant interdisciplinary contribution in quantum machine learning, inviting further exploration into hybrid quantum-classical computational techniques.
Variational Quantum Algorithms (VQAs) provide a promising framework for solving electronic structure problems using the computational capabilities of quantum computers to explore high-dimensional Hilbert spaces efficiently. This research investigates the performance of VQAs in electronic structure calculations of gallium arsenide (GaAs), a semiconductor with a zinc-blende structure. Utilizing a tight-binding Hamiltonian and a Jordan-Wigner-like transformation, we map the problem to a 10-qubit Hamiltonian. We analyze the impact of quantum circuit architectures, algorithm hyperparameters, and optimization methods on two VQAs: Variational Quantum Deflation (VQD) and Subspace Search Variational Quantum Eigensolver (SSVQE). We observed that while both algorithms offer promising results, the choice of ansatz and hyperparameter tuning were especially critical in achieving reliable outcomes, particularly for higher energy states. Adjusting the hyperparameters in VQD significantly enhanced the accuracy of higher energy state calculations, reducing the error by an order of magnitude, whereas tuning the hyperparameters in SSVQE had minimal impact. Our findings provide insights into optimizing VQAs for electronic structure problems, paving the way for their application to more complex systems on near-term quantum devices.
We discuss the Post Quantum Cryptography algorithms for key establishment under consideration by NIST for standardization. Three of these, Crystals- Kyber, Classic McEliece and Supersingular Isogeny based Key Encapsulation (SIKE), are representatives of the three classes of hard problems underlying the security of almost all 69 candidate algorithms accepted by NIST for consideration in round 1 of evaluation. For each algorithm, we briefly describe the hard problem underlying the algorithm's cryptographic strength, the algebraic structure i.e., the groups or finite fields, underlying the computations, the basic computations performed in these algorithms, the algorithm itself, and the performance considerations for efficient implementation of the basic algorithm on conventional many-core processors. For Crystals- Kyber and SIKE, we will discuss the potential solutions to improve their performance on many-core processors.