Hybrid quantum-classical circuit simplification with the ZX-calculus

• URL: http://arxiv.org/abs/2109.06071v1
• Date: Mon, 13 Sep 2021 15:45:56 GMT
• Title: Hybrid quantum-classical circuit simplification with the ZX-calculus
• Authors: Agust\'in Borgna, Simon Perdrix, Beno\^it Valiron
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a complete optimization procedure for hybrid quantum-classical circuits with classical parity logic. While common optimization techniques for quantum algorithms focus on rewriting solely the pure quantum segments, there is interest in applying a global optimization process for applications such as quantum error correction and quantum assertions. This work, based on the pure-quantum circuit optimization procedure by Duncan et al., uses an extension of the formal graphical ZX-calculus called ZX-ground as an intermediary representation of the hybrid circuits to allow for granular optimizations below the quantum-gate level. We define a translation from hybrid circuits into diagrams that admit the graph-theoretical focused-gFlow property, needed for the final extraction back into a circuit. We then derive a number of gFlow-preserving optimization rules for ZX-ground diagrams that reduce the size of the graph, and devise an strategy to find optimization opportunities by rewriting the diagram guided by a Gauss elimination process. Then, after extracting the circuit, 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. We have implemented our optimization procedure as an extension to the open-source python library PyZX.

Related papers

• Linear and non-linear relational analyses for Quantum Program Optimization [0.9208007322096532]
  We show that the phase folding optimization can be re-cast as an emphaffine relation analysis We show that the emphsum-over-paths technique can be used to extract precise symbolic transition relations for straightline circuits.
  arXiv  Detail & Related papers  (2024-10-30T22:57:07Z)
• 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)
• Causal flow preserving optimisation of quantum circuits in the ZX-calculus [0.0]
  This paper introduces an optimisation algorithm aiming to minimise non-Clifford gate count and two-qubit gate count. By translating a circuit into a ZX-diagram it can be simplified before being extracted back into a circuit. A particularly effective strategy for optimising QFT circuits is also noted, resulting in exactly one two-qubit gate per non-Clifford gate.
  arXiv  Detail & Related papers  (2023-12-05T14:24:44Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• 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)
• Rotation-inspired circuit cut optimization [7.562843347215286]
  Recent works have demonstrated that large quantum circuits can be cut and decomposed into smaller clusters of quantum circuits. We propose Rotation-Inspired Circuit Cut Optimization (RICCO), an alternative method which reduces the post-processing overhead of circuit cutting. We demonstrate practical application of RICCO to VQE by classically simulating a small instance of VQE and comparing it to one of the existing circuit-cutting methods.
  arXiv  Detail & Related papers  (2022-11-14T13:57:22Z)
• Vanishing 2-Qubit Gates with Non-Simplification ZX-Rules [1.0089382889894247]
  A quantum circuit can be translated to a ZX-diagram which can be simplified using the rules of the ZX-calculus. The best-known extraction procedures can drastically increase the number of 2-qubit gates. We take advantage of the fact that local changes in a ZX-diagram can drastically affect the complexity of the extracted circuit.
  arXiv  Detail & Related papers  (2022-09-14T18:43:21Z)
• 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)
• 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)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.