Learning dynamic quantum circuits for efficient state preparation

• URL: http://arxiv.org/abs/2410.09030v1
• Date: Fri, 11 Oct 2024 17:47:46 GMT
• Title: Learning dynamic quantum circuits for efficient state preparation
• Authors: Faisal Alam, Bryan K. Clark,
• Abstract summary: Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. We develop scalable tensor network algorithms which find high-fidelity DQC preparations for generic states. Our work demonstrates the power of an algorithmic approach to generating DQC circuits, broadening their scope of applications to new areas of quantum computing.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. DQCs can prepare certain long-range entangled states in constant depth, making them a promising route to preparing complex quantum states on devices with a limited coherence time. Almost all constructions of DQCs for state preparation have been formulated analytically, relying on special structure in the target states. In this work, we approach the problem of state preparation variationally, developing scalable tensor network algorithms which find high-fidelity DQC preparations for generic states. We apply our algorithms to critical states, random matrix product states, and subset states. We consider both DQCs with a fixed number of ancillae and those with an extensive number of ancillae. Even in the few ancillae regime, the DQCs discovered by our algorithms consistently prepare states with lower infidelity than a static quantum circuit of the same depth. Notably, we observe constant fidelity gains across system sizes and circuit depths. For DQCs with an extensive number of ancillae, we introduce scalable methods for decoding measurement outcomes, including a neural network decoder and a real-time decoding protocol. Our work demonstrates the power of an algorithmic approach to generating DQC circuits, broadening their scope of applications to new areas of quantum computing.

Related papers

• SuperEncoder: Towards Universal Neural Approximate Quantum State Preparation [12.591173729459427]
  We show that it is possible to leverage a pre-trained neural network to directly generate the QSP circuit for arbitrary quantum state. Our study makes a steady step towards a universal neural designer for approximate QSP.
  arXiv  Detail & Related papers  (2024-08-10T04:39:05Z)
• Double-bracket quantum algorithms for high-fidelity ground state preparation [0.7142083707942719]
  We show how to use double-bracket quantum algorithms (DBQAs) to prepare ground states. For a Heisenberg model, we compile our algorithm using CZ and single-qubit gates into circuits that match capabilities of near-term quantum devices.
  arXiv  Detail & Related papers  (2024-08-07T18:00:00Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• 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)
• Learning Informative Latent Representation for Quantum State Tomography [18.19768367431327]
  Quantum state tomography (QST) is the process of reconstructing the complete state of a quantum system. Recent advances in deep neural networks (DNNs) led to the emergence of deep learning (DL) in QST. We propose a transformer-based autoencoder architecture tailored for QST with imperfect measurement data.
  arXiv  Detail & Related papers  (2023-09-30T22:37:28Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Realizing Quantum Convolutional Neural Networks on a Superconducting Quantum Processor to Recognize Quantum Phases [2.1465372441653354]
  Quantum neural networks tailored to recognize specific features of quantum states by combining unitary operations, measurements and feedforward promise to require fewer measurements and to tolerate errors. We realize a quantum convolutional neural network (QCNN) on a 7-qubit superconducting quantum processor to identify symmetry-protected topological phases of a spin model characterized by a non-zero string order parameter. We find that, despite being composed of finite-fidelity gates itself, the QCNN recognizes the topological phase with higher fidelity than direct measurements of the string order parameter for the prepared states.
  arXiv  Detail & Related papers  (2021-09-13T12:32:57Z)
• Automatically Differentiable Quantum Circuit for Many-qubit State Preparation [1.5662820454886202]
  We propose the automatically differentiable quantum circuit (ADQC) approach to efficiently prepare arbitrary quantum many-qubit states. The circuit is optimized by updating the latent gates using back propagation to minimize the distance between the evolved and target states. Our work sheds light on the "intelligent construction" of quantum circuits for many-qubit systems by combining with the machine learning methods.
  arXiv  Detail & Related papers  (2021-04-30T12:22:26Z)

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.