A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization

• URL: http://arxiv.org/abs/2303.17366v2
• Date: Fri, 31 Mar 2023 08:08:43 GMT
• Title: A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization
• Authors: David Winderl, Qunsheng Huang, Christian B. Mendl
• Abstract summary: We replace the approach of PauliOpt with a synthesis based search and utilize a divide and conquer method to synthesize an optimized circuit from a ZXOA library. We demonstrate a significant advantage for randomized circuits, which highlights the advantages of utilizing an architecture-aware methodology.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The synthesis of quantum circuits from phase gadgets in the ZX-calculus facilitates quantum circuit optimization. Our work provides an alternative formulation for the architecture-aware synthesis algorithm of PauliOpt by replacing the stochastic approach of PauliOpt with a heuristic based search and utilizes a divide and conquer method to synthesize an optimized circuit from a ZX polynomial. We provide a comparison of our algorithm with PauliOpt and other state-of-the-art optimization libraries. While we note poorer performance for highly structured circuits, as in the QAOA formulation for Max-Cut, we demonstrate a significant advantage for randomized circuits, which highlights the advantages of utilizing an architecture-aware methodology.

Related papers

• 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)
• Curriculum reinforcement learning for quantum architecture search under hardware errors [1.583327010995414]
  This work introduces a curriculum-based reinforcement learning QAS (CRLQAS) designed to tackle challenges in VQA deployment. The algorithm incorporates (i) a 3D architecture encoding and restrictions on environment dynamics to explore the search space of possible circuits efficiently. To facilitate studies, we developed an optimized simulator for our algorithm, significantly improving computational efficiency in noisy quantum circuits.
  arXiv  Detail & Related papers  (2024-02-05T20:33:00Z)
• Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus [0.0]
  We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams. We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based algorithm for the problem in hand. Our approach is ready to be used as a valuable tool for the implementation of quantum algorithms in the near-term intermediate-scale range (NISQ)
  arXiv  Detail & Related papers  (2023-12-18T17:59:43Z)
• Characterization, synthesis, and optimization of quantum circuits over multiple-control $\textit{Z}$-rotation gates: A systematic study [4.385466953937176]
  We study quantum circuits composed of multiple-control $Z$-rotation (MCZR) gates as primitives. We present a gate-exchange strategy together with a flexible iterative algorithm for effectively optimizing the depth of any MCZR circuit.
  arXiv  Detail & Related papers  (2023-04-18T06:34:18Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• 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)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)
• 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)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space [5.406226763868874]
  We present QFAST, a quantum synthesis tool designed to produce short circuits. We show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level.
  arXiv  Detail & Related papers  (2020-03-09T23:55:43Z)

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.