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 Mobile, Intelligent, and Ubiquitous Computing Conference (MIUCC)

Practical Quantum Computing: The Status Quo

Ahmed El-Mahdy

Published Sep 17, 2025• 0 citations
Publisher

Abstract

While quantum computing is showing strong promise, there is dismay about its current practical capabilities. After giving a quick introduction to quantum computing, this talk aims to highlight existing promising approaches in quantum computing that are starting to demonstrate a quantum advantage. We start with the quantum variational principle and variational circuits. We will discuss their utility in solving the ground-level energy that is used in many applications in computational chemistry, as well as their use in quantum neural networks. We then move into quantum optimisation using adiabatic quantum annealing, and the newly more promising counterdiabatic quantum computing. We then move into provably secure quantum communication. We conclude with quantum ghost imaging, showing how picturing an object without seeing it results in better quality!

DOI
10.1109/miucc66482.2025.11196780

Related papers

Quantum Computation: Entangling with the Future

Jiang Zhang

Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.

•Apr 1, 2017•0 citations

Practical advantage of quantum machine learning in ghost imaging

Tailong Xiao, Xinliang Zhai, Xiaoyan Wu +2 more

Abstract Demonstrating the practical advantage of quantum computation remains a long-standing challenge whereas quantum machine learning becomes a promising application that can be resorted to. In this work, we investigate the practical advantage of quantum machine learning in ghost imaging by overcoming the limitations of classical methods in blind object identification and imaging. We propose two hybrid quantum-classical machine learning algorithms and a physical-inspired patch strategy to allow distributed quantum learning with parallel variational circuits. In light of the algorithm, we conduct experiments for imaging-free object identification and blind ghost imaging under different physical sampling rates. We further quantitatively analyze the advantage through the lens of information geometry and generalization capability. The numerical results showcase that quantum machine learning can restore high-quality images but classical machine learning fails. The advantage of identification rate are up to 10% via fair comparison with the classical machine learning methods. Our work explores a physics-related application capable of practical quantum advantage, which highlights the prospect of quantum computation in the machine learning field.

Communications Physics•Jul 10, 2023•60 citations

The Promise and Challenges of Quantum Computing

Mark B. Ritter

This brief overview of quantum computing gives an intuitive, albeit incomplete view of why it shows promise over any known classical approach to computing. The difficulty of making a qubit which allows us to protect and control quantum information will be illustrated in an overview of existing quantum technologies, including ions, superconducting qubits, spins and defects in solids. Finally, I will review a few of the problems which may benefit most from quantum computing and why many in industry are excited by the prospects.

International Symposium on VLSI Technology, Systems and Applications (VLSI-TSA)•Aug 1, 2020•4 citations

Optimizing Variational Quantum Neural Networks Based on Collective Intelligence

Zitong Li, Tailong Xiao, Xiaoyang Deng +2 more

Quantum machine learning stands out as one of the most promising applications of quantum computing, widely believed to possess potential quantum advantages. In the era of noisy intermediate-scale quantum, the scale and quality of quantum computers are limited, and quantum algorithms based on fault-tolerant quantum computing paradigms cannot be experimentally verified in the short term. The variational quantum algorithm design paradigm can better adapt to the practical characteristics of noisy quantum hardware and is currently one of the most promising solutions. However, variational quantum algorithms, due to their highly entangled nature, encounter the phenomenon known as the “barren plateau” during the optimization and training processes, making effective optimization challenging. This paper addresses this challenging issue by researching a variational quantum neural network optimization method based on collective intelligence algorithms. The aim is to overcome optimization difficulties encountered by traditional methods such as gradient descent. We study two typical applications of using quantum neural networks: random 2D Hamiltonian ground state solving and quantum phase recognition. We find that the collective intelligence algorithm shows a better optimization compared to gradient descent. The solution accuracy of ground energy and phase classification is enhanced, and the optimization iterations are also reduced. We highlight that the collective intelligence algorithm has great potential in tackling the optimization of variational quantum algorithms.

Mathematics•May 22, 2024•7 citations

A practitioner’s guide to quantum algorithms for optimisation problems

Benjamin C. B. Symons, David Galvin, Emre Sahin +2 more

Abstract Quantum computing is gaining popularity across a wide range of scientific disciplines due to its potential to solve long-standing computational problems that are considered intractable with classical computers. One promising area where quantum computing has potential is in the speed-up of NP -hard optimisation problems that are common in industrial areas such as logistics and finance. Newcomers to the field of quantum computing who are interested in using this technology to solve optimisation problems do not have an easily accessible source of information on the current capabilities of quantum computers and algorithms. This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques and their practical application, focusing on their near-term potential for noisy intermediate scale quantum devices. The paper starts by drawing parallels between classical and quantum optimisation problems, highlighting their conceptual similarities and differences. Two main paradigms for quantum hardware are then discussed: analogue and gate-based quantum computers. While analog devices such as quantum annealers are effective for some optimisation problems, they have limitations and cannot be used for universal quantum computation. In contrast, gate-based quantum computers offer the potential for universal quantum computation, but they face challenges with hardware limitations and accurate gate implementation. The paper provides a detailed mathematical discussion with references to key works in the field, as well as a more practical discussion with relevant examples. The most popular techniques for quantum optimisation on gate-based quantum computers, the quantum approximate optimisation algorithm and the quantum alternating operator ansatz framework, are discussed in detail. However, it is still unclear whether these techniques will yield quantum advantage, even with advancements in hardware and noise reduction. The paper concludes with a discussion of the challenges facing quantum optimisation techniques and the need for further research and development to identify new, effective methods for achieving quantum advantage.

arXiv:2305.07323•Journal of Physics A Mathematical and Theoretical•Oct 6, 2023•43 citations

Keynote: What is Quantum Computing, And Why Should We Care?

Luís Soares Barbosa

Arguably, quantum computing is coming of age. With the race for quantum computing intensifying among major IT players and the emergence of proof-of-concept prototypes, it appears we are on the verge of a genuine shift. For the first time, the viability of quantum computing may be demonstrated in a number of real problems that are extremely difficult to handle, if possible at all, classically, and its utility discussed across various industries. In a sense, Feynman's dream of letting Nature, suitably engineered, compute for us through its own natural quantum behavior, seems to be closer, even if the project of a universal quantum computer still has a long way to go. In the somewhat emphatic language of the media, a ‘second quantum revolution’ is quickly approaching. It is characterized by the ability to harness the weirdest quantum phenomena, namely superposition and entanglement, as computational resources, with practical advantage. What is the real impact of quantum computing on science, the economy, institutions, and governance? Which challenges does it bring to the pursuit of the UN Sustainable Development Agenda? Will there be a quantum divide threatening to multiply present inequalities and social disruptions? This talk will present an overview of quantum computing, its current maturity, and, tentatively, address the questions above from a rigorous, multilateral perspective.

International Conference on eDemocracy & eGovernment•Jul 1, 2026•0 citations
While quantum computing is showing strong promise, there is dismay about its current practical capabilities. After giving a quick introduction to quantum computing, this talk aims to highlight existing promising approaches in quantum computing that are starting to demonstrate a quantum advantage. We start with the quantum variational principle and variational circuits. We will discuss their utility in solving the ground-level energy that is used in many applications in computational chemistry, as well as their use in quantum neural networks. We then move into quantum optimisation using adiabatic quantum annealing, and the newly more promising counterdiabatic quantum computing. We then move into provably secure quantum communication. We conclude with quantum ghost imaging, showing how picturing an object without seeing it results in better quality!
Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.
Abstract Demonstrating the practical advantage of quantum computation remains a long-standing challenge whereas quantum machine learning becomes a promising application that can be resorted to. In this work, we investigate the practical advantage of quantum machine learning in ghost imaging by overcoming the limitations of classical methods in blind object identification and imaging. We propose two hybrid quantum-classical machine learning algorithms and a physical-inspired patch strategy to allow distributed quantum learning with parallel variational circuits. In light of the algorithm, we conduct experiments for imaging-free object identification and blind ghost imaging under different physical sampling rates. We further quantitatively analyze the advantage through the lens of information geometry and generalization capability. The numerical results showcase that quantum machine learning can restore high-quality images but classical machine learning fails. The advantage of identification rate are up to 10% via fair comparison with the classical machine learning methods. Our work explores a physics-related application capable of practical quantum advantage, which highlights the prospect of quantum computation in the machine learning field.
This brief overview of quantum computing gives an intuitive, albeit incomplete view of why it shows promise over any known classical approach to computing. The difficulty of making a qubit which allows us to protect and control quantum information will be illustrated in an overview of existing quantum technologies, including ions, superconducting qubits, spins and defects in solids. Finally, I will review a few of the problems which may benefit most from quantum computing and why many in industry are excited by the prospects.
Quantum machine learning stands out as one of the most promising applications of quantum computing, widely believed to possess potential quantum advantages. In the era of noisy intermediate-scale quantum, the scale and quality of quantum computers are limited, and quantum algorithms based on fault-tolerant quantum computing paradigms cannot be experimentally verified in the short term. The variational quantum algorithm design paradigm can better adapt to the practical characteristics of noisy quantum hardware and is currently one of the most promising solutions. However, variational quantum algorithms, due to their highly entangled nature, encounter the phenomenon known as the “barren plateau” during the optimization and training processes, making effective optimization challenging. This paper addresses this challenging issue by researching a variational quantum neural network optimization method based on collective intelligence algorithms. The aim is to overcome optimization difficulties encountered by traditional methods such as gradient descent. We study two typical applications of using quantum neural networks: random 2D Hamiltonian ground state solving and quantum phase recognition. We find that the collective intelligence algorithm shows a better optimization compared to gradient descent. The solution accuracy of ground energy and phase classification is enhanced, and the optimization iterations are also reduced. We highlight that the collective intelligence algorithm has great potential in tackling the optimization of variational quantum algorithms.
Abstract Quantum computing is gaining popularity across a wide range of scientific disciplines due to its potential to solve long-standing computational problems that are considered intractable with classical computers. One promising area where quantum computing has potential is in the speed-up of NP -hard optimisation problems that are common in industrial areas such as logistics and finance. Newcomers to the field of quantum computing who are interested in using this technology to solve optimisation problems do not have an easily accessible source of information on the current capabilities of quantum computers and algorithms. This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques and their practical application, focusing on their near-term potential for noisy intermediate scale quantum devices. The paper starts by drawing parallels between classical and quantum optimisation problems, highlighting their conceptual similarities and differences. Two main paradigms for quantum hardware are then discussed: analogue and gate-based quantum computers. While analog devices such as quantum annealers are effective for some optimisation problems, they have limitations and cannot be used for universal quantum computation. In contrast, gate-based quantum computers offer the potential for universal quantum computation, but they face challenges with hardware limitations and accurate gate implementation. The paper provides a detailed mathematical discussion with references to key works in the field, as well as a more practical discussion with relevant examples. The most popular techniques for quantum optimisation on gate-based quantum computers, the quantum approximate optimisation algorithm and the quantum alternating operator ansatz framework, are discussed in detail. However, it is still unclear whether these techniques will yield quantum advantage, even with advancements in hardware and noise reduction. The paper concludes with a discussion of the challenges facing quantum optimisation techniques and the need for further research and development to identify new, effective methods for achieving quantum advantage.
Arguably, quantum computing is coming of age. With the race for quantum computing intensifying among major IT players and the emergence of proof-of-concept prototypes, it appears we are on the verge of a genuine shift. For the first time, the viability of quantum computing may be demonstrated in a number of real problems that are extremely difficult to handle, if possible at all, classically, and its utility discussed across various industries. In a sense, Feynman's dream of letting Nature, suitably engineered, compute for us through its own natural quantum behavior, seems to be closer, even if the project of a universal quantum computer still has a long way to go. In the somewhat emphatic language of the media, a ‘second quantum revolution’ is quickly approaching. It is characterized by the ability to harness the weirdest quantum phenomena, namely superposition and entanglement, as computational resources, with practical advantage. What is the real impact of quantum computing on science, the economy, institutions, and governance? Which challenges does it bring to the pursuit of the UN Sustainable Development Agenda? Will there be a quantum divide threatening to multiply present inequalities and social disruptions? This talk will present an overview of quantum computing, its current maturity, and, tentatively, address the questions above from a rigorous, multilateral perspective.