Quantum Circuit Compilation for the Graph Coloring Problem
Abstract
References
Index Terms
- Quantum Circuit Compilation for the Graph Coloring Problem
Recommendations
Solving quantum circuit compilation problem variants through genetic algorithms
AbstractThe gate-based model is one of the leading quantum computing paradigms for representing quantum circuits. Within this paradigm, a quantum algorithm is expressed in terms of a set of quantum gates that are executed on the quantum hardware over time,...
A Novel Ant Colony Optimization Strategy for the Quantum Circuit Compilation Problem
Evolutionary Computation in Combinatorial OptimizationAbstractQuantum Computing represents the most promising technology towards speed boost in computation, opening the possibility of major breakthroughs in several disciplines including Artificial Intelligence. This paper investigates the performance of a ...
An efficient circuit compilation flow for quantum approximate optimization algorithm
DAC '20: Proceedings of the 57th ACM/EDAC/IEEE Design Automation ConferenceQuantum approximate optimization algorithm (QAOA) is a promising quantum-classical hybrid algorithm to solve hard combinatorial optimization problems. The two-qubits gates used in quantum circuit for QAOA are commutative i.e., the order of gates can be ...
Comments
Information & Contributors
Information
Published In
![cover image Guide Proceedings](/cms/asset/3018dbb9-12e2-402c-96b4-a2c62a5bb755/978-3-031-27181-6.cover.jpg)
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in