We present a hybrid algorithm that accomplishes the classification of a
Hermitian matrix according to its signature into three classes (positive
semi-definite, negative or indefinite). The algorithm i
While the treatment of chemically relevant systems containing hundreds or
even thousands of electrons remains beyond the reach of quantum devices, the
development of quantum-classical hybrid algorithm
The future of mobility-as-a-Service (Maas)should embrace an integrated system
of ride-hailing, street-hailing and ride-sharing with optimised intelligent
vehicle routing in response to a real-time, st
Register allocation, which is a crucial phase of a good optimizing compiler,
relies on graph coloring. Hence, an efficient graph coloring algorithm is of
paramount importance. In this work we try to l
For noisy intermediate-scale quantum (NISQ) devices only a moderate number of
qubits with a limited coherence is available thus enabling only shallow
circuits and a few time evolution steps in the cur
The Boolean Satisfiability problem (SAT) is important on artificial intelligence community and the impact of its solving on complex problems. Recently, great breakthroughs have been made respectively
We present a novel hybrid algorithm for training deep neural networks that combines the state-of-the-art gradient descent (gd) method with a mixed integerlinear programming (milp) solver, outperforming gd and variants in terms of accuracy as well as resource and data efficiency for both regression and classification tasks.
Our algorithm, called gdsolver, works as follows : given a dnn as input, gdsolver invokes gd to partially train until it gets stuck in a local minima, at which point it invokes an milpsolver to exhaustively search a region of the loss landscape around the weightassignments of final layer parameters with the goal of tunnelling through and escaping the local minima.
Quantum control optimization algorithms are routinely used to generate optimal quantum gates or efficient quantum state transfers.
However, there are two main challenges in designing efficient optimization algorithms, namely overcoming the sensitivity to local optima and improving the computationalspeed.
Vertebrate retinas are highly-efficient in processing trivial visual tasks
such as detecting moving objects, yet a complex task for modern computers. The
detection of object motion is done by speciali
We propose a new hybrid algorithm that allows incorporating both user and
item side information within the standard collaborative filtering technique.
One of its key features is that it naturally exte
The consequences of disruptions in railway traffic are the primary cause of
passengers' dissatisfaction. Hence, appropriate dispatching decisions are
necessary (e.g., by assigning the order of trains)
We present the relevant results and proofs from the theory of continued fractions in detail (even in more detail than in text books) filling the gap to allow a complete comprehension of the algorithm of shor for prime factorization.
Quantitative descriptions of strongly correlated materials pose a
considerable challenge in condensed matter physics and chemistry. A promising
approach to address this problem is quantum embedding me
Quantum Annealing is a heuristic for solving optimization problems that have
seen a recent surge in usage owing to the success of D-Wave Systems. This paper
aims to find a good heuristic for solving t
We present a generalization of the binary paint shop problem (BPSP) to tackle
an automotive industry application, the multi-car paint shop (MCPS) problem.
The objective of the optimization is to minim
Machine learning techniques have led to broad adoption of a statistical model
of computing. The statistical distributions natively available on quantum
processors are a superset of those available cla
We propose a hybrid quantum-classical algorithm to solve quadratic-constrained binary optimization models for loan collection optimization.
The objective is to find a set of optimal loan collection actions that maximizes the expected net profit presenteded to the bank as well as the financial welfare in the financial network of loanees, while keeping the loan loss provision at its minimum.
Quantum simulation using time evolution in phase estimation-based quantum
algorithms can yield unbiased solutions of classically intractable models. But
long runtimes open such algorithms to decoheren
We propose a classical-quantum hybrid algorithm for machine learning on
near-term quantum processors, which we call quantum circuit learning. A quantum
circuit driven by our framework learns a given t