A review on quantum approximate optimization algorithm and its variants
Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …
variational quantum algorithm that aims to solve combinatorial optimization problems that …
Filtering variational quantum algorithms for combinatorial optimization
D Amaro, C Modica, M Rosenkranz… - Quantum Science …, 2022 - iopscience.iop.org
Current gate-based quantum computers have the potential to provide a computational
advantage if algorithms use quantum hardware efficiently. To make combinatorial …
advantage if algorithms use quantum hardware efficiently. To make combinatorial …
Quantum circuit synthesis and compilation optimization: Overview and prospects
Quantum computing is regarded as a promising paradigm that may overcome the current
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …
Qas-bench: rethinking quantum architecture search and a benchmark
Automatic quantum architecture search (QAS) has been widely studied across disciplines
with different implications. In this paper, beyond a particular domain, we formulate the QAS …
with different implications. In this paper, beyond a particular domain, we formulate the QAS …
An expressive ansatz for low-depth quantum optimisation
The Quantum Approximate Optimisation Algorithm (QAOA) is a hybrid quantum-classical
algorithm used to approximately solve combinatorial optimisation problems. It involves …
algorithm used to approximately solve combinatorial optimisation problems. It involves …
An expressive ansatz for low-depth quantum approximate optimisation
The quantum approximate optimisation algorithm (QAOA) is a hybrid quantum–classical
algorithm used to approximately solve combinatorial optimisation problems. It involves …
algorithm used to approximately solve combinatorial optimisation problems. It involves …
Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
A Pathak - arXiv preprint arXiv:2404.18142, 2024 - arxiv.org
In this work, energy levels of the Majumdar-Ghosh model (MGM) are analyzed up to 15
spins chain in the noisy intermediate-scale quantum framework using noisy simulations …
spins chain in the noisy intermediate-scale quantum framework using noisy simulations …
Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries
QAOA is a quantum algorithm for solving combinatorial optimization problems. It is capable
of searching for the minimizing solution vector $ x $ of a QUBO problem $ x^ TQx $. The …
of searching for the minimizing solution vector $ x $ of a QUBO problem $ x^ TQx $. The …