Filtering variational quantum algorithms for combinatorial optimization

Abstract

Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the Filtering Variational Quantum Eigensolver (F-VQE) which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. Additionally we explore the use of causal cones to reduce the number of qubits required on a quantum computer. Using random weighted MaxCut problems, we numerically analyze our methods and show that they perform better than the original VQE algorithm and the Quantum Approximate Optimization Algorithm (QAOA). We also demonstrate the experimental feasibility of our algorithms on a Honeywell trapped-ion quantum processor.

arXiv comment14 pages, 9 figures, 2 tables, accepted version

References in corpus (47)

• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Ising formulations of many NP problems
• Quantum Annealing in the Transverse Ising Model
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum Circuit Learning
• Parameterized quantum circuits as machine learning models
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• The Kernel Polynomial Method
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• A class of quantum many-body states that can be efficiently simulated
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Towards Practical Quantum Variational Algorithms
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Quantum optimization using variational algorithms on near-term quantum devices
• Demonstration of the trapped-ion quantum-CCD computer architecture
• Quantum autoencoders for efficient compression of quantum data
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Layerwise learning for quantum neural networks
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Improving Variational Quantum Optimization using CVaR
• Stochastic gradient descent for hybrid quantum-classical optimization
• Structure optimization for parameterized quantum circuits
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Hardware-efficient variational quantum algorithms for time evolution
• Estimating the gradient and higher-order derivatives on quantum hardware
• Algorithms for quantum simulation at finite energies
• Holographic quantum algorithms for simulating correlated spin systems
• Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations
• Quantum Singular Value Decomposer
• Scaling of variational quantum circuit depth for condensed matter systems
• Quantum inverse iteration algorithm for programmable quantum simulators
• Noise-Assisted Quantum Autoencoder
• Quantum variational optimization: The role of entanglement and problem hardness
• Multigrid Renormalization
• To quantum or not to quantum: towards algorithm selection in near-term quantum optimization
• Hessian-based optimization of constrained quantum control
• Probing thermalization through spectral analysis with matrix product operators
• How much entanglement is needed to reduce the energy variance?
• Hybrid quantum-classical optimization for financial index tracking
• Addressing hard classical problems with Adiabatically Assisted Variational Quantum Eigensolvers
• Generalized Householder Transformations for the Complex Symmetric Eigenvalue Problem
• Systematic construction of density functionals based on matrix product state computations
• Approximating the long time average of the density operator: Diagonal ensemble

Cited by in corpus (24)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• A case study of variational quantum algorithms for a job shop scheduling problem
• Barren plateaus in quantum tensor network optimization
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Graph neural network initialisation of quantum approximate optimisation
• Error propagation in NISQ devices for solving classical optimization problems
• Variational quantum amplitude estimation
• NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
• An entanglement perspective on the quantum approximate optimization algorithm
• Protecting Expressive Circuits with a Quantum Error Detection Code
• Quantum Approximate Optimization Algorithm pseudo-Boltzmann states
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems
• Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection
• An introduction to variational quantum algorithms for combinatorial optimization problems
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation
• Quantum Dropout: On and Over the Hardness of Quantum Approximate Optimization Algorithm
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
• Quantum Gaussian filter for exploring ground-state properties
• Simulating time evolution on distributed quantum computers
• Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits
• Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions
• Accelerating variational quantum algorithms with multiple quantum processors