Evaluation of Parameterized Quantum Circuits with Cross-Resonance Pulse-Driven Entanglers

Abstract

Variational Quantum Algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for VQAs is crucial to their overall performance, especially on near-term devices. In this paper, we utilize pulse-level access to quantum machines and our understanding of their two-qubit interactions to optimize the design of two-qubit entanglers in a manner suitable for VQAs. Our analysis results show that pulse-optimized ansatze reduce state preparation times by more than half, maintain expressibility relative to standard PQCs, and are more trainable through local cost function analysis. Our algorithm performance results show that in three cases, our PQC configuration outperforms the base implementation. Our algorithm performance results, executed on IBM Quantum hardware, demonstrate that our pulse-optimized PQC configurations are more capable of solving MaxCut and Chemistry problems compared to a standard configuration.

References in corpus (25)

• Charge insensitive qubit design derived from the Cooper pair box
• Variational Quantum Algorithms
• A Quantum Approximate Optimization Algorithm
• The power of quantum neural networks
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Process verification of two-qubit quantum gates by randomized benchmarking
• Entanglement Devised Barren Plateau Mitigation
• From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
• Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Evaluating the noise resilience of variational quantum algorithms
• The Meta-Variational Quantum Eigensolver (Meta-VQE): Learning energy profiles of parameterized Hamiltonians for quantum simulation
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
• Adaptive pruning-based optimization of parameterized quantum circuits
• Quantum variational optimization: The role of entanglement and problem hardness
• A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
• Parameters of Pseudo-Random Quantum Circuits
• Simulating noisy variational quantum eigensolver with local noise models
• Complementarity, distillable secret key, and distillable entanglement
• Minimizing state preparation times in pulse-level variational molecular simulations

Cited by in corpus (13)

• Pulse variational quantum eigensolver on cross-resonance based hardware
• A novel approach to noisy gates for simulating quantum computers
• PANSATZ: Pulse-based Ansatz for Variational Quantum Algorithms
• Pulse-efficient quantum machine learning
• Here comes the SU(N): multivariate quantum gates and gradients
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Robustness of Variational Quantum Algorithms against stochastic parameter perturbation
• Optimal realization of Yang-Baxter gate on quantum computers
• State preparation of lattice field theories using quantum optimal control
• Framework for Learning and Control in the Classical and Quantum Domains
• Minimal evolution times for fast, pulse-based state preparation in silicon spin qubits
• Crosstalk-Based Parameterized Quantum Circuit Approximation
• High-expressibility Quantum Neural Networks using only classical resources