Cost Explosion for Efficient Reinforcement Learning Optimisation of
Quantum Circuits
- URL: http://arxiv.org/abs/2311.12498v1
- Date: Tue, 21 Nov 2023 10:16:03 GMT
- Title: Cost Explosion for Efficient Reinforcement Learning Optimisation of
Quantum Circuits
- Authors: Ioana Moflic and Alexandru Paler
- Abstract summary: 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.
- Score: 55.616364225463066
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Large scale optimisation of quantum circuits is a computationally challenging
problem. Reinforcement Learning (RL) is a recent approach for learning
strategies to optimise quantum circuits by increasing the reward of an
optimisation agent. The reward is a function of the quantum circuit costs, such
as gate and qubit counts, or circuit depth. Our goal is to improve the agent's
optimization strategy, by including hints about how quantum circuits are
optimized manually: there are situations when the cost of a circuit should be
allowed to temporary explode, before applying optimisations which significantly
reduce the circuit's cost. We bring numerical evidence, using
Bernstein-Vazirani circuits, to support the advantage of this strategy. Our
results are preliminary, and show that allowing cost explosions offers
significant advantages for RL training, such as reaching optimum circuits. Cost
explosion strategies have the potential to be an essential tool for RL of
large-scale quantum circuit optimisation.
Related papers
- Symmetry-preserved cost functions for variational quantum eigensolver [0.0]
Hybrid quantum-classical variational algorithms are considered ideal for noisy quantum computers.
We propose encoding symmetry preservation directly into the cost function, enabling more efficient use of Hardware-Efficient Ans"atze.
arXiv Detail & Related papers (2024-11-25T20:33:47Z) - 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) - Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training [0.0]
Variational quantum algorithms are viewed as promising candidates for demonstrating quantum advantage on near-term devices.
This work introduces a novel optimization method designed to alleviate the adverse effects of barren plateau (BP) problems during circuit training.
We have successfully applied our optimization strategy to quantum circuits comprising $16$ qubits and $15000$ entangling gates.
arXiv Detail & Related papers (2024-02-07T20:06:29Z) - Towards Faster Reinforcement Learning of Quantum Circuit Optimization:
Exponential Reward Functions [55.616364225463066]
Reinforcement learning for the optimization of quantum circuits uses an agent whose goal is to maximize the value of a reward function.
We propose an exponential reward function which is sensitive to structural properties of the circuit.
arXiv Detail & Related papers (2023-11-21T10:33:26Z) - 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) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
We propose that quantum circuits can be modeled as queuing networks.
Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
arXiv Detail & Related papers (2021-06-26T10:55:52Z) - Quantum circuit optimization with deep reinforcement learning [3.047409448159345]
We present an approach to quantum circuit optimization based on reinforcement learning.
We demonstrate how an agent, realized by a deep convolutional neural network, can autonomously learn generic strategies to optimize arbitrary circuits.
We examine the extrapolation to larger circuits than used for training, and envision how this approach can be utilized for near-term quantum devices.
arXiv Detail & Related papers (2021-03-13T00:49:51Z)
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.