4.7 Article

New coding scheme to compile circuits for Quantum Approximate Optimization Algorithm by genetic evolution

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Artificial Intelligence

Rapid solution of logical equivalence problems by quantum computation algorithm

Mohammed Zidan et al.

Summary: We propose a quantum computation algorithm that can solve the problem of logical equivalence verification exponentially faster than classical deterministic computation. By executing oracles of two evaluated functions, a common target qubit is obtained and interacts with an ancillary qubit, with the degree of entanglement serving as a reliable witness for logical equivalence. The quantum algorithm's steps number is inversely proportional to the square of the measured concurrence value's standard error epsilon 2, independent of the input size.

APPLIED SOFT COMPUTING (2023)

Article Mathematics, Applied

A study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm

Mario Fernandez-Pendas et al.

Summary: The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid approach that combines quantum computing and classical optimizers to find approximate solutions to hard combinatorial optimization problems. In this study, twelve different classical optimizers were tested on a quantum simulator to solve the maximum cut problem, showing significant variations in performance.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2022)

Article Computer Science, Artificial Intelligence

Applying the quantum approximate optimization algorithm to the minimum vertex cover problem

Y. J. Zhang et al.

Summary: This paper presents a quantum circuit solution scheme based on the quantum approximate optimization algorithm for the minimum vertex cover problem. By adjusting the problem Hamiltonian expectation through parametric unitary transformation, the solution probability is improved, leading to exponential acceleration.

APPLIED SOFT COMPUTING (2022)

Article Computer Science, Artificial Intelligence

Quantum circuit compilation by genetic algorithm for quantum approximate optimization algorithm applied to MaxCut problem

Lis Arufe et al.

Summary: This paper formulates the Quantum Circuit Compilation Problem (QCCP) as a scheduling problem, which is solved by a Decomposition Based Genetic Algorithm (DBGA). Experimental results show that DBGA is quite competitive with the state of the art and even outperforms the best current method.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Quantum Science & Technology

Evaluation of QAOA based on the approximation ratio of individual samples

Jason Larkin et al.

Summary: The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that solves binary-variable optimization problems. We compared its performance with classical algorithms for the Max-Cut problem and found that QAOA performs significantly better on certain graph types.

QUANTUM SCIENCE AND TECHNOLOGY (2022)

Article Engineering, Multidisciplinary

Differential evolution with modified initialization scheme using chaotic oppositional based learning strategy

Mohamad Faiz Ahmad et al.

Summary: Differential evolution (DE) is a popular optimization algorithm known for its simplicity and fast convergence rate. This study introduces a new DE variant called chaotic oppositional DE (CODE), which combines the strengths of chaotic maps and oppositional-based learning strategy to improve the quality of the initial population. The performance of CODE variants using seven different chaotic maps is evaluated, and chaotic circle oppositional DE (CCODE) is found to be the best performing variant. The optimization performance of CCODE is compared with other existing algorithms, demonstrating its superiority in terms of solution accuracy and convergence speed.

ALEXANDRIA ENGINEERING JOURNAL (2022)

Article Quantum Science & Technology

Local classical MAX-CUT algorithm outperforms p = 2 QAOA on high-girth regular graphs

Kunal Marwaha

Summary: QAOA(2) performs better than QAOA(1) on D-regular graphs of girth > 5, but there exists a classical algorithm that outperforms QAOA(2) on all graphs.

QUANTUM (2021)

Article Quantum Science & Technology

Impact of graph structures for QAOA on MaxCut

Rebekah Herrman et al.

Summary: The performance of QAOA algorithm on MaxCut problem is studied under different graph characteristics, revealing correlations with graph symmetries, odd cycles, and density. Data analysis demonstrates some factors that can predict the success of QAOA.

QUANTUM INFORMATION PROCESSING (2021)

Proceedings Paper Engineering, Electrical & Electronic

Improved Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem

Xiong Luo et al.

PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MECHATRONICS AND INTELLIGENT ROBOTICS (ICMIR-2019) (2020)

Proceedings Paper Engineering, Electrical & Electronic

Rollout based Heuristics for the Quantum Circuit Compilation Problem

Shelvin Chand et al.

2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) (2019)

Proceedings Paper Engineering, Civil

Resource Allocation in a Repetitive Project Scheduling Using Genetic Algorithm

Biju Samuel et al.

INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN MATERIALS, MECHANICAL AND CIVIL ENGINEERING (2018)

Article Quantum Science & Technology

Compiling quantum circuits to realistic hardware architectures using temporal planners

Davide Venturelli et al.

QUANTUM SCIENCE AND TECHNOLOGY (2018)

Proceedings Paper Construction & Building Technology

A genetic algorithm for optimal resource-driven project scheduling

Sofia Kaiafa et al.

CREATIVE CONSTRUCTION CONFERENCE 2015, SELECTED PAPERS (2015)