NAPA: Intermediate-level Variational Native-pulse Ansatz for Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2208.01215v5
• Date: Sat, 13 Jan 2024 01:42:49 GMT
• Title: NAPA: Intermediate-level Variational Native-pulse Ansatz for Variational Quantum Algorithms
• Authors: Zhiding Liang, Jinglei Cheng, Hang Ren, Hanrui Wang, Fei Hua, Zhixin Song, Yongshan Ding, Fred Chong, Song Han, Xuehai Qian, Yiyu Shi
• Abstract summary: Variational quantum algorithms (VQAs) have demonstrated great potentials in the Noisy Intermediate Scale Quantum (NISQ) era. We propose NAPA, a native-pulse ansatz generator framework for VQAs.
• Score: 18.66030936302464
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational quantum algorithms (VQAs) have demonstrated great potentials in the Noisy Intermediate Scale Quantum (NISQ) era. In the workflow of VQA, the parameters of ansatz are iteratively updated to approximate the desired quantum states. We have seen various efforts to draft better ansatz with less gates. Some works consider the physical meaning of the underlying circuits, while others adopt the ideas of neural architecture search (NAS) for ansatz generator. However, these designs do not exploit the full advantages of VQAs. Because most techniques target gate ansatz, and the parameters are usually rotation angles of the gates. In quantum computers, the gate ansatz will eventually be transformed into control signals such as microwave pulses on superconducting qubits. These control pulses need elaborate calibrations to minimize the errors such as over-rotation and under-rotation. In the case of VQAs, this procedure will introduce redundancy, but the variational properties of VQAs can naturally handle problems of over-rotation and under-rotation by updating the amplitude and frequency parameters. Therefore, we propose NAPA, a native-pulse ansatz generator framework for VQAs. We generate native-pulse ansatz with trainable parameters for amplitudes and frequencies. In our proposed NAPA, we are tuning parametric pulses, which are natively supported on NISQ computers. Given the limited availability of gradient-based optimizers for pulse-level quantum programs, we choose to deploy non-gradient optimizers in our framework. To constrain the number of parameters sent to the optimizer, we adopt a progressive way to generate our native-pulse ansatz. Experiments are conducted on both simulators and quantum devices for Variational Quantum Eigensolver (VQE) tasks to evaluate our methods.

Related papers

• Pre-optimizing variational quantum eigensolvers with tensor networks [1.4512477254432858]
  We present and benchmark an approach where we find good starting parameters for parameterized quantum circuits by simulating VQE. We apply this approach to the 1D and 2D Fermi-Hubbard model with system sizes that use up to 32 qubits. In 2D, the parameters that VTNE finds have significantly lower energy than their starting configurations, and we show that starting VQE from these parameters requires non-trivially fewer operations to come down to a given energy.
  arXiv  Detail & Related papers  (2023-10-19T17:57:58Z)
• Toward Consistent High-fidelity Quantum Learning on Unstable Devices via Efficient In-situ Calibration [5.0854551390284]
  In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. In this paper, we propose a novel quantum pulse-based noise adaptation framework, namely QuPAD. Experiments show that the runtime on quantum devices of QuPAD with 8-10 qubits is less than 15 minutes, which is up to 270x faster than the parameter-shift approach.
  arXiv  Detail & Related papers  (2023-09-12T15:39:06Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Variational waveguide QED simulators [58.720142291102135]
  Waveguide QED simulators are made by quantum emitters interacting with one-dimensional photonic band-gap materials. Here, we demonstrate how these interactions can be a resource to develop more efficient variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-02-03T18:55:08Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• TopGen: Topology-Aware Bottom-Up Generator for Variational Quantum Circuits [26.735857677349628]
  Variational Quantum Algorithms (VQA) are promising to demonstrate quantum advantages on near-term devices. Designing ansatz, a variational circuit with parameterized gates, is of paramount importance for VQA. We propose a bottom-up approach to generate topology-specific ansatz.
  arXiv  Detail & Related papers  (2022-10-15T04:18:41Z)
• Variational Quantum Pulse Learning [28.040754288931897]
  We propose variational quantum pulses (VQP), a novel paradigm to directly train quantum pulses for learning tasks. VQP manipulates variational quantum pulses by pulling and pushing the amplitudes of pulses in an optimization framework. Our framework to train pulses maintains the robustness to noise on Noisy Intermediate-Scale Quantum (NISQ) computers.
  arXiv  Detail & Related papers  (2022-03-31T17:58:13Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Optimal training of variational quantum algorithms without barren plateaus [0.0]
  Variational quantum algorithms (VQAs) promise efficient use of near-term quantum computers. We show how to optimally train a VQA for learning quantum states. We propose the application of Gaussian kernels for quantum machine learning.
  arXiv  Detail & Related papers  (2021-04-29T17:54:59Z)
• 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.