Symmetry-enhanced Counterdiabatic Quantum Algorithm for Qudits

Abstract

Qubit-based variational quantum algorithms have undergone rapid development in recent years but still face several challenges. In this context, we propose a symmetry-enhanced digitized counterdiabatic quantum algorithm utilizing qudits instead of qubits. This approach offers three types of compression as compared to with respect to conventional variational circuits. First, compression in the circuit depth is achieved by counterdiabatic protocols. Second, information about the problem is compressed by replacing qubits with qudits, allowing for a more efficient representation of the problem. Lastly, the number of parameters is reduced by employing the symmetries of the system. We illustrate this approach by tackling a graph-based optimization problem Max-3-Cut and a highly-entangled state preparation, the qutrit W state. As our numerical results show, we achieve a better convergence with a lower circuit depth and less measurement overhead in all the cases considered. This work leads to a better design of shallow variational quantum circuits, improving the feasibility of their implementation on near-term qudit devices

References in corpus (36)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Variational Quantum Algorithms
• Quantum computational advantage using photons
• Noisy intermediate-scale quantum (NISQ) algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Shortcut to adiabatic passage in two and three level atoms
• Shortcuts to adiabaticity by counter-diabatic driving
• Qudits and high-dimensional quantum computing
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• A universal qudit quantum processor with trapped ions
• The Future of Quantum Computing with Superconducting Qubits
• Minimizing irreversible losses in quantum systems by local counter-diabatic driving
• Floquet-engineering counterdiabatic protocols in quantum many-body systems
• A Strictly Single-Site DMRG Algorithm with Subspace Expansion
• Large gradients via correlation in random parameterized quantum circuits
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Quantum advantage with noisy shallow circuits in 3D
• Hardware efficient quantum simulation of non-abelian gauge theories with qudits on Rydberg platforms
• Beyond-classical computation in quantum simulation
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Symmetry Principles in Quantum Systems Theory
• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
• Universal qudit gate synthesis for transmons
• House of Graphs 2.0: a database of interesting graphs and more
• Building spatial symmetries into parameterized quantum circuits for faster training
• Shortcuts to Adiabaticity in Krylov Space
• Mitigation of frequency collisions in superconducting quantum processors
• Quantum approximate optimization algorithm for qudit systems
• Variational quantum simulation of U(1) lattice gauge theories with qudit systems
• Optimizing Counterdiabaticity by Variational Quantum Circuits
• On the role of entanglement in qudit-based circuit compression
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization