AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation

• URL: http://arxiv.org/abs/2003.00376v1
• Date: Sun, 1 Mar 2020 01:27:03 GMT
• Title: AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation
• Authors: Jinglei Cheng, Haoqing Deng and Xuehai Qian
• Abstract summary: AccQOC is a comprehensive static/dynamic hybrid workflow to transform gate groups to pulses using QOC (Quantum Optimal Control) Results show that accelerated compilation based on MST 9.88x compilation speedup compared to the standard compilation of each group while maintaining an average 2.43x latency reduction compared with gate-based compilation.
• Score: 9.78762347997002
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the last decades, we have witnessed the rapid growth of Quantum Computing. In the current Noisy Intermediate-Scale Quantum (NISQ) era, the capability of a quantum machine is limited by the decoherence time, gate fidelity and the number of Qubits. Current quantum computing applications are far from the real "quantum supremacy" due to the fragile physical Qubits, which can only be entangled for a few microseconds. Recent works use quantum optimal control to reduce the latency of quantum circuits, thereby effectively increasing quantum volume. However, the key challenge of this technique is the large overhead due to long compilation time. In this paper, we propose AccQOC, a comprehensive static/dynamic hybrid workflow to transform gate groups (equivalent to matrices) to pulses using QOC (Quantum Optimal Control) with a reasonable compilation time budget. AccQOC is composed of static pre-compilation and accelerated dynamic compilation. With the methodology of AccQOC, we reached a balanced point of compilation time and overall latency. The results show that accelerated compilation based on MST achieves 9.88x compilation speedup compared to the standard compilation of each group while maintaining an average 2.43x latency reduction compared with gate-based compilation.

Related papers

• 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)
• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Program Scheduling [48.142860424323395]
  We introduce the Quantum Program Scheduling Problem (QPSP) to improve the utility efficiency of quantum resources. Specifically, a quantum program scheduling method concerning the circuit width, number of measurement shots, and submission time of quantum programs is proposed to reduce the execution latency.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• Scaling quantum computing with dynamic circuits [0.6990493129893112]
  Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits. Here we overcome these limitations with error mitigated dynamic circuits and circuit-cutting to create quantum states requiring a periodic connectivity employing up to 142 qubits.
  arXiv  Detail & Related papers  (2024-02-27T19:00:07Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Exploiting Different Levels of Parallelism in the Quantum Control Microarchitecture for Superconducting Qubits [16.81923513772868]
  We propose a novel control microarchitecture design to exploit Circuit Level Parallelism (CLP) and Quantum Operation Level Parallelism (QOLP) In the benchmark test of a Shor syndrome measurement, a six-core implementation of our proposal achieves up to 2.59$times$ speedup compared with a single core.
  arXiv  Detail & Related papers  (2021-08-19T13:24:01Z)
• Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse [5.038480082598899]
  We introduce a compiler that exploits direct control at the microarchitectural level to achieve significant improvements for quantum programs. We validate our techniques with millions of experimental shots on IBM quantum computers, controlled via the OpenPulse control interface. For representative benchmarks, our pulse control techniques achieve both 1.6x lower error rates and 2x faster execution time, relative to standard gate-based compilation.
  arXiv  Detail & Related papers  (2020-04-23T14:57:00Z)
• Context-Sensitive and Duration-Aware Qubit Mapping for Various NISQ Devices [4.866886176084101]
  We propose a COntext-sensitive and Duration-Aware Remapping algorithm (Codar) based on the Quantum Abstract Machine (QAM) By introducing lock for each qubit, Codar is aware of gate duration difference and program context. Compared to the best-known algorithm, Codar halves the total execution time of several quantum algorithms and cut down 17.5% - 19.4% total execution time on average in different architectures.
  arXiv  Detail & Related papers  (2020-01-19T19:35:43Z)

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.