Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation

• URL: http://arxiv.org/abs/2303.03280v1
• Date: Mon, 6 Mar 2023 16:51:30 GMT
• Title: Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation
• Authors: Ioana Moflic, Vikas Garg, Alexandru Paler
• Abstract summary: 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.
• Score: 69.43216268165402
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reinforcement learning (RL) is a promising method for quantum circuit optimisation. However, the state space that has to be explored by an RL agent is extremely large when considering all the possibilities in which a quantum circuit can be transformed through local rewrite operations. This state space explosion slows down the learning of RL-based optimisation strategies. 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. We illustrate our proof of concept implementation on Bernstein-Vazirani circuits and, from preliminary results, we conclude that our autoencoder approach: a) maintains the optimality of the original RL method; b) reduces by 20 \% the size of the table that encodes the learned optimisation strategy. Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.

Related papers

• Optimizing Quantum Circuits, Fast and Slow [7.543907169342984]
  We present a framework for thinking of rewriting and resynthesis as abstract circuit transformations. We then present a radically simple algorithm, GUOQ, for optimizing quantum circuits.
  arXiv  Detail & Related papers  (2024-11-06T18:34:35Z)
• 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)
• Cost Explosion for Efficient Reinforcement Learning Optimisation of Quantum Circuits [55.616364225463066]
  Reinforcement Learning (RL) is a recent approach for learning strategies to optimise quantum circuits by increasing the reward of an optimisation agent. Our goal is to improve the agent's optimization strategy, by including hints about how quantum circuits are optimized manually. We show that allowing cost explosions offers significant advantages for RL training, such as reaching optimum circuits.
  arXiv  Detail & Related papers  (2023-11-21T10:16:03Z)
• Quarl: A Learning-Based Quantum Circuit Optimizer [8.994999903946848]
  This paper presents Quarl, a learning-based quantum circuit. Applying reinforcement learning to quantum circuit optimization raises two main challenges: the large and varying action space and the non-uniform state representation.
  arXiv  Detail & Related papers  (2023-07-17T19:21:22Z)
• Riemannian quantum circuit optimization for Hamiltonian simulation [2.1227079314039057]
  Hamiltonian simulation is a natural application of quantum computing. For translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers. For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements.
  arXiv  Detail & Related papers  (2022-12-15T00:00:17Z)
• Learning Representations for CSI Adaptive Quantization and Feedback [51.14360605938647]
  We propose an efficient method for adaptive quantization and feedback in frequency division duplexing systems. Existing works mainly focus on the implementation of autoencoder (AE) neural networks for CSI compression. We recommend two different methods: one based on a post training quantization and the second one in which the codebook is found during the training of the AE.
  arXiv  Detail & Related papers  (2022-07-13T08:52:13Z)
• 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 Gate Pattern Recognition and Circuit Optimization for Scientific Applications [1.6329956884407544]
  We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. Our technique is generic and can be useful for a wide variety of quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-19T16:20: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)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.