Quantum Circuit Optimization by Graph Coloring

• URL: http://arxiv.org/abs/2501.14447v1
• Date: Fri, 24 Jan 2025 12:29:16 GMT
• Title: Quantum Circuit Optimization by Graph Coloring
• Authors: Hochang Lee, Kyung Chul Jeong, Panjin Kim,
• Abstract summary: Depth optimization of a quantum circuit consisting of commuting operations is shown to be reducible to the vertex coloring problem in graph theory.<n>The reduction immediately leads to an algorithm for circuit optimization of commuting gates utilizing any coloring solver.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Depth optimization of a quantum circuit consisting of commuting operations is shown to be reducible to the vertex coloring problem in graph theory. The reduction immediately leads to an algorithm for circuit optimization of commuting gates utilizing any coloring solver. To examine its applicability, known quantum circuits from the literature are optimized.

Related papers

• Efficient hybrid variational quantum algorithm for solving graph coloring problem [4.4739537033766705]
  This paper proposes a hybrid variational quantum algorithm to solve the $k$-coloring problem of graph vertices. We employ a hierarchical framework that integrates feedback correction and conflict resolution to achieve $k$-coloring. We apply the proposed algorithm to optimize the scheduling of a subway transportation network, demonstrating a high degree of fairness.
  arXiv  Detail & Related papers  (2025-04-30T05:45:15Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators. This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Quantum landscape tomography for efficient single-gate optimization on quantum computers [0.0]
  Circuit optimization is a fundamental task for practical applications of near-term quantum computers. We propose a process called quantum landscape tomography to characterize the influence of individual gates on the entire circuit. Our findings highlight the potential of quantum landscape tomography to enhance circuit optimization in near-term quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-25T18:00:06Z)
• Qudit-inspired optimization for graph coloring [0.0]
  We introduce a quantum-inspired algorithm for graph coloring problems (GCPs)<n>We use qudits in a product state, with each qudit representing a node in the graph and parameterized by d-dimensional spherical coordinates.<n>We benchmark two optimization strategies: qudit gradient descent, initiating qudits in random states and employing gradient descent to minimize a cost function.
  arXiv  Detail & Related papers  (2024-06-02T16:19:55Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Sub-universal variational circuits for combinatorial optimization problems [0.0]
  This work introduces a novel class of classical probabilistic circuits designed for generating quantum approximate solutions to optimization problems constructed using two-bit matrices. Through a numerical study, we investigate the performance of our proposed variational circuits in solving the Max-Cut problem on various graphs of increasing sizes. Our findings suggest that evaluating the performance of quantum variational circuits against variational circuits with sub-universal gate sets is a valuable benchmark for identifying areas where quantum variational circuits can excel.
  arXiv  Detail & Related papers  (2023-08-29T02:16:48Z)
• Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation [69.43216268165402]
  We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits. We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states. Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
  arXiv  Detail & Related papers  (2023-03-06T16:51:30Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Hybrid quantum-classical circuit simplification with the ZX-calculus [0.0]
  This work uses an extension of the formal graphical ZX-calculus called ZX-ground as an intermediary representation of the hybrid circuits. We derive a number of gFlow-preserving optimization rules for ZX-ground diagrams that reduce the size of the graph. We present a general procedure for detecting segments of circuit-like ZX-ground diagrams which can be implemented with classical gates in the extracted circuit.
  arXiv  Detail & Related papers  (2021-09-13T15:45:56Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding [0.0]
  We introduce a novel space-efficient quantum optimization algorithm for the graph coloring problem. Our circuits are deeper than the ones of the standard approach. To explore currently available alternatives, we perform a study of random graph coloring on a quantum annealer.
  arXiv  Detail & Related papers  (2020-09-15T18:34:17Z)
• Channel-Directed Gradients for Optimization of Convolutional Neural Networks [50.34913837546743]
  We introduce optimization methods for convolutional neural networks that can be used to improve existing gradient-based optimization in terms of generalization error. We show that defining the gradients along the output channel direction leads to a performance boost, while other directions can be detrimental.
  arXiv  Detail & Related papers  (2020-08-25T00:44:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.