NAPA: Intermediate-level Variational Native-pulse Ansatz for Variational Quantum Algorithms
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 12 of its 87 references that are in the map. First posted on arXiv 2 Aug 2022.
Builds on
12 of 87 references.
References · 12
- 2020Variational Quantum Algorithmscited by 692
- 2020The power of quantum neural networkscited by 379
- 2020Noise-Induced Barren Plateaus in Variational Quantum Algorithmscited by 193
- 2021Quantum advantage in learning from experimentscited by 188
- 2021QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuitscited by 98
- 2020Quantum circuit architecture search for variational quantum algorithmscited by 82
- 2020Trainability of Dissipative Perceptron-Based Quantum Neural Networkscited by 56
- 2022SupermarQ: A Scalable Quantum Benchmark Suitecited by 14
- 2020Optimized Quantum Compilation for Near-Term Algorithms with OpenPulsecited by 8
- 2021Excited state, non-adiabatic dynamics of large photoswitchable molecules using a chemically transferable machine learning potentialcited by 7
- 2019Optimized Compilation of Aggregated Instructions for Realistic Quantum Computerscited by 5
- 2019Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machinescited by 3
Built on by
Citing papers per year: 2025: 4.
4 papers.
- 2025EnQode: Fast Amplitude Embedding for Quantum Machine Learning Using Classical Datacited by 2
- 2025Connecting phases of matter to the flatness of the loss landscape in analog variational quantum algorithmscited by 0
- 2025On the Design of Expressive and Trainable Pulse-based Quantum Machine Learning Modelscited by 0
- 2025DiffQ: Unified Parameter Initialization for Variational Quantum Algorithms via Diffusion Modelscited by 0
- 2025DiffQ: Unified Parameter Initialization for Variational Quantum Algorithms via Diffusion Models22 Sep 2025
- 2025On the Design of Expressive and Trainable Pulse-based Quantum Machine Learning Models7 Aug 2025
- 2025Connecting phases of matter to the flatness of the loss landscape in analog variational quantum algorithms16 Jun 2025
- 2025EnQode: Fast Amplitude Embedding for Quantum Machine Learning Using Classical Data18 Mar 2025