System model. An n-length input quantum state |s (17) is fed into the U( θ) unitary structure (5) of the gate-model quantum computer. The |φ output quantum state (18) is measured via a measurement array M. The M measurement array represents a measurement in the computational basis to produce the n-length string z (15) from the n qubit length output state |φ (18) to evaluate the objective function value C(z) (14).

System model. An n-length input quantum state |s (17) is fed into the U( θ) unitary structure (5) of the gate-model quantum computer. The |φ output quantum state (18) is measured via a measurement array M. The M measurement array represents a measurement in the computational basis to produce the n-length string z (15) from the n qubit length output state |φ (18) to evaluate the objective function value C(z) (14).

Source publication
Article
Full-text available
Gate-model quantum computer architectures represent an implementable model used to realize quantum computations. The mathematical description of the dynamical attributes of adaptive problem solving and iterative objective function evaluation in a gate-model quantum computer is currently a challenge. Here, a mathematical model of adaptive problem so...

Context in source publication

Context 1
... system model at p = 1 is depicted in Figure 1. (17) is fed into the U( θ) unitary structure (5) of the gate-model quantum computer. ...

Citations

... Quantum-based routing algorithms offer a promising avenue for meeting these future challenges, enabling quicker and more efficient optimization [19]. Currently, there are two prevailing paradigms in the field of quantum computing: annealing-based quantum computers and gate-model quantum computers [20] [21]. The preceding models are distinguished by their utilization of quantum annealing, a technique that yields the lowest energy state of a specified quantum Hamiltonian, also referred to as an energy function. ...
Conference Paper
Optimizing satellite routes for multiple space debris collection and multiple on-orbit servicing can be a very complex problem due to the large number of variables and constraints that need to be taken into account. Factors such as the location and movement of the debris and servicing targets in the orbit, the capabilities of the satellite, and the constraints on the satellite's fuel and power usage all need to be considered. Additionally, the problem may be further complicated by the need to consider multiple objectives, such as minimizing fuel usage while maximizing debris collection or servicing coverage. Classical approach to solve this problem includes heuristics and metaheuristics methods like Genetic Algorithm, Particle Swarm Optimization, Ant Colony Optimization and mixed-integer programming. In the current paper, we plan to implement Quantum annealing based algorithm for optimizing satellite routes. It is a quantum computing method that can be used to optimize satellite routes. The principle behind quantum annealing is to use quantum-mechanical effects to find the global minimum of a function. In the context of satellite routing, this function would represent the cost or energy required for a satellite to travel a certain route. The satellite's routes would be represented by variables in the function, and the quantum annealer would use quantum-mechanical effects to search for the lowest-energy route, which would correspond to the optimal path for the satellite to take. We plan to use Ising model to implement quantum annealing for satellite routing. It can used to represent the cost function as a set of binary variables interacting with each other through pairwise interactions. The interactions between the variables would represent the different constraints and objectives of the routing problem, such as fuel usage and debris collection. The goal would be to find the configuration of variables that minimizes the cost function, which corresponds to the optimal satellite route. A complete mathematical model will be generated, and numerical analysis will be performed based on the presented technique.
Article
Electronic medical information is becoming increasingly popular. Electronic medical information includes sensitive and private information. The medical information must be protected from intruders during the communication with patients. During the exchange of information, blockchain technology can secure information from intruders. There are several traditional methods for protecting electronic medical information. These approaches can communicate data accurately but are vulnerable to collective and coherent attacks. These protocols also require higher communication and computation costs. This study proposes a Lightweight Quantum Blockchain-based Framework to safeguard patient medical information across multiple hospitals. This framework can withstand quantum computer attacks. Additionally, the proposed protocol requires less communication and computation costs as compared to the existing protocols.