Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology

ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

Quantum-Accelerated Flight Selection: Probing

Grover's Algorithm and Quantum Device Efficiency
Jayesh Hire1 Vaidehi Gawande2 Sagar Dhande3
Quantum Computing Developer Head of Quantum Computing Founder
TrevasQ Private Ltd Creed & Bear Network LLC TrevasQ Private Ltd
Pune, India Dubai, UAE Pune, India

Abstract:- Current flight search platforms primarily considerably increased the speed of matrix inversion in many
consider four essential factors when planning a trip: machine learning techniques. Another notable example is
departure/arrival dates, as well as the origin and Shor's factoring algorithm, which has demonstrated the ability
destination locations. However, when additional to factor large numbers exponentially faster than the best
parameters are added to this search, the problem shifts conventional methods [5]. This development is crucial for
from a simple to a complex search, as the engine must sift security because Rivest-Shamir-Adleman (RSA) encryption is
through a massive dataset of flights, including widely used and relies on the difficulty of factoring large
information on airlines, flight routes, fees, and more. To numbers [6].
address this challenge and improve flight search
efficiency amidst data-intensive and resource-demanding The process of selecting an optimal flight from a vast
environments, this paper proposes the use of Grover's data-set is often a time-consuming and daunting task,
search algorithm. This algorithm is demonstrated as the compounded by a myriad of considerations such as departure
optimal solution for searches with increased constraints. and arrival dates, ticket prices, preferred airlines, and the
The paper highlights the practical application of Grover's convenience of halts during the journey. In an era marked by
search algorithm across three datasets of assorted sizes, rapid technological advancements, quantum computing has
as well as various quantum hardware and simulators emerged as a transformative force offering the potential for
available in the NISQ era. Furthermore, this paper exponential acceleration in solving complex problems.
provides an in-depth understanding of the complexity of Specifically, Grover's search algorithm, conceived by Lov
quantum circuit design, including the key phases of state Grover in 1996 [7], promises to revolutionize the process of
encoding and amplitude amplification. The effectiveness sifting through extensive data-sets. This algorithm is uniquely
of these approaches is evaluated through analysis of equipped to search an unsorted database in quadratically
execution times and quantum measurement results. The fewer iterations than the most efficient classical algorithms.
aim is to showcase the potential of quantum computing in
revolutionizing real-world search tasks, particularly in This study focuses on obtaining flights that match
the realm of flight selection. specific criteria from a large dataset, improving the customer
experience, saving processing time, server resources, and cost;
Keywords:- Quantum Computing, Quantum Search, and enabling travelers to quickly identify flights that precisely
Quantum Algorithm, Grovers Algorithm, Quantum align with their personalized criteria.
Application.
It's important to recognize that Grover's search is not just
I. INTRODUCTION a hypothetical concept, but a tangible technology that has the
potential to revolutionize the approach to complex search
As compared to traditional techniques, quantum problems.
computing has been shown to considerably speed up
computations, making it a rapidly developing subject [1]. In the field of quantum computing, the knowledge
This acceleration is especially important since more time- landscape is rapidly evolving, driven by the groundbreaking
effective data processing methods are required as data work of researchers worldwide. Quantum computing has the
volume continues to grow quickly, frequently exceeding the potential to disrupt various industries by resolving challenges
Petabyte scale [2]. As a result, there is a rising desire among that were previously considered intractable. Grover's
computer scientist to apply quantum algorithms on a larger algorithm is particularly noteworthy for its ability to
scale [3]. accelerate search tasks, an essential function in an
increasingly data-driven world.
The matrix inversion method Harrow-Hassidim-Lloyd
(HHL) is a notable example of a quantum algorithm in the
field of machine learning [4]. By using logN quantum bits, or
qubits, to represent N-bit classical data, the HHL technique
can exponentially speed up matrix inversion when compared
to classical solutions [4]. The use of this innovation has

IJISRT24AUG998 www.ijisrt.com 1255

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

The significance of this work lies in its pursuit of  Interference:

pragmatic applications of quantum computing in everyday The wave-like characteristics of quantum states give rise
life, particularly in the travel sector. As a pioneering effort, to quantum interference, which enables the constructive or
this research aims to shed light on how Grover's algorithm can destructive combination of probability amplitudes. This
be harnessed to address the intricate problem of flight property plays a crucial role in manipulating probabilities
selection by introducing efficiency, speed, and precision into within quantum algorithms, providing computational benefits
the process. compared to classical approaches.

In the upcoming sections, the intricacies of Grover's For a comprehensive understanding of quantum
algorithm, the methodology of encoding flight data, the computing, consider referring to the book titled "Quantum
principles of amplitude amplification, and the nuances of computation and quantum information" [9].
quantum circuit design will be explored. Through tangible
examples and results, the ability of this quantum approach to  Grover's Algorithm
expedite and streamline the process of selecting flights that Grover's algorithm, proposed by Lov Grover in 1996, is
cater to the traveler's unique preferences will be showcased. a quantum algorithm designed to excel at unstructured search
Ultimately, this research not only underscores the potential of problems [7]. Locating a specific item in a database without
quantum computing but also highlights its transformative any built-in structure or organization is known as unstructured
impact on decision-making in an increasingly complex world. search. Grover's algorithm stands out by its ability to search a
database of N items in only O(√𝑁) iterations, which provides
II. BACKGROUND a quadratic speedup compared to classical algorithms, which
typically require O(N) iterations [10].
This section aims to provide readers with a concise
background to familiarize themselves with key concepts. The The problem is to find the index of the target flight in a
discussion begins with a succinct introduction to quantum list with N = 2n elements (flights), where N is the list size and
computing, followed by a focused examination of Grover's n are the number of qubits.
algorithm. Finally, the pivotal role of quantum simulators,
specifically employed in this paper, in the practical execution The key components of Grover's algorithm include:
of the quantum algorithm is introduced.
 Oracle:
 Quantum Computing In Grover's algorithm, the target item to be found is
Quantum computing offers a revolutionary change in the represented by a "marked" state. The oracle's role is to mark
field of computation by utilizing quantum physics unusual or identify this state within the superposition of states created
behavior. It's quite distinct from traditional computing, owing by the quantum algorithm. It does so through a series of
to the fundamental unit of information known as a quantum quantum gates that conditionally modify the quantum state to
bit or qubit [8]. In comparison to classical bits, which can single out the marked item.
only be in a 0 or 1 state, qubits can exist in a superposition of
states. This implies that a qubit can at the same time represent  Amplitude Amplification:
0 and 1, allowing it to carry out many computations in After marking the target state, Grover's algorithm applies
parallel. The real capability of Quantum computing appears in amplitude amplification, a process that boosts the probability
quantum entanglement phenomena, where qubits show of measuring the marked state while reducing the probability
correlation with each other unlike classical bits. of measuring other states. This amplification phase makes
Grover's algorithm remarkably efficient.
Key principles of quantum computing include:
 Measurement:
 Superposition: The final step involves measuring the quantum state to
Qubits can exist in a linear combination of states, which determine the marked item's location. The algorithm is
enables computation in parallel. A 3-qubit quantum register, executed repeatedly to increase the likelihood of getting the
for example, can correspond to and manage all eight possible right answer.
3-bit binary strings at the same time.
The Grover algorithm's schematic circuit is displayed in
 Entanglement: 𝜋
Fig. 1. Approximately 4 √𝑁 Oracle and Amplitude
Quantum entanglement appears when two or more
qubits become paired in such a way that the state of one can Amplification iterations later, the target element is expected
not be defined independently of the state of the others. This to be found with a high probability [11].
feature allows qubits to work together coherently, opening up
new computational possibilities.

IJISRT24AUG998 www.ijisrt.com 1256

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

Fig 1 Schematic Circuit for the Grover's Algorithm

Grover's algorithm showcases the quantum advantage III. MOTIVATION

by efficiently solving unstructured search problems, making
it a powerful tool for optimization and search tasks. Its The motivation for applying Grover's algorithm to flight
quadratic speedup over classical search algorithms has data search stems from the inherent inefficiency of classical
applications in various fields, including cryptography, search methods, especially when dealing with extensive
database search, and artificial intelligence [16] [9]. datasets. Conventional approaches usually require individuals
to manually search through many flight choices to locate the
 Quantum Computing Simulators most appropriate one that aligns with their preferences and
The quantum circuit has been executed on five common requirements. This manual process can be time-consuming
simulators, each offering unique features and capabilities, as and impractical, particularly when dealing with extensive
shown in Fig.6. These simulators are briefly described below: datasets.

 Qiskit: Quantum computing, on the other hand, offers a

Qiskit is a quantum computing framework created by promising solution to expedite this laborious search process.
IBM that is open source. It provides an intuitive interface, Grover's algorithm, in particular, has the potential to
comprehensive functionality, and supports both simulation as significantly accelerate the task of finding flights that meet
well as execution on actual quantum hardware. A QASM specific criteria. Its unique quantum properties allow for
simulator within Qiskit was utilized in this study for parallel processing and more efficient searching, offering a
prototyping and testing the algorithm [12]. faster and more streamlined approach to flight selection.

 Cirq: This research aims to explore the practicality of

Cirq is another open-source quantum computing implementing Grover's algorithm for real-world applications,
framework focusing on near-term algorithms for quantum such as flight data search, and assess its ability to provide a
computation. It facilitates the creation, manipulation, and faster and more efficient alternative to classical search
optimization of quantum circuits. The built-in simulator of methods.
Cirq was employed in our experiments to validate the design
of the quantum circuit [13]. IV. QUANTUM CIRCUIT DESIGN

 Pennylane:  Data-Set Loading

Pennylane is an open-source library that combines Initiating Grover's search algorithm for flight
classical machine learning with aspects of Quantum information necessitates loading datasets categorized as small
Computing allowing the construction of training neural (15Q), medium (17Q), and large (19Q). The small dataset is
networks while integrating with popular frameworks. Two characterized by its dimensions of 32,768×6 data points, the
CPU-based simulating kernels provided by Pennylane, medium dataset of 131,072 ×6, and the large dataset of
namely default.qubit and lightning.qubit, were used to 524,288 ×6.
simulate the algorithmic setup [14].
Table 1 presents a small sample from the 15Q dataset,
 ProjectQ: giving an overview of its characteristics and organization.
ProjectQ stands out due to its compilation capabilities
alongside simulations, it has support running over numerous
varied service provider devices such as those offered through
AWS Bracket Azure Quantum or else also includes ion q
service amongst others from IBM itself. For conducting
experiments, the MainEngine backend located within the
ProjectQ simulators suite was utilized [15].

IJISRT24AUG998 www.ijisrt.com 1257

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

Table 1 Example Dataset

It's important to note that the datasets provided for this Following the conditional flipping, a quantum operation
research are synthetic. They have been generated to known as a controlled-MCT (Multicontrol Toffoli) gate is
demonstrate the functionality and efficiency of Grover's deployed. This gate amplifies the probability of measuring the
search algorithm in a controlled environment. While the data desired state, specifically the state that corresponds to the
accurately represents the structure of flight information, it target flight [9]. This controlled amplification is indispensable
does not correspond to real-world flight data. in the subsequent stages of the quantum search algorithm.

 Oracle To ensure the quantum state returns to its original form

The oracle (sometimes known as the 'black box') in after amplification, a meticulous process of restoration
Grover's search algorithm is a fundamental component that is unfolds. Conditional X gates are applied once again, precisely
responsible for encoding the information of the target reversing the prior adjustments and returning the qubits to
element(flight) into the quantum state. In our implementation their initial states. This meticulous orchestration of quantum
it's work by selecting the criteria from the user, such as operations forms a coherent and efficient pathway in the
departure date, arrival date, price, airline, and halt status, to pursuit of identifying the target flight within the quantum
define the parameters of the search and then transform it into computing framework.
a binary string representation.
For each flight in the dataset, the complete process of
In the process of identifying a particular flight within the encoding the flight data, flipping qubits according on criteria,
quantum computing framework, a series of critical steps are amplifying the target state, and restoring the quantum state is
executed to select and manipulate the quantum state. An repeated. As a result, the quantum state is a superposition of
initial step involves the user specifying their preferences for a all the flights, with highlighted states signifying flights that
flight, including departure date, arrival date, price, airline, and meet the user's criteria. This prepared state is then used in the
halt status. Subsequently, the oracle identifies the optimal sub-sequent step of Grover’s algorithm called amplitude
match for these criteria within the dataset and assigns it as the amplification, which increases the likelihood of measuring the
"target flight." target flight when the quantum circuit is executed.

The pivotal index of the target flight in the dataset is Fig. 2 showcases the oracle circuit for a specific example
then calculated and translated into binary representation. In state within a 4-qubit system, namely {"0101"}. This example
this representation, each binary digit corresponds to whether state has been chosen to demonstrate the working principle of
the related condition aligns with the criteria for the target the oracle as defined above.
flight. For instance, an index of 7 corresponds to the binary
'111,' signifying the fulfillment of all criteria. Remember here, indexing is from left to right, which
means q0, q1, q2, and q3 correspond to the qubits from the
The quantum state comprises qubits, which undergo most significant bit (left) to the least significant bit (right).
manipulation according to this binary representation. Each
digit in the binary string determines whether an X gate, a
quantum gate that flips qubits, is applied to the corresponding
qubit. This strategic flipping of qubits aligns them with the
specified criteria. A flipped qubit corresponds to an
unfulfilled condition, while an unflipped qubit signifies the
fulfillment of that condition. (seen in fig. 2)

IJISRT24AUG998 www.ijisrt.com 1258

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

Fig 2 Oracle Circuit

 Amplitude Amplification  Multicontrol Toffoli Gate (MCT):

Amplitude amplification is a crucial step in Grover's The heart of the amplification process is the Multicontrol
algorithm, designed to enhance the probability of measuring the Toffoli gate (MCT). This gate is applied to the qubits in a
desired state while diminishing the likelihood of other states. It controlled manner. The target qubit is q[n-1], and the control
involves a sequence of quantum gates meticulously arranged to qubits are all the qubits except the last one, q[:-1]. The mode
manipulate the quantum state in a manner that accentuates the 'noancilla' signifies that no additional ancillary qubits are used
presence of the target state. in this operation. The MCT gate performs a Toffoli operation
on the control and target qubits [9], effectively amplifying the
Let's break down the amplification process step by step: amplitude of the target state. This gate is a crucial part of
Grover's algorithm, ensuring that the probability of measuring
 Hadamard Gates (H-gates): the target state is maximized.
A Hadamard gate (H-gate) is applied to each qubit in the
quantum register, iterating through all n qubits. This H-gate  Hadamard Gates (H-gates) - Reversal:
creates a superposition of basis states, which is a pivotal step in After the MCT gate, Hadamard gates are applied to the
Grover's algorithm. It prepares the quantum state to explore qubits once again. This serves to reverse the superposition
multiple possibilities in parallel. created by the initial Hadamard gates. This reversal operation
ensures that only the target state has an amplified probability of
 X-Gates (NOT-gates): being measured while the amplitudes of the non-target states
Next, an X-gate (NOT-gate) is applied to each qubit. This decrease.
operation flips the state of each qubit, effectively negating the
superposition of states created by the Hadamard gates. The By applying these quantum gates in a specific sequence,
purpose of these X-gates is to isolate the target state and the amplification process systematically enhances the
manipulate it separately from the other states. probability of finding the desired state while minimizing the
likelihood of measuring other states. This is a central feature of
Grover's algorithm, allowing for a substantial speedup in search
tasks.

Fig 3 shows the Amplification Circuit for a 4-qubit system, as

per our definition of amplification

Fig 3 Amplification Circuit

 Measurement and examining the measurement outcomes, it becomes possible

After applying amplitude amplification, the quantum state to pinpoint the index of a flight that closely meets the user's
is subjected to measurements. The obtained bitstring denotes preferences.
the index of the flight that most closely aligns with the criteria
specified by the user. By repeating this process multiple times

IJISRT24AUG998 www.ijisrt.com 1259

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

V. RESULT AND DISCUSSION on Jan 1 and Aug 28 yielding results within 5.54 and 6.74
seconds, respectively. Despite a larger dataset size, the
A comprehensive analysis of the results obtained from algorithm efficiently retrieved matching flights.
implementing Grover's search algorithm on flight data of
varying sizes: small (15Q), medium (17Q), and large (19Q) is In the large (19Q) dataset, Grover's algorithm navigated
presented in this section (Table 2). The section discusses the efficiently, requiring 25.78 seconds to locate a flight departing
execution times, correlated flight details, and effectiveness of and arriving on Jan 5, operated by Air India. Similarly, finding
the algorithm, along with the performance of the algorithm on a flight departing and arriving on Aug 29, operated by Delta
different quantum simulators. Details regarding the computer Airlines, took 41.73 seconds. These results highlight the
resources used in this procedure are provided in APPENDIX algorithm's resilience and precision across a range of dataset
sizes.
Using Grover's algorithm, the small (15Q) dataset was
searched for specific flights, yielding accurate results. For Table 2 provides a detailed summary of the performance
example, a flight departing on Jan 10, priced at 394, operated of the quantum algorithm across different qubit datasets, further
by Qatar Airways, and with a halt status of 1, was in just 2.03 supporting the results discussed above. Each dataset's
seconds. Similarly, a flight on Aug 6, priced at 250, operated characteristics, search details, and corresponding execution
by Delta Airlines, and with a halt status of 1, took 1.54 seconds times are presented, offering valuable insights into the
to find. The effectiveness of Grover's algorithm continued in algorithm's efficiency and effectiveness.
the medium (17Q) dataset, with searches for flights departing

Table 2 Quantum Algorithm Performance

Fig 4 Quantum Flight Data Search.

The histogram plot visually Represents the algorithm’s A study on performance was carried out by executing the
performance within the Qiskit framework across various search circuit on different simulators, as illustrated in Fig. 5. Each line
scenarios, showcasing execution times for each query and on the graph represents a specific simulator, and markers
highlighting Grover’s algorithm efficiency in handling different highlight specific qubit counts, offering valuable insights.
flight selection criteria within the 15Q, 17Q, and 19Q datasets Notably, it was observed that the processing time for
(16Q and 18Q datasets also included) PENNYLANE (lightning.qubit) and Qiskit is quite similar

IJISRT24AUG998 www.ijisrt.com 1260

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

compared to other simulators. This discovery indicates that other simulators across all qubit Counts-with PENNYLANE
both PENNYLANE (lightning.qubit) and Qiskit demonstrate (default.qubit) registering the lengthiest time at 19 qubits.
comparable performance in terms of execution time across
varying qubit numbers. The results also provide significant Table 3 presents the data utilized to create Fig 5. For
observations; specifically, CIRQ, ProjectQ, and PENNYLANE further information about this dataset, please refer to the
(default.qubit) exhibit longer execution times compared to GitHub link provided in Appendix.

Table 3 Exection Times for Grover’s Algorithm using Different Quantum Frameworks and Datasets in Seconds

Fig 5 Execution Time vs Qubit Count across Quantum Frameworks

A brief comparison was also carried out between the factoring in noise. From these measurements, the correct
results from a simulator and those from a quantum device. In response is obtained 1016 times, with the '1111111' state
this analysis, the '7Q' flight data containing 128 elements were representing the accurate flight information.
used along with the IBM Quantum computer 'ibm_lagos' [12].
Furthermore, when running the same circuit on a quantum
The IBM Quantum Simulator runs the circuit 1020 times device, no input shows a noticeably high probability, as
to simulate state vectors on a classical computer without depicted in Fig. 7 and 8.

IJISRT24AUG998 www.ijisrt.com 1261

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

Fig 6 Results from the Simulator

 Fidelity quantum computers shows that two-qubit operators cannot

When a real quantum device is used, the quantum circuit directly act on two distant qubits because of the physical
does not yield consistent results. The results shown in Fig. 7 distance between qubits, which reduces connectivity. To
and 8 indicate clear differences between the output of the finish the operations, they require the assistance of
simulator and that of the quantum device when running the intermediary qubits. It increases the depth of the circuit and
same circuit. In an actual quantum device, the main challenge the number of gates significantly. As a result, additional noise
preventing the circuit from getting the correct answer is gets in,
unavoidable noise. Additionally, a study of noise inside IBM's

Fig 7 Results from the Ibm _Lagos and the Results become Inconsistent [17]. While Trying to Find a Particular Flight, Utilizing
Multiple Control X Gates Extensively Deepens the Circuit and Distorts the Result.

VI. SUMMARY AND CONCLUSION  Grover's search algorithm efficiently located flights that
matched user-defined criteria within the flight datasets.
In this paper, the effectiveness and adaptability of  The algorithm demonstrated consistent performance
Grover’s search algorithm in practical scenarios were assessed across different sizes of datasets (small, medium, large)
using flight data of different sizes: small (15Q), medium  Despite the increase in dataset dimensions, Grover's
(17Q), and large (19Q). The resulting discoveries and algorithm maintained its effectiveness, indicating its
perspectives can be succinctly outlined: potential to handle larger and more complex databases.

IJISRT24AUG998 www.ijisrt.com 1262

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

 The time taken for execution is found to increase in [10]. Adedoyin, A., Ambrosiano, J., Anisimov, P., et al.
proportion to the dataset size and is significantly impacted (2022). Quantum Algorithm Implementations for
by the construction of an oracle to identify the target item Beginners. ACM Trans. Quantum Comput., 3(4),
or data entry. Developing a highly effective oracle can be Article 18. https://doi.org/10.1145/3517340
challenging and resource-intensive in certain instances, [11]. Szabłowski, P. J., Paweł, B., Szabłowski, J., &
potentially diminishing the practical benefits obtained Szabłowski, P. J. (2021). Understanding mathematics
from the algorithm. of Grover’s algorithm. Quantum Information
Processing, 20, 191. https://doi.org/10.1007/s11128-
Additionally, this study offers important perspectives on 021-03125-w
the potential for quantum computing to revolutionize [12]. IBM, Ibm quantum experience, 2023. Available:
conventional computational procedures. The reliable capacity https: //quantum-computing.ibm.com/
of Grover's algorithm to pinpoint data points across different [13]. Google, Cirq, 2023. Available: https://quantumai.
qubit capacities highlights its practicality and effectiveness. google/cirq.
With advancements in quantum technologies, it is expected [14]. Bergholm, V., Izaac, J., Schuld, M., et al. (2022).
that further enhancements and optimizations will boost its PennyLane: Automatic differentiation of hybrid
capabilities. quantum-classical computations. PennyLaneAI.
https://github.com/PennyLaneAI/pennylane/
In conclusion, this research underscores the importance [15]. Steiger, D. S., Häner, T., & Troyer, M. (2018).
of quantum computing as a revolutionary solution for ProjectQ: An Open Source Software Framework for
addressing challenges related to data search and optimization. Quantum Computing. https://doi.org/10.22331/q-
The effective implementation of Grover’s algorithm in 2018-01-31-49
conducting searches for flight data illustrates the potency and [16]. Mandviwalla, A., Ohshiro, K., & Ji, B. (2018).
adaptability of quantum computing, which has the potential to Implementing Grover’s Algorithm on the IBM
be extended to various scenarios requiring efficient data Quantum Computers.
search and retrieval. This makes it a highly appealing choice [17]. Johnstun, S., & van Huele, J.-F. (2021).
for industries. Understanding and compensating for noise on IBM
quantum computers. American Journal of Physics,
The findings of this study encourage further exploration 89(10), 935–942. https://doi.org/10.1119/10.0006204
of quantum computing's potential, and they set the stage for
the continued evolution of quantum algorithms and their real- APPENDIX
world applications.
 Computer System :
REFERENCES The quantum circuit described in this paper was
implemented on a computational platform, the specifications
[1]. Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., of which are outlined subsequently.
Monroe, C., & O’Brien, J. L. (2010). Quantum
computers. Nature 2010 464:7285, 464(7285), 45–53.  Computer Model: Acer Aspire A515-52G
https://doi.org/10.1038/nature08812  Processor: Intel® Core™ i5-8265U CPU @1.60GHz × 8
[2]. Szalay, A. S., Gray, J., & Vandenberg, J. (n.d.).  RAM: 8 GB
Petabyte Scale Data Mining: Dream or Reality?  Operating System: Ubuntu 22.04.2 LTS
[3]. de Wolf, R. (2017). The Potential Impact of Quantum  Python Environment: Python 3.10, Qiskit 0.44.1
Computers on Society.
[4]. Harrow, A. W., Hassidim, A., & Lloyd, S. (2009). This information provides transparency regarding the
Quantum Algorithm for Linear Systems of Equations. computing resources used and can help readers understand
Physical Review Letters, 103(15), 150502. the computational context of the work. It's especially
https://doi.org/10.1103/PhysRevLett.103.150502 important when working with quantum computing, as
[5]. Shor, P. W. (2006). Polynomial-Time Algorithms for hardware and software environments can significantly impact
Prime Factorization and Discrete Logarithms on a the results and execution times of quantum algorithms.
Quantum Computer. 41(2), 303–332.
https://doi.org/10.1137/S0036144598347011  Supplementary Materials:
[6]. Rivest, R. L., Shamir, A., & Adleman, L. (1978). A For additional insights and access to the raw data used
method for obtaining digital signatures and public-key for plotting Fig. 6, refer to the GitHub repository link:
cryptosystems. Communications of the ACM, 21(2), [https://github.com/Jayesh1211/Result-analysis-]
120–126. https://doi.org/10.1145/359340.359342
[7]. Grover, L. K. (1996). A fast quantum mechanical  Additional Outputs :
algorithm for database search.
[8]. Yanofsky, N. S. (2007). AN INTRODUCTION TO  For 15 Qubits:
QUANTUM COMPUTING.
[9]. Nielsen, M. A. ., & Chuang, I. L. . (2023). Quantum  Target Departure Date: Dec 17
computation and quantum information. Cambridge  Target Arrival Date: Dec 17
University Press.

IJISRT24AUG998 www.ijisrt.com 1263

Volume 9, Issue 8, August – 2024 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165 https://doi.org/10.38124/ijisrt/IJISRT24AUG998

 Target Price: 205

 Target Airline: Qatar Airways
 Target Halt Status: 0
 Execution Time: 1.6980 seconds
 Matching Flight Found at Index: 14759
 Flight Details:

 Flight Number: F14760

 Departure Date: Dec 17
 Arrival Date: Dec 17
 Price: 205
 Airline: Qatar Airways
 Halt Status: 0

 Result: 111001011001110
 Measured Index: 14759

 For 17 Qubits:

 Target Departure Date: May 28

 Target Arrival Date: May 28
 Target Price: 209
 Target Airline: Emirates
 Target Halt Status: 0
 Execution Time: 6.4555 seconds
 Matching Flight Found at Index: 66652
 Flight Details:

 Flight Number: F66653

 Departure Date: May 28
 Arrival Date: May 28
 Price: 209
 Airline: Emirates
 Halt Status: 0

 Result: 00111010001000001
 Measured Index: 66652

 For 19 Qubits:

 Target Departure Date: Nov 5

 Target Arrival Date: Nov 5
 Target Price: 206
 Target Airline: Air India
 Target Halt Status: 0
 Execution Time: 30.9212 seconds
 Matching Flight Found at Index: 249754
 Flight Details:

 Flight Number: F249755

 Departure Date: Nov 5
 Arrival Date: Nov 5
 Price: 206
 Airline: Air India
 Halt Status: 0

 Result: 0101100111110011110
 Measured Index: 249754

IJISRT24AUG998 www.ijisrt.com 1264