Quantum-Classical Hybrid Algorithms

Mohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat +1 more

Problem statement: In this study, a general plan of hybrid architecture for quantum algorithms is proposed. Approach: Analysis of the quantum algorithms shows that these algorithms were hybrid with two parts. First, the relationship of classical and quantum parts of the hybrid algorithms was extracted. Then a general plan of hybrid structure was designed. Results: This plan was illustrated the hybrid architecture and the relationship of classical and quantum parts of the algorithms. This general plan was used to increase implementation performance of quantum algorithms. Conclusion/Recommendations: Moreover, simulation results of quantum algorithms on the hybrid architecture proved that quantum algorithms can be implemented on the general plan as well.

Dipankar Bhattacharyya, Jyotirmoy Guha

Roberto Campos

This thesis explores hybrid algorithms that combine classical and quantum computing to enhance the performance of classical algorithms. Two approaches are studied: a hybrid search and sample optimization algorithm and a classical algorithm that assesses the cost and performance of quantum algorithms in chemistry. Hybrid algorithms are vital due to limitations in both classical and quantum computing, offering a solution by leveraging the strengths of both. The first algorithm, quantum Metropolis Solver (QMS), adapts a quantum walk to a Metropolis-Hastings algorithm for industrial applications, demonstrating advantages over classical counterparts in various sectors. The second algorithm, TFermion, is a classical tool for evaluating the cost of T-type gates in quantum chemistry algorithms, aiding in the comparison and execution of these algorithms on real quantum hardware, and applied to the design of more efficient electric batteries.

Peter P. Rohde

Adam Callison, Nicholas Chancellor

The coming era of quantum computing promises to revolutionize computation, but, given the efficiency of many classical routines as well as quantum hardware limitations, calls to quantum devices are and will continue to be used as subroutines in larger, hybrid quantum-classical algorithms. This Perspective explores the essential differences between pure and hybrid quantum algorithms, discusses some examples, and frames the future of hybrid quantum-classical algorithms in its natural context of classical heterotic computing.

Mahn‐Soo Choi