Related papers: A quantum computing approach to beam angle optimiz…
Quantum image processing is a growing field attracting attention from both the quantum computing and image processing communities. We propose a novel method in combining a graph-theoretic approach for optimal surface segmentation and hybrid…
Quantum optimization has emerged as a promising frontier of quantum computing, providing novel numerical approaches to mathematical optimization problems. The main goal of this paper is to facilitate interdisciplinary research between the…
Quadratic unconstrained binary optimization (QUBO) tasks are very important in chemistry, finance, job scheduling, and so on, which can be represented using graph structures, with the variables as nodes and the interaction between them as…
Solving optimization tasks using variational quantum algorithms has emerged as a crucial application of the current noisy intermediate-scale quantum devices. However, these algorithms face several difficulties like finding suitable ansatz…
The Quantum Approximate Optimisation Algorithm is a $p$ layer, time-variable split operator method executed on a quantum processor and driven to convergence by classical outer loop optimisation. The classical co-processor varies individual…
Objective: Despite recent advancements in quantum computing, the limited number of available qubits has hindered progress in CT reconstruction. This study investigates the feasibility of utilizing quantum annealing-based computed tomography…
This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a…
Portfolio Optimization (PO) is a financial problem aiming to maximize the net gains while minimizing the risks in a given investment portfolio. The novelty of Quantum algorithms lies in their acclaimed potential and capability to solve…
The Quantum Approximate Optimization Algorithm (QAOA), which is a variational quantum algorithm, aims to give sub-optimal solutions of combinatorial optimization problems. It is widely believed that QAOA has the potential to demonstrate…
Developing scalable, fault-tolerant atomic quantum processors requires precise control over large arrays of optical beams. This remains a major challenge due to inherent imperfections in classical control hardware, such as inter-channel…
The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently…
A black-box optimization algorithm such as Bayesian optimization finds extremum of an unknown function by alternating inference of the underlying function and optimization of an acquisition function. In a high-dimensional space, such…
Computed tomography (CT) is a non-destructive technique for observing internal images and has proven highly valuable in medical diagnostics. Recent advances in quantum computing have begun to influence tomographic reconstruction techniques.…
Optimizing Reconfigurable Intelligent Surfaces (RIS) is a high-dimensional combinatorial challenge. Current quantum algorithms often simplify this problem by ignoring physical constraints like mutual coupling, which significantly degrades…
The quantum approximate optimization algorithm (QAOA) is a leading variational approach to combinatorial optimization, but its practical performance depends strongly on objective design, parameter search, and shot allocation. We present a…
Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical…
In decision-making problems, the outcome of an intervention often depends on the causal relationships between system components and is highly costly to evaluate. In such settings, causal Bayesian optimization (CBO) can exploit the causal…
Quantum algorithms for binary optimization problems have been the subject of extensive study. However, the application of quantum algorithms to integer optimization problems remains comparatively unexplored. In this paper, we study the…
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational algorithm for solving combinatorial optimization problems on near-term devices. However, as the number of layers in a QAOA circuit increases, which is…
Photonic quantum computers, programmed within the framework of the measurement-based quantum computing (MBQC), currently concur with gate-based platforms in the race towards useful quantum advantage, and some algorithms emerged as main…