Ancillary entangling Floquet kicks for accelerating quantum algorithms
arXiv:2408.13345 · doi:10.1103/PhysRevA.111.L010401
Abstract
Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and thus places an annealing rate bottleneck for high success probability. Here, we accelerate quantum simulation using digital multi-qubit gates that entangle primary system qubits with the ancillary qubits. The practical benefits originate from tuning the ancillary gauge degrees of freedom to enhance the quantum algorithm's original functionality in the system subspace. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent but with higher accuracy through exact state-vector numerical simulation in a digital-analog setting. The findings are further supported by time-averaged Hamiltonian theory.
References in corpus (32)
- Quantum Computing in the NISQ era and beyond
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- The Magnus expansion and some of its applications
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Logical quantum processor based on reconfigurable atom arrays
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Fermionic quantum computation
- Scalable Quantum Simulation of Molecular Energies
- Quantum Annealing and Analog Quantum Computation
- Quantum Simulators: Architectures and Opportunities
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Hybrid quantum-classical algorithms and quantum error mitigation
- Emergence and Frustration of Magnetic Order with Variable-Range Interactions in a Trapped Ion Quantum Simulator
- Training variational quantum algorithms is NP-hard
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Quantum critical dynamics in a 5000-qubit programmable spin glass
- Floquet-engineering counterdiabatic protocols in quantum many-body systems
- Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor
- Counterdiabaticity and the quantum approximate optimization algorithm
- Universal Variational Quantum Computation
- Towards adiabatic quantum computing using compressed quantum circuits
- Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
- Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
- Continuous Symmetry Breaking in a Trapped-Ion Spin Chain
- Completely Quantum Neural Networks
- Variational circuit compiler for quantum error correction
- The Quantum Transition of the Two-Dimensional Ising Spin Glass: A Tale of Two Gaps
- Digital-Analog Quantum Simulations Using The Cross-Resonance Effect
- Encoding-Independent Optimization Problem Formulation for Quantum Computing
- Magnus expansion for a chirped quantum two-level system
- Characterizing and mitigating coherent errors in a trapped ion quantum processor using hidden inverses