NISQ computing: where are we and where do we go?
In this short review article, we aim to provide physicists not working within the quantum
computing community a hopefully easy-to-read introduction to the state of the art in the field …
computing community a hopefully easy-to-read introduction to the state of the art in the field …
A framework for multiexcitonic logic
Exciton science sits at the intersection of chemical, optical and spin-based implementations
of information processing, but using excitons to conduct logical operations remains relatively …
of information processing, but using excitons to conduct logical operations remains relatively …
Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Hybrid quantum-classical algorithms are central to much of the current research in quantum
computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era …
computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era …
Evolving chimp optimization algorithm using quantum mechanism for engineering applications: a case study on fire detection
This paper introduces the Quantum Chimp Optimization Algorithm (QU-ChOA), which
integrates the Chimp Optimization Algorithm (ChOA) with quantum mechanics principles to …
integrates the Chimp Optimization Algorithm (ChOA) with quantum mechanics principles to …
Quantum annealing vs. QAOA: 127 qubit higher-order ising problems on NISQ computers
Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) are both
heuristic quantum algorithms intended for sampling optimal solutions of combinatorial …
heuristic quantum algorithms intended for sampling optimal solutions of combinatorial …
[HTML][HTML] Short-depth QAOA circuits and quantum annealing on higher-order ising models
We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and
QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p= 1, 2 rounds is …
QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p= 1, 2 rounds is …
Towards large-scale quantum optimization solvers with few qubits
Quantum computers hold the promise of more efficient combinatorial optimization solvers,
which could be game-changing for a broad range of applications. However, a bottleneck for …
which could be game-changing for a broad range of applications. However, a bottleneck for …
Quantum optimization using a 127-qubit gate-model IBM quantum computer can outperform quantum annealers for nontrivial binary optimization problems
We introduce a comprehensive quantum solver for binary combinatorial optimization
problems on gate-model quantum computers that outperforms any published alternative and …
problems on gate-model quantum computers that outperforms any published alternative and …
Classifying and benchmarking quantum annealing algorithms based on quadratic unconstrained binary optimization for solving NP-hard problems
JR Jiang, CW Chu - IEEE Access, 2023 - ieeexplore.ieee.org
Quantum annealing has the potential to outperform classical transistor-based computer
technologies in tackling intricate combinatorial optimization problems. However, ongoing …
technologies in tackling intricate combinatorial optimization problems. However, ongoing …
A practitioner's guide to quantum algorithms for optimisation problems
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 …
its potential to solve long-standing computational problems that are considered intractable …