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

Practical Graph Algorithms with Applications in Near-Term Quantum Computing.

Timothy D. Goodrich

Published Mar 26, 2020• 0 citations
OpenAlex

Related papers

Practical Graph Bipartization with Applications in Near-Term Quantum Computing.

Timothy D. Goodrich, Eric Horton, Blair D. Sullivan

•May 2, 2018•8 citations

Quantum Algorithms for Graph and Algebra Problems

Sebastian Dörn

Recent Advances in Computer Science and Communications•Jan 9, 2010•1 citation

Measuring the similarity of graphs with a Gaussian boson sampler

Maria Schuld, Kamil Brádler, Robert Israel +2 more

Gaussian boson samplers (GBSs) have initially been proposed as a near-term demonstration of classically intractable quantum computation. We show here that they have a potential practical application: Samples from these devices can be used to construct a feature vector that embeds a graph in Euclidean space, where similarity measures between graphs---so-called graph kernels---can be naturally defined. This is crucial for machine learning with graph-structured data, and we show that the GBS-induced kernel performs remarkably well in classification benchmark tasks. We provide a theoretical motivation for this success, linking the extracted features to the number of $r$ matchings in subgraphs. Our results contribute to a new way of thinking about kernels as a quantum hardware-efficient feature mapping, and lead to a promising application for near-term quantum computing.

arXiv:1905.12646•Physical Review A•Mar 11, 2020•111 citations

Applications of graph theory to quantum computation

Abbas Al-Shimary

•Jan 1, 2013•0 citations

Hybrid quantum-classical algorithms: Foundation, design and applications

Ran-Yi-Liu Chen, Benchi Zhao, Zhixin Song +3 more

Quantum computing, as an emerging computing paradigm, is expected to tackle problems such as quantum chemistry, optimization, quantum chemistry, information security, and artificial intelligence, which are intractable with using classical computing. Quantum computing hardware and software continue to develop rapidly, but they are not expected to realize universal quantum computation in the next few years. Therefore, the use of quantum hardware to solve practical problems in the near term has become a hot topic in the field of quantum computing. Exploration of the applications of near-term quantum hardware is of great significance in understanding the capability of quantum hardware and promoting the practical process of quantum computing. Hybrid quantum-classical algorithm (also known as variational quantum algorithm) is an appropriate model for near-term quantum hardware. In the hybrid quantum-classical algorithm, classical computers are used to maximize the power of quantum devices. By combining quantum computing with machine learning, the hybrid quantum-classical algorithm is expected to achieve the first practical application of quantum computation and play an important role in the studying of quantum computing. In this review, we introduce the framework of hybrid quantum-classical algorithm and its applications in quantum chemistry, quantum information, combinatorial optimization, quantum machine learning, and other fields. We further discuss the challenges and future research directions of the hybrid quantum-classical algorithm.

Acta Physica Sinica•Jan 1, 2021•13 citations

Contrasting Near-Term Quantum Security Protocols and Long-Term Quantum Algorithms: QBP vs. Grover's Algorithm

Victoria Mellor

In the rapidly evolving quantum computing landscape, various approaches leverage quantum mechanical properties for different computational and security objectives. This paper contrasts two distinct quantum technologies: the Quantum Burst Protocol (QBP) and Grover's search algorithm. While both utilize quantum mechanical principles, they serve fundamentally different purposes and represent opposite ends of the quantum application spectrum. QBP exemplifies a minimalist "quantum-lite" approach designed for near-term deployment in communication security, requiring only 2-3 qubits. In contrast, Grover's algorithm represents a theoretical quantum advantage requiring substantial quantum resources. We analyze their technical foundations, resource requirements, practical applications, and their interrelationship in the quantum security landscape. This comparison illuminates the diversity of quantum computing applications and provides insight into both practical near-term quantumenhanced technologies and theoretical quantum algorithms.

•May 23, 2025•0 citations
Gaussian boson samplers (GBSs) have initially been proposed as a near-term demonstration of classically intractable quantum computation. We show here that they have a potential practical application: Samples from these devices can be used to construct a feature vector that embeds a graph in Euclidean space, where similarity measures between graphs---so-called graph kernels---can be naturally defined. This is crucial for machine learning with graph-structured data, and we show that the GBS-induced kernel performs remarkably well in classification benchmark tasks. We provide a theoretical motivation for this success, linking the extracted features to the number of rrr matchings in subgraphs. Our results contribute to a new way of thinking about kernels as a quantum hardware-efficient feature mapping, and lead to a promising application for near-term quantum computing.
Quantum computing, as an emerging computing paradigm, is expected to tackle problems such as quantum chemistry, optimization, quantum chemistry, information security, and artificial intelligence, which are intractable with using classical computing. Quantum computing hardware and software continue to develop rapidly, but they are not expected to realize universal quantum computation in the next few years. Therefore, the use of quantum hardware to solve practical problems in the near term has become a hot topic in the field of quantum computing. Exploration of the applications of near-term quantum hardware is of great significance in understanding the capability of quantum hardware and promoting the practical process of quantum computing. Hybrid quantum-classical algorithm (also known as variational quantum algorithm) is an appropriate model for near-term quantum hardware. In the hybrid quantum-classical algorithm, classical computers are used to maximize the power of quantum devices. By combining quantum computing with machine learning, the hybrid quantum-classical algorithm is expected to achieve the first practical application of quantum computation and play an important role in the studying of quantum computing. In this review, we introduce the framework of hybrid quantum-classical algorithm and its applications in quantum chemistry, quantum information, combinatorial optimization, quantum machine learning, and other fields. We further discuss the challenges and future research directions of the hybrid quantum-classical algorithm.
In the rapidly evolving quantum computing landscape, various approaches leverage quantum mechanical properties for different computational and security objectives. This paper contrasts two distinct quantum technologies: the Quantum Burst Protocol (QBP) and Grover's search algorithm. While both utilize quantum mechanical principles, they serve fundamentally different purposes and represent opposite ends of the quantum application spectrum. QBP exemplifies a minimalist "quantum-lite" approach designed for near-term deployment in communication security, requiring only 2-3 qubits. In contrast, Grover's algorithm represents a theoretical quantum advantage requiring substantial quantum resources. We analyze their technical foundations, resource requirements, practical applications, and their interrelationship in the quantum security landscape. This comparison illuminates the diversity of quantum computing applications and provides insight into both practical near-term quantumenhanced technologies and theoretical quantum algorithms.