This paper proposes a highly efficient quantum algorithm for portfolio optimisation targeted at near-term noisy intermediate-scale computers. Recent work by Hodson et al. (2019) explored potential application of hybrid quantum-classical algorithms to the problem financial rebalancing. In particular, they deal with using Quantum Approximate Optimisation Algorithm and Alternating Operator Ansatz. this paper, we demonstrate substantially better performance newly developed Walk in finding...

Abstract The application of quantum algorithms has attracted much attention as it holds the promise solving practical problems that are intractable to classical algorithms. One such is recent development a quantum-walk-based optimization algorithm approach portfolio under modern theory framework. In this paper, we demonstrate an experimental realization alternating phase-shift and continuous-time walk unitaries underpin using optical networks single photons. analysis confirms probability...

Abstract Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms (QVAs) leverage superposition and entanglement to optimise over exponentially large solution spaces using an alternating sequence classically tunable unitaries. However, prior work has primarily addressed discrete problems. In addition, these have been designed generally under the assumption unstructured space, which constrains their speedup theoretical limits for...

This paper demonstrates the applicability of Quantum Walk-based Optimisation Algorithm (QWOA) to Capacitated Vehicle Routing Problem (CVRP). Efficient algorithms are developed for indexing and unindexing solution space implementing required alternating phase-walk unitaries, which core components QWOA. Results numerical simulation demonstrate that QWOA is capable producing convergence near-optimal solutions a randomly generated eight location CVRP. Preparation amplified quantum state in this...

We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time quantum walk (CTQW) representation and theory graph automorphism groups. This leads to heuristic designing efficient problem-specific QVAs. Using this heuristic, we develop novel algorithms unconstrained constrained optimisation. outline implementation polynomial...

In this paper, we explore the application of variational quantum algorithms designed for classical optimization to problem matched filtering in detection gravitational waves. Matched detecting wave signals requires searching through a large number template waveforms, find one which is highly correlated with segments detector data. This computationally intensive task needs be done quickly low latency searches order aid follow-up multi-messenger observations. The study consist walk-based...

Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms leverage superposition and entanglement to optimise over exponentially large solution spaces using an alternating sequence classically tunable unitaries. However, prior work has primarily addressed discrete problems. In addition, these have been designed generally under the assumption unstructured space, which constrains their speedup theoretical limits for Grover's search...

This paper demonstrates the applicability of Quantum Walk-based Optimisation Algorithm(QWOA) to Capacitated Vehicle Routing Problem (CVRP). Efficient algorithms are developedfor indexing and unindexing solution space for implementing required alternatingphase-walk unitaries, which core components QWOA. Results numerical simulationdemonstrate that QWOA is capable producing convergence near-optimal solutions arandomly generated 8 location CVRP. Preparation amplified quantum state in this...