GRADIVA REVIEW JOURNAL ISSN NO : 0363-8057

NETWORK CONNECTION ROUTING OPTIMIZATION USING QUANTUM

ANNEALING ON A D-WAVE ANNEALER
Raju R1, Meena L2, Raja Rajeshwari S3, Shahana S4
1. Head of the Department, Information Technology, Sri Manakula Vinayagar Engineering College
2. Student, Sri Manakula Vinayagar Engineering College
3. Student, Sri Manakula Vinayagar Engineering College
4. Student, Sri Manakula Vinayagar Engineering College
Abstract- Quantum computing is a type of Problems (NP complete problems) which both are
computation that uses quantum mechanics part of the NP problem space.
phenomena such as superposition, interference, and
In most cases, when network operators or service
entanglement by using Quantum computers which
providers design and control their networks in real-
are devices that perform quantum computations on
world settings, first formulate an optimization
complex problems. Quantum Annealing which is a
problem corresponding to the desired
Heuristic Optimization technique is generally used to
communication network with the required
solve combinatorial optimization problems using
parameters and then solve the problem using a
Quantum fluctuation. In the existing system, solving
computer. These problems are mainly integer
problems based on route optimization involves many
optimization problems whose complexities require
hidden costs. These include costs per data transfer.
high computational resources. To solve these
In a country where the network has no servers, the
problems on classic computers, the GNU linear
data on websites may have to travel further. That will
programming kit (GLPK) package can be used. This
only reduce the performance of the website and
kit is intended to solve linear programming (LP),
increases latency, it leads to downtime. The
integer LP, and mixed-integer LP programming.
proposed work focuses on the route optimization in
Since the main result of the decision-making logic of
a network by reducing the number of nodes in order
a routing process is the recommended path to be
to provide an optimal path from source to destination
followed, an integer variable may be assigned to each
by using Quantum Annealer on a D-wave System. It
connection between each connected node. If the
focuses on solving the problems faster than classical
variable takes the value of 1, which means the path
computers. The main aim is to provide an optimal
is taken. In other cases, the variable will be 0 if that
route from source to destination which results in fast,
way is not optimal to reach the desired objective.
reliable transmission and reduces the number of hops
Primary objectives could involve minimizing battery
in the network using Quadratic Unconstrainted
costs for remote nodes, maximizing the throughput
Binary Optimization (QUBO) by formulating and
for each involved node, or minimizing the number of
configuring the equation.
jumps (which have advantageous impacts on
KEYWORDS: Quantum Computing, Optimization, latency). When the number of nodes increases, the
Annealers, Combinatorial problems, QUBO model. LP problem can become so big that classic
computers struggle to find the optimal route. This
Introduction- Quantum computing is a type of
happens because the number of combinations
computation that uses quantum mechanics
between nodes is so significant that the variable
phenomena such as superposition, interference, and
numbers scale rapidly, meaning that high
entanglement. Quantum computers are devices that
computational resources are needed to land on a
perform quantum computations. The field of
solution. Hence, Quantum computers can be used to
quantum computing could bring advantages in
find the optimal path using Optimization techniques
almost all branches of research and science.
in Quantum such as Quantum Annealer[1].
Whenever there are complex problems to calculate,
quantum computers are promising to bring certain In Quantum, Optimization is the process of finding
advantages. In modern complexity theory, there are the best solution to a problem from a set of possible
two major groups of problems, Polynomial Time options, given its desired outcome and constraints.
Complex Problems (P problems) and Non- There are two categories of Optimization techniques
Deterministic Complete Polynomial Time Complex such as Heuristic and Non-Heuristic Optimization, in
1

VOLUME 9 ISSUE 4 2023 PAGE NO: 1398

GRADIVA REVIEW JOURNAL ISSN NO : 0363-8057

NETWORK CONNECTION ROUTING OPTIMIZATION USING QUANTUM

ANNEALING ON A D-WAVE ANNEALER
which Quantum Annealing is a Heuristic Quantum physicists, QUBO can be seen as a computer science
Optimization which is generally used to solve inspired model, both representing the same state.
combinatorial optimization problems such as
H = ∑ [i,j,u,v] A[i,u,j,v] x[i,u] x[j,v] + ∑[i,u] (1 - ∑
machine learning, portfolio optimization and route
[j,v] x[i,u])^2 + ∑ [i,u] (1 -x[i,u])^2 ----- (1)
optimization using Quantum fluctuation [5].
Quantum annealing is a Heuristic Quantum
Optimization which is generally used to solve The Ising ’-1’, ’+1’ represent the down, up state of
combinatorial optimization problems such as the qubit whereas the ’0’ and ’1’ of the QUBO are
machine learning, portfolio optimization and route representing the binary TRUE and FALSE.
optimization using Quantum fluctuation[3]. A
combinatorial problem consists in, given a finite QUBO and Ising models can be translated into each
collection of objects and a set of constraints, finding other by applying a simple variable substitution:
an object of the collection that satisfies all si = 2xi – 1 -----(2)
constraints. It can be seen as a metaheuristic for
finding the global minimum of a given objective
function using the effects of quantum fluctuations. II LITERATURE SURVEY
It is mainly used for problems where the search space
is discrete like in combinatorial optimization, with Sl. Title Author Year Journ Explan
many local minima. Figure 1 shows a difference No al ation
between quantum annealing and simulated 1 Routing Zaher 2019 Sprin Describ
annealing[9]. While simulated annealing is using in AI ger es the
WSN Aghbari, necessit
thermal effects to converge to a low energy state but
using Ahmed ies of
therefore needs to jump over higher energy barriers, Optimiz M.Khed using
the effect of quantum tunnelling, which implies ation r, Walid Optimiz
quantum fluctuation, allows to potentially surpass Techniq Osamy ation
this higher barrier directly and thus reach the ues. techniq
minimum faster and more efficient. ues in
WSN.

2 A Study Ritesh 2022 IJERT Provide

to Dhanare s an
enhance , approac
the Kapil h in
route Kumar, IOV
Optimiz Sunita which is
ation for Varma more
the efficient
Internet for large
of scale
Vehicle. vehicula
r
Figure 1 Quantum Tunnelling and Simulated Annealing Networ
k.
To solve problems with the D-Wave quantum 3 .A Iago 2019 IFAC Describ
annealer one can either describe the problem space Scenario A.Carva es the
as an Ising spin model or as a Quadratic Based lho, Robust
Heuristi F.Noron Optimiz
Unconstrained Binary Optimization Problem c for ha, ation
(QUBO)[8]. While the Ising model comes from the Robust Christop Techniq
he ues for
2

VOLUME 9 ISSUE 4 2023 PAGE NO: 1399

GRADIVA REVIEW JOURNAL ISSN NO : 0363-8057

NETWORK CONNECTION ROUTING OPTIMIZATION USING QUANTUM

ANNEALING ON A D-WAVE ANNEALER
Shortest Duhame reliable D-Wave Christop quantu
Path l network 2X h Koch m
Tree s adiabatic comput
Problem quantum er.
4 An Rajendr IJPA Describ compute
Optimiz an.P, 2018 M es r.
ation P.Pandi working 10 Oracle Ran Raz 2019 IFAC Provide
Path an, in the separatio and s
problem K.Banu field of n of Avishay informa
on a Priya network BQP and Tal tion
network optimiz pH. about
ation. the
5 Routing Suchitha IJERT Transfer Oracle
Optimiz .S 2018 ring of separati
ation in Dr.B.G. data in on.
Network Prashant real
s hi time
applicat III RELATED WORK
ions To facilitate the development of Quantum annealing,
6 Network N.N.Sri Resea Provide some pioneering studies have been done for years.
Optimiz nithi, 2018 rch solution To name a few, Stuart Harwood, Claudio Gambella,
ations in Gate s for
S.M.Dili routing, and Dimitar Trenev proposed work on the
the
Internet p energy determination of vehicle routes fulfilling
of Kumar, conserv connectivity, time, and operational constraints is a
things. K.R.Ve ation, well-studied combinatorial optimization problem.
nugopal congesti The NP-hard complexity of vehicle routing problems
on, etc.
has fostered the adoption of tailored exact
7 Efficient Karthik Sprin Provide
quantum Srinivas 2018 ger s a approaches, matheuristics, and metaheuristics on
algorith an et al. efficient classical computing devices. The evolution of
m for quantu quantum computing hardware and the recent
solving m advances of quantum algorithms (i.e., VQE, QAOA,
travellin algorith and ADMM) for mathematical programming make
g m for
decision-making for routing problems an avenue of
salesma solving
n travellin research worthwhile to be explored on quantum
problem: g devices. In the proposed work several mathematical
An salesma formulations for inventory routing cast as vehicle
IBM n routing with time windows and comment on their
quantum problem strengths and weaknesses. The optimization models
experien .
ce
are compared from a quantum computing
8 Bloch Chu- 2019 IJERT Describ perspective, specifically with metrics to evaluate the
sphere Ryang es about difficulty in solving the underlying quadratic
model Wie the unconstrained binary optimization problems.
for bloch Finally, the solutions obtained on simulated quantum
twoqubit sphere devices demonstrate the relative benefits of different
pure model
states in pure algorithms and their robustness when put into
states. practice.
9 Multiple Immanu 2020 Sprin Describ
query el ger es about
optimiza Trumme the D- For the former category, Helen Urgelles et al.
tion on r and wave
proposed work on the Optimization problems and are
3

VOLUME 9 ISSUE 4 2023 PAGE NO: 1400

GRADIVA REVIEW JOURNAL
NETWORK CONNECTION ROUTING OPTIMIZATION USING
ANNEALING ON A D-WAVE ANNEALER
solved using QAOA where it produces results in fast,
powerful algorithms for quantum computers. Here,
QAOA has been used to solve some routing
problems applicable to the next generation of
wireless communication systems. Since 6G will
include the massive interconnections between
multiple nodes, optimal routing will have a large
importance in resource optimization. This paper has
shown that it is already feasible to solve routing
problems with QAOA. The first example introduced
the entire procedure followed by solving the
singletarget routing problem; the second case
involved a higher number of nodes and multi-
objectives to test QAOA and provide conclusions.
Moreover, as better devices are available, fewer
iterations of the algorithm will be needed. Routing
problems have additional difficulty since integer
programming is harder to solve than linear
programming, but QAOA still managed to find
optimal routes for the problems proposed. These
examples were small demos of what a bigger
problem would look like, but the actual quantum
computers can only solve limited-size problems. The
scalability of the problems solved using QAOA rely
on the new quantum hardware available. A higher
number of qubits will allow bigger problem
resolutions, and soon a quantum computer could
reach the size where it outperforms classical
computations in terms of solving time. The higher
quantum volume will enhance accuracy and, as a
result, will decrease the number of iterations of
QAOA needed to solve the problem. Higher CLOPS
will speed up any process in the quantum computer
and, as a result, will enable real-time calculations.
The results were obtained from the lexicographic
method to find the Pareto point in the multi-objective
problem. Another method, such as goal
programming, could also be used in this framework.
For the latter category, Esther Villar-Rodriguez,
Eneko Osaba, and Izaskun Oregi aimed to provide
some insights on the behaviour of the D’WAVE
quantum annealer when solving the same problem
adopting different Hamiltonian configurations. To
do that, a comprehensive experimentation was
performed using two different QUBOs, and focusing
4
VOLUME 9 ISSUE 4 2023
ISSN NO : 0363-8057
QUANTUM
attention on a single TSP instance composed of 7
nodes. For this instance, the existing work examined
the sensitive of tuning parameters such as the
penalties of the problem, and the chain strength of
the QC device. And also performed a further study
with the goal of analyzing the efficiency of the
heuristically built h-QUBO in further TSP instances.
For this second experimentation, we tested the
performance of the two built QUBOs through six
different instances of the TSP. Obtained results have
led to conclude that using a h-QUBO, the quantum
device reaches better outcomes for the problem at
hand in terms of optimality. Moreover, further tests
were conducted analysing the impact of the fine-
tuning of additional parameters such as the number
of reads or the time of annealing.
III COMBINATORIAL OPTIMIZATION
Combinatorial optimization can be defined as the
process of searching for maxima (or minima) of an
objective function whose domain is a discrete but
large configuration space (as opposed to an N-
dimensional continuous space)[9].
Therefore, two of the arguably most prominent
questions in Combinatorial Optimization are:
• How quickly can one find a single (or all)
optimal solution(s) of a given problem?
• When dealing with a problem where, due to
complexity-theoretic reasons, it is unlikely that
an optimal solution can be found efficiently:
What is the best solution that an efficient
algorithm can guarantee?
3.1 The Traveling Salesman Problem
One famous problem is for example the Traveling
Salesman Problem (TSP). The problem can be
described as follows: "Given a list of cities and the
distances between each pair of cities, what is the
shortest possible route that visits each city and
returns to the origin city?" It is an NP-hard problem
in combinatorial optimization, important in
operations research and theoretical computer
science[7].
The problem was first formulated in 1930 and is one
of the most intensive studied problems in
PAGE NO: 1401
GRADIVA REVIEW JOURNAL ISSN NO : 0363-8057

NETWORK CONNECTION ROUTING OPTIMIZATION USING QUANTUM

ANNEALING ON A D-WAVE ANNEALER
optimization (see for example [Srinivasan et al. direction of reformulating these two into each other.
2018]). It is used as a benchmark for many CSP requires that all of a problem’s variables be
optimization methods. Even though the problem is assigned values, out of a finite domain, that result in
computationally difficult, many heuristics and exact the satisfying of all constraints. Map coloring is a
algorithms are known, so that some instances with famous example of a CSP, which is also one of the
tens of thousands of cities can be solved completely major examples in the D-Wave documentation, for
and even problems with millions of cities can be solving a problem with the quantum annealer
approximated. [Murphy 1994]. The map-coloring CSP is to assign
a color to each region of a map such that any two
3.2 Satisfiability Problem
regions sharing a border have different colors.
Another important problem class is the so-called
boolean satisfiability (SAT). It is the problem of
determining if there exists an interpretation that 3.4 Formulating Problems for a Quantum
satisfies a given boolean formula. In other words, it Annealer
asks whether the variables of a given boolean
In order to have a problem that can be solved with
formula can be consistently replaced by the values
the D-Wave Systems n.d. quantum annealer, some
TRUE or FALSE in such a way that the formula
reformulations of the problem, and additional steps
evaluates to TRUE. If this is the case, the formula is
are generally needed. The first step is to reformulate
called satisfiable.
the problem, for example, a CSP, as a QUBO or Ising
SAT is the first problem that was proven to be NP- model (objective function). The D-Wave Systems
complete. This means that all problems in the n.d. As in Figure 2 Quantum Processing Unit (QPU)
complexity class NP, which includes a wide range of is a lattice of interconnected qubits[9]. While some
natural decision problems, are at most as difficult to qubits connect to others via so-called couplers, the
solve as SAT[8]. There is no known algorithm that D-Wave Systems n.d. QPU is not fully connected.
efficiently solves each SAT problem, and it is There are different topologies implemented in
generally believed that no such algorithm exists, yet different generations of the quantum annealer. The
this belief has not been proven mathematically and one that is used and explained here is called the
resolving the question of whether SAT has a chimera graph.
polynomial-time algorithm is equivalent to the P
versus NP problem, which is a famous open problem
in the theory of computing.
Nevertheless, heuristic SAT-algorithms are able to
solve problem instances involving tens of thousands
of variables and formulas consisting of millions of
symbols, which is sufficient for many practical SAT
problems in, for example, artificial intelligence,
circuit design, and automatic theorem proving but
with the drawback that heuristic approaches are Figure 2. A unit cell of a chimera graph QPU
nondeterministic and thus, in general, very time-
The graph in Figure 4 shows a unit cell of the
consuming.
chimera graph topology used in the QPU of the
3.3 Constraint Satisfaction Problem quantum annealer. In the graph, the nodes are
numbered from one to seven which represents the
Another very closely related class of problems is the
qubits. The edges in between represent physically
Constraint Satisfaction Problem (CSP). There are
coupled qubits. The layout of the DWave Systems
many SAT-problems that can be stated as CSP and
n.d. QPU is critical to translating a QUBO objective
vice versa and a lot of research is done in that
5

VOLUME 9 ISSUE 4 2023 PAGE NO: 1402

GRADIVA REVIEW JOURNAL
NETWORK CONNECTION ROUTING OPTIMIZATION USING
ANNEALING ON A D-WAVE ANNEALER
function into a format that a D-Wave system can
solve.
IV SOLVING PROBLEMS USING
QUANTUM ANNEALER
4.1 Top-Down Approach for Solving Problems
In order for one to solve problems with the D-Wave
Systems n.d. quantum annealer there are several
steps that have to be done, to get a well-defined
solution for a certain problem. In the official D-Wave
Systems n.d. documentation, one can find the
following procedure as a suggested top-down
approach for solving problems with the quantum
annealer[7].
1. Defining a problem
concretely/mathematically, for example, as a
constraint satisfaction problem or a graph
problem.
2. Reformulating the problem to use
binary variables, for example, or convert a
nonquadratic (high-order) polynomial to a
QUBO.
3. Creating a Binary Quadratic Model
(BQM) (the D-Wave Systems n.d. software
representation of an objective function).
4. Minor embedding of the objective
function.
5. Configuration of the QPU by setting
certain hyper-parameters.
6. Sampling of solutions on the quantum
annealer.
7. For evaluation of the results:
Unembedding the sample of solutions
returned by the quantum annealer.
8. Post processing (for example plotting
of results or calculation of error rate).
V CONCLUSION
Quantum Computing focuses on the development
of technology-based on principles of Quantum
theory. It uses unique behaviour of quantum
physics to solve problems that are too complex for
VOLUME 9 ISSUE 4 2023
ISSN NO : 0363-8057
QUANTUM
classical computers. The proposed work focuses
on the route optimization in a network by reducing
the number of nodes in order to provide an optimal
path from source to destination. It is solved faster
than the classical computers using Quantum
annealing which is generally used to solve
combinatorial optimization problems such as
machine learning, portfolio optimization and route
optimization using Quantum fluctuation. Route
Optimization in the network using Quantum
Annealing on a D-wave system results in fast,
reliable and reduces the number of hops in the
network using Quadratic Unconstrainted Binary
Optimization (QUBO) formulating and
configuring the equation[9]. Experimental result of
the proposed work shows that, it will take about 8
mins to find an optimal path in normal PCs.
Comparatively it will take micro seconds in Super
computers.
VI REFERENCES
[1] Julian Hatzky “Solving Combinatorial
optimization problems on a D-Wave
Quantum Annealer and Development of
higher level hardware abstraction layer”.
[2] Daniel vert, Renaud Sirdey and Stephane
Louise “Benchmarking Quantum Annealing
Against Hard instances of the Bipartite
Matching problem”.
[3] Zaher AI Aghbari, Ahmed M.Khedr and
Walid Osamy, “Routing in Wireless Sensors
Networks using Optimization Techniques: A
Survey ”.
[4] Iago A.Carvalho, Thiago F.Noronha and
Christophe Duhamel, “A Scenario Based
Heuristic for the Robust Shortest Path Tree
Problem”.
[5] D-Wave Systems. D-Wave Quantum
Annealer. url: https://www.dwavesys.
com/quantum-computing.
[6] Suchitha S and Dr. B.G. Prashanthi “Routing
Optimization in Networks”.
[7] Yaser Ali Enaya, Kalyanmoy Deb “Network
Path Optimization Under Dynamic
Conditions”.
[8] P. Rajendran, P.Pandian and K.Banu Priya
“An optimization Path problem on a
Network”.
PAGE NO: 1403
GRADIVA REVIEW JOURNAL ISSN NO : 0363-8057

NETWORK CONNECTION ROUTING OPTIMIZATION USING QUANTUM

ANNEALING ON A D-WAVE ANNEALER
[9] D-Wave Quantum Annealer Chimera
Architecture.url:https://docs.dwavesys.com/
docs/latest/c_gs_4.html.
[10] Ritesh Dhanare, Kapil Kumar
Nagwanshi and Sunita Varma “A Study to
enhance the Route Optimization Algorithm
for the Internet of Vehicle”.
[11] N.N.Srinidhi, S.M.Dilip Kumar and
K.R.Venugopal “Network Optimizations in
the Internet of Things ”.
[12] Immanuel Trummer and Christoph
Koch. “Multiple query optimization on the
DWave 2X adiabatic quantum computer.”
[13] Mark Lewis and Fred Glover.
“Quadratic unconstrained binary
optimization problem preprocessing: Theory
and empirical analysis.” P. A.M. Dirac. “A
new notation for quantum mechanics.”
[14] Tadashi Kadowaki and Hidetoshi
Nishimori. “Quantum annealing in the
transverse Ising model.”
[15] R. C. Murphy “D-Wave Map
Coloring Problem.”
[16] Karthik Srinivasan et al. “Efficient
quantum algorithm for solving travelling
salesman problem: An IBM quantum
experience.”

VOLUME 9 ISSUE 4 2023 PAGE NO: 1404