Pulse family optimization for parametrized quantum gates using spectral clustering
arXiv:2408.00119 · doi:10.20935/AcadQuant7374
Abstract
Parametrized gate circuits are used in plentiful applications in the current NISQ era of quantum computing. These parametrized gates are chiefly implemented using analytically found pulse protocols, often yielding suboptimal gate times, and consequently, fidelities. Alternatively, gate optimization algorithms are designed to construct high fidelity pulses for individual, fixed points in continuous parameter space. Gates for intermediate parameters can subsequently be found by some form of interpolation between previously constructed pulses. Nevertheless, it is not guaranteed (as with analytic protocols) that the pulses found by the optimization algorithms belong to the same \textit{family} of solutions and thus show resemblance. Interpolation between two pulses of differing solution families often leads to high infidelities, as the pulse strays away from the minimum in the parameter/fidelity landscape. In this work, we introduce a \textit{spectral clustering} method to sort high-fidelity, optimized pulses in families, and interpolating solely between pulses of the same family. Accordingly, interpolations will always approach maximal fidelity. Furthermore, as more than one pulse family is constructed, the parameter space can be partitioned according to which family prevails fidelity-wise. This work provides a meticulous demonstration of our constitutive continuous gate family construction by applying it to a universal gate set for Rydberg and Cat qubits under noise.
11 pages, 8 figures
References in corpus (21)
- Quantum Computing in the NISQ era and beyond
- Variational Quantum Algorithms
- Randomized Benchmarking of Quantum Gates
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Quantum computing with atomic qubits and Rydberg interactions: Progress and challenges
- The Kerr-Cat Qubit: Stabilization, Readout, and Gates
- Chopped random-basis quantum optimization
- Quantum simulation and computing with Rydberg-interacting qubits
- Quantum channels and memory effects
- Universality in Quantum Computation
- A simple derivation of the Lindblad equation
- Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
- Error-robust quantum logic optimization using a cloud quantum computer interface
- Robust control and optimal Rydberg states for neutral atom two-qubit gates
- Optimal control of families of quantum gates
- Pulse based Variational Quantum Optimal Control for hybrid quantum computing
- An introduction to variational quantum algorithms for combinatorial optimization problems
- Simulating nonnative cubic interactions on noisy quantum machines
- Continuous quantum gate sets and pulse class meta-optimization
- Optimization of the Variational Quantum Eigensolver for Quantum Chemistry Applications
- Efficient control pulses for continuous quantum gate families through coordinated re-optimization