Enhancing Quantum Optimization with Parity Network Synthesis

• URL: http://arxiv.org/abs/2402.11099v1
• Date: Fri, 16 Feb 2024 22:11:52 GMT
• Title: Enhancing Quantum Optimization with Parity Network Synthesis
• Authors: Colin Campbell, Edward D Dahl
• Abstract summary: We propose a pair of algorithms for parity network synthesis and linear circuit inversion. Together, these algorithms can build the diagonal component of the QAOA circuit, generally the most expensive in terms of two qubit gates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper examines QAOA in the context of parity network synthesis. We propose a pair of algorithms for parity network synthesis and linear circuit inversion. Together, these algorithms can build the diagonal component of the QAOA circuit, generally the most expensive in terms of two qubit gates. We compare the CNOT count of our strategy to off-the-shelf compiler tools for random, full, and graph-based optimization problems and find that ours outperforms the alternatives.

Related papers

• Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling [96.47086913559289]
  gradient-based algorithms are widely used in bilevel optimization. We introduce a without-replacement sampling based algorithm which achieves a faster convergence rate. We validate our algorithms over both synthetic and real-world applications.
  arXiv  Detail & Related papers  (2024-11-07T17:05:31Z)
• Performance of Parity QAOA for the Signed Max-Cut Problem [0.0]
  We investigate the performance of the Quantum Approximate Algorithm Optimization on the Parity architecture (Parity QAOA) By comparing the algorithms at fixed circuit depth, we demonstrate that Parity QAOA outperforms conventional QAOA implementations based on SWAP networks.
  arXiv  Detail & Related papers  (2024-09-23T08:00:03Z)
• Improved Qubit Routing for QAOA Circuits [0.0]
  We develop a qubit routing algorithm with classical run time for the Quantum Approximate Optimization Algorithm (QAOA) We show that it improves upon existing state-of-the-art routing algorithms for QAOA circuits defined on $k$-regular as well as Erd"os-Renyi problem graphs of sizes up to $N leq 400$.
  arXiv  Detail & Related papers  (2023-12-26T10:26:10Z)
• Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models [0.0]
  parity mapping provides a geometrically local encoding of the Quantum Approximate Optimization Algorithm (QAOA) We benchmark the parity-encoded QAOA on spin-glass models. We show that for fixed number of parity-encoded QAOA layers, the performance drops as $N-1/2$.
  arXiv  Detail & Related papers  (2023-11-03T18:00:00Z)
• Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates [49.84541884653309]
  A current standard approach to solving convex discrete optimization problems is the use of cutting-plane algorithms. Despite the existence of a number of general-purpose cut-generating algorithms, large-scale discrete optimization problems continue to suffer from intractability. We propose a method for accelerating cutting-plane algorithms via reinforcement learning.
  arXiv  Detail & Related papers  (2023-07-17T20:11:56Z)
• Deep Unrolling for Nonconvex Robust Principal Component Analysis [75.32013242448151]
  We design algorithms for Robust Component Analysis (A) It consists in decomposing a matrix into the sum of a low Principaled matrix and a sparse Principaled matrix.
  arXiv  Detail & Related papers  (2023-07-12T03:48:26Z)
• Efficient quantum gate decomposition via adaptive circuit compression [0.0]
  The utilization of parametric two-qubit gates in the circuit design allows us to transform the discrete problem of circuit synthesis into an optimization problem over continuous variables. We implemented the algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools.
  arXiv  Detail & Related papers  (2022-03-08T22:29:31Z)
• Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures [0.0]
  We present a new algorithm for the synthesis of CNOT circuits based on the solution of the syndrome decoding problem. Our method addresses the case of ideal hardware with an all-to-all qubit connectivity and the case of near-term quantum devices with restricted connectivity.
  arXiv  Detail & Related papers  (2022-01-17T15:11:36Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Bilevel Optimization: Convergence Analysis and Enhanced Design [63.64636047748605]
  Bilevel optimization is a tool for many machine learning problems. We propose a novel stoc-efficientgradient estimator named stoc-BiO.
  arXiv  Detail & Related papers  (2020-10-15T18:09:48Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.