Supervised Learning Enhanced Quantum Circuit Transformation

• URL: http://arxiv.org/abs/2110.03057v2
• Date: Thu, 27 Jan 2022 17:00:35 GMT
• Title: Supervised Learning Enhanced Quantum Circuit Transformation
• Authors: Xiangzhen Zhou, Yuan Feng and Sanjiang Li
• Abstract summary: A quantum circuit transformation (QCT) is required when executing a quantum program in a real quantum processing unit (QPU) We propose a framework that uses a policy artificial neural network (ANN) trained by supervised learning on shallow circuits to help existing QCT algorithms select the most promising SWAP gate.
• Score: 6.72166630054365
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A quantum circuit transformation (QCT) is required when executing a quantum program in a real quantum processing unit (QPU). Through inserting auxiliary SWAP gates, a QCT algorithm transforms a quantum circuit to one that satisfies the connectivity constraint imposed by the QPU. Due to the non-negligible gate error and the limited qubit coherence time of the QPU, QCT algorithms which minimize gate number or circuit depth or maximize the fidelity of output circuits are in urgent need. Unfortunately, finding optimized transformations often involves exhaustive searches, which are extremely time-consuming and not practical for most circuits. In this paper, we propose a framework that uses a policy artificial neural network (ANN) trained by supervised learning on shallow circuits to help existing QCT algorithms select the most promising SWAP gate. ANNs can be trained off-line in a distributed way. The trained ANN can be easily incorporated into QCT algorithms without bringing too much overhead in time complexity. Exemplary embeddings of the trained ANNs into target QCT algorithms demonstrate that the transformation performance can be consistently improved on QPUs with various connectivity structures and random or realistic quantum circuits.

Related papers

• Topology-Driven Quantum Architecture Search Framework [2.9862856321580895]
  We propose a Topology-Driven Quantum Architecture Search (TD-QAS) framework to identify high-performance quantum circuits. By decoupling the extensive search space into topology and gate-type components, TD-QAS avoids exploring gate configurations within low-performance topologies.
  arXiv  Detail & Related papers  (2025-02-20T05:05:53Z)
• 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)
• Compiler for Distributed Quantum Computing: a Reinforcement Learning Approach [6.347685922582191]
  We introduce a novel compiler that prioritizes reducing the expected execution time by jointly managing the generation and routing of EPR pairs. We present a real-time, adaptive approach to compiler design, accounting for the nature of entanglement generation and the operational demands of quantum circuits. Our contributions are twofold: (i) we model the optimal compiler for DQC using a Markov Decision Process (MDP) formulation, establishing the existence of an optimal algorithm, and (ii) we introduce a constrained Reinforcement Learning (RL) method to approximate this optimal compiler.
  arXiv  Detail & Related papers  (2024-04-25T23:03:20Z)
• 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)
• Benchmarking Quantum Circuit Transformation with QKNOB Circuits [4.518076543914809]
  superconducting quantum devices impose strict connectivity constraints on quantum circuit execution. This paper introduces QKNOB, a novel benchmark construction method for quantum circuit transformation. We show that SABRE, the default Qiskit compiler, consistently achieves the best performance on the 53-qubit IBM Q Rochester and Google Sycamore devices.
  arXiv  Detail & Related papers  (2023-01-21T10:05:51Z)
• Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer [1.2019888796331233]
  We introduce a new circuit called AQCEL, which aims to remove redundant controlled operations from controlled gates. As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics. We have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates.
  arXiv  Detail & Related papers  (2022-09-06T09:19:07Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• 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)
• Variational quantum compiling with double Q-learning [0.37798600249187286]
  We propose a variational quantum compiling (VQC) algorithm based on reinforcement learning (RL) An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by double Q-learning. It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices.
  arXiv  Detail & Related papers  (2021-03-22T06:46:35Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06: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.