PAN: Pulse Ansatz on NISQ Machines

08/02/2022
by   Zhiding Liang, et al.
0

Variational quantum algorithms (VQAs) have demonstrated great potentials in the 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. In quantum computers, the gate ansatz will eventually be transformed into control signals such as microwave pulses on transmons. And the control pulses need elaborate calibration 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 PAN, a native-pulse ansatz generator framework for VQAs. We generate native-pulse ansatz with trainable parameters for amplitudes and frequencies. In our proposed PAN, we are tuning parametric pulses, which are natively supported on NISQ computers. Considering that parameter-shift rules do not hold for native-pulse ansatz, we need to deploy non-gradient optimizers. 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 to validate our methods. When adopted on NISQ machines, PAN obtained improved the performance with decreased latency by an average of 86 96.482 average accuracy of 97.27 and NaH. PAN also demonstrates advantages on QAOA tasks even with considerable noises in NISQ machines.

READ FULL TEXT

page 1

page 2

page 5

page 11

research
12/07/2022

Review of Ansatz Designing Techniques for Variational Quantum Algorithms

For a large number of tasks, quantum computing demonstrates the potentia...
research
03/22/2021

Variational quantum compiling with double Q-learning

Quantum compiling aims to construct a quantum circuit V by quantum gates...
research
10/15/2021

Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation Algorithm

Optimizing parameterized quantum circuits promises efficient use of near...
research
08/21/2023

A Block-Ring connected Topology of Parameterized Quantum Circuits

It is essential to select efficient topology of parameterized quantum ci...
research
06/02/2021

Single-component gradient rules for variational quantum algorithms

Many near-term quantum computing algorithms are conceived as variational...
research
08/21/2023

One-Time Compilation of Device-Level Instructions for Quantum Subroutines

A large class of problems in the current era of quantum devices involve ...

Please sign up or login with your details

Forgot password? Click here to reset