Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers

Abstract

Combinatorial optimization on near-term quantum devices is a promising path to demonstrating quantum advantage. However, the capabilities of these devices are constrained by high noise or error rates. In this paper, we propose an iterative Layer VQE (L-VQE) approach, inspired by the Variational Quantum Eigensolver (VQE). We present a large-scale numerical study, simulating circuits with up to 40 qubits and 352 parameters, that demonstrates the potential of the proposed approach. We evaluate quantum optimization heuristics on the problem of detecting multiple communities in networks, for which we introduce a novel qubit-frugal formulation. We numerically compare L-VQE with Quantum Approximate Optimization Algorithm (QAOA) and demonstrate that QAOA achieves lower approximation ratios while requiring significantly deeper circuits. We show that L-VQE is more robust to finite sampling errors and has a higher chance of finding the solution as compared with standard VQE approaches. Our simulation results show that L-VQE performs well under realistic hardware noise.

References in corpus (24)

• Modularity and community structure in networks
• Variational Quantum Algorithms
• A Quantum Approximate Optimization Algorithm
• The power of quantum neural networks
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Layerwise learning for quantum neural networks
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Maximizing Modularity is hard
• Barren plateaus preclude learning scramblers
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Efficient quantum circuits for quantum computational chemistry
• Quantum Algorithms for Fixed Qubit Architectures
• Learning to learn with quantum neural networks via classical neural networks
• Classical symmetries and the Quantum Approximate Optimization Algorithm
• Adaptive pruning-based optimization of parameterized quantum circuits
• For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances
• Benchmarking adaptive variational quantum eigensolvers
• Abrupt Transitions in Variational Quantum Circuit Training
• Low depth mechanisms for quantum optimization
• Exploiting Symmetry Reduces the Cost of Training QAOA
• An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
• Modeling Linear Inequality Constraints in Quadratic Binary Optimization for Variational Quantum Eigensolver

Cited by in corpus (25)

• Quantum computing for finance
• Quantum agents in the Gym: a variational quantum algorithm for deep Q-learning
• Digitized-counterdiabatic quantum approximate optimization algorithm
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Quantum variational optimization: The role of entanglement and problem hardness
• Challenges of variational quantum optimization with measurement shot noise
• A semi-agnostic ansatz with variable structure for quantum machine learning
• Partitioning Dense Graphs with Hardware Accelerators
• Effective electromagnetic actions for Lorentz violating theories exhibiting the axial anomaly
• Improved variational quantum eigensolver via quasi-dynamical evolution
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• Estimating the randomness of quantum circuit ensembles up to 50 qubits
• Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization
• Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise
• Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
• Variational quantum simulation of long-range interacting systems
• Hierarchical Multigrid Ansatz for Variational Quantum Algorithms
• Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models
• Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice
• Efficient Sparse State Preparation via Quantum Walks
• Improving Parameter Training for VQEs by Sequential Hamiltonian Assembly
• Variational Quantum Algorithm Landscape Reconstruction by Low-Rank Tensor Completion
• Introducing Reduced-Width QNNs, an AI-inspired Ansatz Design Pattern