Reinforcement Learning for Digital Quantum Simulation

• URL: http://arxiv.org/abs/2006.16269v1
• Date: Mon, 29 Jun 2020 18:00:11 GMT
• Title: Reinforcement Learning for Digital Quantum Simulation
• Authors: Adrien Bolens and Markus Heyl
• Abstract summary: We introduce a reinforcement learning algorithm to build optimized quantum circuits for digital quantum simulation. We consistently obtain quantum circuits that reproduce physical observables with as little as three entangling gates for long times and large system sizes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time evolution operator through a sequence of elementary quantum gates, typically achieved using Trotterization. A fundamental challenge in this context originates from experimental imperfections for the involved quantum gates, which critically limits the number of attainable gates within a reasonable accuracy and therefore the achievable system sizes and simulation times. In this work, we introduce a reinforcement learning algorithm to systematically build optimized quantum circuits for digital quantum simulation upon imposing a strong constraint on the number of allowed quantum gates. With this we consistently obtain quantum circuits that reproduce physical observables with as little as three entangling gates for long times and large system sizes. As concrete examples we apply our formalism to a long range Ising chain and the lattice Schwinger model. Our method makes larger scale digital quantum simulation possible within the scope of current experimental technology.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Sequential quantum simulation of spin chains with a single circuit QED device [5.841833052422423]
  Quantum simulation of many-body systems in materials science and chemistry are promising application areas for quantum computers. We show how a single-circuit quantum electrodynamics device can be used to simulate the ground state of a highly-entangled quantum many-body spin chain. We demonstrate that the large state space of the cavity can be used to replace multiple qubits in a qubit-only architecture, and could therefore simplify the design of quantum processors for materials simulation.
  arXiv  Detail & Related papers  (2023-08-30T18:00:03Z)
• Programmable quantum simulations on a trapped-ions quantum computer with a global drive [0.0]
  We experimentally demonstrate a method for quantum simulations on a small-scale trapped ions-based quantum computer. We measure the evolution of a quantum Ising ring and accurately reconstruct the Hamiltonian parameters, showcasing an accurate and high-fidelity simulation.
  arXiv  Detail & Related papers  (2023-08-30T13:49:05Z)
• Simulation of open quantum systems via low-depth convex unitary evolutions [0.0]
  We propose a hybrid quantum-classical approach for simulating a class of open system dynamics called random-unitary channels. We implement simulations of open quantum systems up to dozens of qubits and with large channel ranks.
  arXiv  Detail & Related papers  (2023-07-26T17:44:35Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• The Coming Decades of Quantum Simulation [0.0]
  We focus on various shades of quantum simulation (Noisy Intermediate Scale Quantum, NISQ) devices, analogue and digital quantum simulators and quantum annealers. There is a clear need and quest for such systems that, without necessarily simulating quantum dynamics of some physical systems, can generate massive, controllable, robust, entangled, and superposition states. This will, in particular, allow the control of decoherence, enabling the use of these states for quantum communications.
  arXiv  Detail & Related papers  (2022-04-19T14:02:32Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Experimental simulation of open quantum system dynamics via Trotterization [8.581263348642212]
  We experimentally demonstrate a digital simulation of an open quantum system in a controllable Markovian environment. By Trotterizing the quantum Liouvillians, the continuous evolution of an open quantum system is effectively realized. High-order Trotter for open quantum dynamics is also experimentally investigated and shows higher accuracy.
  arXiv  Detail & Related papers  (2021-08-05T06:17:26Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)

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.