• Tidak ada hasil yang ditemukan

Solving Hard optimization problem with Quantum computer

N/A
N/A
Info
Unduh - Bebas
Protected

Academic year: 2025

Membagikan "Solving Hard optimization problem with Quantum computer"

Copied!
1
0
0

Memuat.... (Lihat teks lengkap sekarang)

Unduh sekarang ( 1 Halaman )

Teks penuh

(1)

Solving Hard optimization problem with Quantum computer

Prabhas Chongstitvatana

This talk presents an example of using Quantum computer to perform a standard optimization task.

Traveling Salesman Problem is a widely used problem that represents hard problem for optimization. To use Quantum computer for this task, we devise quantum circuits using it in hybrid with traditional computer.

We propose a quantum-assisted compact genetic algorithm that uses a quantum amplitude ampli cation technique in the selection process.We apply the algorithm to the traveling salesman problem on IBM Qiskit simulator to show how one would construct the quantum circuit and how to encode the optimization problem into quantum states. We also pointed out the limitation of the current technology.

Referensi

Unduh sekarang ( PDF - 1 Halaman - 71.80 KB )

Dokumen terkait

Quantum Particle Swarm Optimization Algorithm Based on Dynamic Adaptive Search Strategy

From the figures, we can see the improved algorithm QPSO in this section, to a certain extent, overcomes the defect of the particle swarm optimization algorithm in the premature

Quantum Physics authors titles recent submissions

In the remainder of this paper, we give a detailed description of the quantum money protocol, including the bank’s algorithm for preparing the quantum banknotes and the

Quantum Physics authors titles recent submissions

Because the solution space is a-priori completely unknown, this is not a good target for quantum annealing, but other optimization methods, such as the genetic algorithm or

Optimization Algorithms in Wireless and Quantum Communications

While in the previous chapter we considered general problem of unambiguous quantum detection without restricting the number of quantum states at hand, in this chapter, we restrict

Compact Genetic Algorithm with Quantum-Assisted Feasibility Enforcement

QUANTUM COMPLEXITY ANALYSIS For our proposed quantum-assisted cGA*, the quantum complexity analysis can be divided into two parts: analyzing the number of qubits and the num- ber of

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem

The problem of finding an a priori tour of minimum expected length under the skipping strategy is defined as the Probabilistic Traveling Salesman Problem PTSP... The PTSP approach

Artificial Bee Colony Algorithm with Proposed Discrete Nearest Neighborhood Algorithm for Discrete Optimization Problems

Keywords: Optimization; artificial bee colony; traveling salesman problem; vehicle routing NOMENCLATURE i Flower number feature Pi Probability of choosing the flower i in the next

Solving software project scheduling problem using grey wolf optimization

In this paper, the grey wolf optimization GWO algorithm has been used to solve the problem of software project scheduling SPSP and find effective assigning employees to tasks so that