From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

Abstract

The next few years will be exciting as prototype universal quantum processors emerge, enabling implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation, and which have the potential to significantly expand the breadth of quantum computing applications. A leading candidate is Farhi et al.'s Quantum Approximate Optimization Algorithm, which alternates between applying a cost-function-based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between more general families of operators. The essence of this extension, the Quantum Alternating Operator Ansatz, is the consideration of general parametrized families of unitaries rather than only those corresponding to the time-evolution under a fixed local Hamiltonian for a time specified by the parameter. This ansatz supports the representation of a larger, and potentially more useful, set of states than the original formulation, with potential long-term impact on a broad array of application areas. For cases that call for mixing only within a desired subspace, refocusing on unitaries rather than Hamiltonians enables more efficiently implementable mixers than was possible in the original framework. Such mixers are particularly useful for optimization problems with hard constraints that must always be satisfied, defining a feasible subspace, and soft constraints whose violation we wish to minimize. More efficient implementation enables earlier experimental exploration of an alternating operator approach to a wide variety of approximate optimization, exact optimization, and sampling problems. Here, we introduce the Quantum Alternating Operator Ansatz, lay out design criteria for mixing operators, detail mappings for eight problems, and provide brief descriptions of mappings for diverse problems.

51 pages, 2 figures. Revised to match journal paper

References in corpus (31)

• Ising formulations of many NP problems
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Encoding a qubit in an oscillator
• Demonstration of a small programmable quantum computer with atomic qubits
• Quantum computing with atomic qubits and Rydberg interactions: Progress and challenges
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Average-case complexity versus approximate simulation of commuting quantum computations
• Computational Role of Multiqubit Tunneling in a Quantum Annealer
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• A case study in programming a quantum annealer for hard operational planning problems
• Quantum Encodings in Spin Systems and Harmonic Oscillators
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Quantum circuits for strongly correlated quantum systems
• Near-optimal quantum circuit for Grover's unstructured search using a transverse field
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• Practical optimization for hybrid quantum-classical algorithms
• A NASA Perspective on Quantum Computing: Opportunities and Challenges
• Quantum Annealing for Constrained Optimization
• Quantum Algorithms for Fixed Qubit Architectures
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Training A Quantum Optimizer
• A quantum algorithm to train neural networks using low-depth circuits
• Quantum approximate optimization is computationally universal
• Driver Hamiltonians for constrained optimization in quantum annealing
• A quantum walk assisted approximate algorithm for bounded NP optimisation problems
• A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
• Combinatorial Optimization on Gate Model Quantum Computers: A Survey

Cited by in corpus (371)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• A generative modeling approach for benchmarking and training shallow quantum circuits
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Layerwise learning for quantum neural networks
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Quantum computing for finance
• Warm-starting quantum optimization
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• The prospects of quantum computing in computational molecular biology
• Variational Quantum Linear Solver
• $XY$-mixers: analytical and numerical results for QAOA
• Expanding the horizon of automated metamaterials discovery via quantum annealing
• Challenges and Opportunities in Quantum Optimization
• Resource-Efficient Quantum Algorithm for Protein Folding
• Differentiable Quantum Architecture Search
• Group-Invariant Quantum Machine Learning
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Large gradients via correlation in random parameterized quantum circuits
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Variational Quantum State Eigensolver
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Variational Quantum algorithm for Poisson equation
• Filtering variational quantum algorithms for combinatorial optimization
• Benchmarking the Quantum Approximate Optimization Algorithm
• Deterministic Preparation of Dicke States
• Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
• Hybrid Quantum-Classical Generative Adversarial Network for High Resolution Image Generation
• Optimal Layout Synthesis for Quantum Computing
• Implementation of the XY interaction family with calibration of a single pulse
• Benchmarking the performance of portfolio optimization with QAOA
• Universal Variational Quantum Computation
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Neural Predictor based Quantum Architecture Search
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Biology and medicine in the landscape of quantum advantages
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
• Domain wall encoding of discrete variables for quantum annealing and QAOA
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms
• On the Universality of the Quantum Approximate Optimization Algorithm
• Classical variational simulation of the Quantum Approximate Optimization Algorithm
• Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation
• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Unified approach to data-driven quantum error mitigation
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
• Minimizing estimation runtime on noisy quantum computers
• Fast quantum circuit cutting with randomized measurements
• On the practical usefulness of the Hardware Efficient Ansatz
• Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
• Hamiltonian variational ansatz without barren plateaus
• Learning quantum data with the quantum Earth Mover's distance
• Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation
• Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization
• Variational preparation of finite-temperature states on a quantum computer
• 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
• QuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction
• Classical symmetries and the Quantum Approximate Optimization Algorithm
• Error mitigation for variational quantum algorithms through mid-circuit measurements
• Quantum Graph Neural Networks
• Quantum Circuit Cutting with Maximum Likelihood Tomography
• Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms
• Variationally Learning Grover's Quantum Search Algorithm
• Efficient encoding of the weighted MAX k-CUT on a quantum computer using QAOA
• Quantum Algorithms for Mixed Binary Optimization applied to Transaction Settlement
• Quantum walk-based portfolio optimisation
• Characterizing local noise in QAOA circuits
• The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
• Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
• Fast multi-qubit gates through simultaneous two-qubit gates
• Constrained mixers for the quantum approximate optimization algorithm
• Building spatial symmetries into parameterized quantum circuits for faster training
• QUARK: A Framework for Quantum Computing Application Benchmarking
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ansätze
• Graph neural network initialisation of quantum approximate optimisation
• Quantum unary approach to option pricing
• Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding
• A Divide-and-Conquer Approach to Dicke State Preparation
• Combinatorial optimisation via highly efficient quantum walks
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Low depth mechanisms for quantum optimization
• Prospects and challenges of quantum finance
• Measurement Error Mitigation for Variational Quantum Algorithms
• Progress toward favorable landscapes in quantum combinatorial optimization
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• Finding spin-glass ground states using quantum walks
• Short-Depth Circuits for Dicke State Preparation
• Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer
• Challenges of variational quantum optimization with measurement shot noise
• Constrained Optimization via Quantum Zeno Dynamics
• A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
• Parameter Setting in Quantum Approximate Optimization of Weighted Problems
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
• NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
• Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
• Exploiting Symmetry Reduces the Cost of Training QAOA
• Unifying and benchmarking state-of-the-art quantum error mitigation techniques
• Quantum Architecture Search with Meta-learning
• Quantum-Informed Recursive Optimization Algorithms
• Evaluation of QAOA based on the approximation ratio of individual samples
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Scaling Quantum Approximate Optimization on Near-term Hardware
• Quantum-Enhanced Greedy Combinatorial Optimization Solver
• Making Trotters Sprint: A Variational Imaginary Time Ansatz for Quantum Many-body Systems
• An entanglement perspective on the quantum approximate optimization algorithm
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• QAOA Performance in Noisy Devices: The Effect of Classical Optimizers and Ansatz Depth
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
• Optimal Qubit Mapping with Simultaneous Gate Absorption
• Quantum approximate optimization algorithm for qudit systems
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• A semi-agnostic ansatz with variable structure for quantum machine learning
• State preparation by shallow circuits using feed forward
• Quantum algorithms with local particle number conservation: noise effects and error correction
• Quantum Information Scrambling: From Holography to Quantum Simulators
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Policy Gradient based Quantum Approximate Optimization Algorithm
• Optimal quantum annealing: A variational shortcut to adiabaticity approach
• Applying quantum approximate optimization to the heterogeneous vehicle routing problem
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• Sampling on NISQ Devices: "Who's the Fairest One of All?"
• Hybrid quantum-classical optimization for financial index tracking
• Understanding domain-wall encoding theoretically and experimentally
• Analytical Framework for Quantum Alternating Operator Ansätze
• Shortcuts to adiabaticity: theoretical framework, relations between different methods, and versatile approximations
• Approximating the quantum approximate optimization algorithm with digital-analog interactions
• Pairwise tomography networks for many-body quantum systems
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries
• Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms
• Approaches to Constrained Quantum Approximate Optimization
• Quantifying the efficiency of state preparation via quantum variational eigensolvers
• Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem
• An evolving objective function for improved variational quantum optimisation
• Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization
• Error mitigation with Clifford quantum-circuit data
• Threshold-Based Quantum Optimization
• A native measurement-based QAOA algorithm, applied to the MAX K-CUT problem
• Provable bounds for noise-free expectation values computed from noisy samples
• Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver
• Modular Parity Quantum Approximate Optimization
• Mean-Field Approximate Optimization Algorithm
• Explaining Quantum Circuits with Shapley Values: Towards Explainable Quantum Machine Learning
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
• Optimizing Ansatz Design in QAOA for Max-cut
• An introduction to variational quantum algorithms for combinatorial optimization problems
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• Encoding-Independent Optimization Problem Formulation for Quantum Computing
• Quantum Error Mitigation Relying on Permutation Filtering
• Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors
• Fermionic Quantum Approximate Optimization Algorithm
• Solving optimization problems with local light shift encoding on Rydberg quantum annealers
• Quantum Optimization for Training Quantum Neural Networks
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Quantum algorithms for scientific computing
• Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization
• Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
• Knapsack Problem variants of QAOA for battery revenue optimisation
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• Parity Quantum Optimization: Benchmarks
• Quantum Local Search with the Quantum Alternating Operator Ansatz
• High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
• Avoiding local minima in Variational Quantum Algorithms with Neural Networks
• Qibolab: an open-source hybrid quantum operating system
• The Quantum Alternating Operator Ansatz for Satisfiability Problems
• Towards Finding an Optimal Flight Gate Assignment on a Digital Quantum Computer
• Deterministic spatial search using alternating quantum walks
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
• Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning
• Quantum Gaussian filter for exploring ground-state properties
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management
• QED driven QAOA for network-flow optimization
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• A Tutorial on Quantum Convolutional Neural Networks (QCNN)
• Improving the speed of variational quantum algorithms for quantum error correction
• Iterative Layerwise Training for Quantum Approximate Optimization Algorithm
• Quantum Alternating Operator Ansatz for Solving the Minimum Exact Cover Problem
• Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval
• Parity Quantum Optimization: Encoding Constraints
• Hybrid Auxiliary Field Quantum Monte Carlo for Molecular Systems
• Fair Sampling Error Analysis on NISQ Devices
• Scattering Amplitude from Quantum Computing with Reduction Formula
• A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz
• Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz
• Performance Analysis of Multi-Angle QAOA for p > 1
• Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
• Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes
• Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
• Hardware-Conscious Optimization of the Quantum Toffoli Gate
• Bounding the joint numerical range of Pauli strings by graph parameters
• Investigating Quantum Approximate Optimization Algorithms under Bang-bang Protocols
• Robustness to spontaneous emission of a variational quantum algorithm
• Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
• Expressivity of Variational Quantum Machine Learning on the Boolean Cube
• The battle of clean and dirty qubits in the era of partial error correction
• Initial State Encoding via Reverse Quantum Annealing and h-gain Features
• Experimental Quantum Learning of a Spectral Decomposition
• Elementary Proof of QAOA Convergence
• Convergence of Digitized-Counterdiabatic QAOA: circuit depth versus free parameters
• Resource analysis of quantum algorithms for coarse-grained protein folding models
• Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
• Realization of programmable Ising models in a trapped-ion quantum simulator
• Trainability Barriers in Low-Depth QAOA Landscapes
• QAOA-MC: Markov chain Monte Carlo enhanced by Quantum Alternating Operator Ansatz
• Low-depth Clifford circuits approximately solve MaxCut
• Recycling qubits in near-term quantum computers
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Polynomial Reduction Methods and their Impact on QAOA Circuits
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• Quantum Speedup of the Dispersion and Codebook Design Problems
• State preparation of AGP on a quantum computer without number projection
• Emergence of noise-induced barren plateaus in arbitrary layered noise models
• Calibration-Aware Transpilation for Variational Quantum Optimization
• JuliQAOA: Fast, Flexible QAOA Simulation
• Quantum approximate algorithm for NP optimization problems with constraints
• Towards Optimizations of Quantum Circuit Simulation for Solving Max-Cut Problems with QAOA
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Efficient preparation of Dicke states
• Implementing Jastrow--Gutzwiller operators on a quantum computer using the cascaded variational quantum eigensolver algorithm
• Finding Optimal Pathways in Chemical Reaction Networks Using Ising Machines
• Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems
• Qudit-inspired optimization for graph coloring
• Ion native variational ansatz for quantum approximate optimization
• Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
• Efficient variational quantum circuit structure for correlated topological phases
• Towards Efficient Ansatz Architecture for Variational Quantum Algorithms
• Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
• Graph Cut Segmentation Methods Revisited with a Quantum Algorithm
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
• Planning for Compilation of a Quantum Algorithm for Graph Coloring
• Amplitude Amplification for Optimization via Subdivided Phase Oracle
• Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
• Parametrized quantum circuit for weight-adjustable quantum loop gas
• Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate
• Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
• A quantum algorithm for solving 0-1 Knapsack problems
• Quantum technologies for climate change: Preliminary assessment
• Analytical results for the Quantum Alternating Operator Ansatz with Grover Mixer
• Efficient Encodings of the Travelling Salesperson Problem for Variational Quantum Algorithms
• Photonic counterdiabatic quantum optimization algorithm
• On Optimizing Hyperparameters for Quantum Neural Networks
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement
• Quantum optimization with linear Ising penalty functions for customer data science
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
• Modelling noise in global Molmer-Sorensen interactions applied to quantum approximate optimization
• Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions
• Optimized QUBO formulation methods for quantum computing
• Quantum Approximate Optimization Algorithm with Sparsified Phase Operator
• Diagrammatic Analysis for Parameterized Quantum Circuits
• Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing
• A variational quantum algorithm for tackling multi-dimensional Poisson equations with inhomogeneous boundary conditions
• Engineering the Cost Function of a Variational Quantum Algorithm for Implementation on Near-Term Devices
• Benchmarking hybrid digitized-counterdiabatic quantum optimization
• Classical Quantum Optimization with Neural Network Quantum States
• Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
• Toward a standardized methodology for constructing quantum computing use cases
• Variational quantum simulation of critical Ising model with symmetry averaging
• Iteration Complexity of Variational Quantum Algorithms
• All you need is spin: SU(2) equivariant variational quantum circuits based on spin networks
• Efficient Quantum Circuits based on the Quantum Natural Gradient
• A framework for optimal quantum spatial search using alternating phase-walks
• Flexible constraint compilation in the parity architecture
• Compressed space quantum approximate optimization algorithm for constrained combinatorial optimization
• Comparison of encoding schemes for quantum computing of $S>1/2$ spin chains
• Constant Depth Code Deformations in the Parity Architecture
• Matrix product state ansatz for the variational quantum solution of the Heisenberg model on Kagome geometries
• Machine-Learning Insights into the Entanglement-trainability Correlation of Parameterized Quantum Circuits
• QFCNN: Quantum Fourier Convolutional Neural Network
• LX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism
• A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
• Sketching the Best Approximate Quantum Compiling Problem
• Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization
• SWAP-less Implementation of Quantum Algorithms
• A proposal of noise suppression for quantum annealing
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• Quantum Integer Programming (QuIP) 47-779: Lecture Notes
• Scalable Parity Architecture With a Shuttling-Based Spin Qubit Processor
• Sampling Problems on a Quantum Computer
• Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation
• Mapping State Transition Susceptibility in Quantum Annealing
• Multidimensional Quantum Generative Modeling by Quantum Hartley Transform
• Optimization via Quantum Preconditioning
• QuOp_MPI: a framework for parallel simulation of quantum variational algorithms
• Inequality constraints in variational quantum circuits with qudits
• Choco-Q: Commute Hamiltonian-based QAOA for Constrained Binary Optimization
• Learning Fourier series with parametrized quantum circuits
• Posiform Planting: Generating QUBO Instances for Benchmarking
• HybridQ: A Hybrid Simulator for Quantum Circuits
• Charged particle reconstruction for future high energy colliders with Quantum Approximate Optimization Algorithm
• Experimental Demonstration of Fermionic QAOA with One-Dimensional Cyclic Driver Hamiltonian
• A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack
• Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding
• Learning Density Functionals from Noisy Quantum Data
• Locating quantum critical points with shallow quantum circuits
• End-to-End Protocol for High-Quality QAOA Parameters with Few Shots
• Evolved Quantum Boltzmann Machines
• Performance of Domain-Wall Encoding for Quantum Annealing
• Adiabatic quantum computing with parameterized quantum circuits
• Heuristic Time Complexity of NISQ Shortest-Vector-Problem Solvers
• IF-QAOA: A Penalty-Free Approach to Accelerating Constrained Quantum Optimization
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Constraint-Aware Quantum Optimization via Hamming Weight Operators
• Folding lattice proteins confined on minimal grids using a quantum-inspired encoding
• Quantum Approximation for Wireless Scheduling
• The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion
• Normalized Gradient Descent for Variational Quantum Algorithms
• Accelerating variational quantum algorithms with multiple quantum processors
• Quantum Scheduling for Millimeter-Wave Observation Satellite Constellation
• Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Quantum Data Loading
• Biased Degenerate Ground-State Sampling of Small Ising Models with Converged QAOA
• Quantum neural network autoencoder and classifier applied to an industrial case study
• Quantum-Assisted Graph Clustering and Quadratic Unconstrained D-ary Optimisation
• Differentiable Architecture Search for Adversarially Robust Quantum Computer Vision
• Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
• Applying the Quantum Alternating Operator Ansatz to the Graph Matching Problem
• Efficient Large-Scale Quantum Optimization via Counterdiabatic Ansatz
• Quick design of feasible tensor networks for constrained combinatorial optimization
• Dual Map Framework for Noise Characterization of Quantum Computers
• Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
• Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles
• Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming
• Freedom of mixer rotation-axis improves performance in the quantum approximate optimization algorithm
• QTIS: A QAOA-Based Quantum Time Interval Scheduler
• Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm
• A Cyclic Layerwise QAOA Training
• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
• Quantum natural gradient with thermal-state initialization
• Subsampling Factorization Machine Annealing
• QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers
• Non-Markovian Noise in Symmetry-Preserving Quantum Dynamics
• Investigating layer-selective transfer learning of QAOA parameters for Max-Cut problem
• Analog Quantum Approximate Optimization Algorithm
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
• Structural encoding with classical codes for computational-basis bit-flip correction in the early fault-tolerant regime
• Quantum approximate optimization of finite-state bosonic systems
• Finding the optimal Nash equilibrium in a discrete Rosenthal congestion game using the Quantum Alternating Operator Ansatz
• Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers
• Variational Quantum Algorithm for Constrained Combinatorial Optimization Problems
• Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems
• Quantum Computation
• Gaussian Amplitude Amplification for Quantum Pathfinding
• Electric Power Demand Portfolio Optimization by Fermionic QAOA with Self-Consistent Local Field Modulation
• Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits
• Universal Euler-Cartan Circuits for Quantum Field Theories
• Quantum Alternating Operator Ansatz for the Preparation and Detection of Long-Lived Singlet States in NMR
• Quantum Simulation-Based Optimization for Cooling System Design
• Counting with the quantum alternating operator ansatz
• On Assessing the Quantum Advantage for MaxCut Provided by Quantum Neural Network Ansätze
• Approaching graph problems with continuous variable quantum computing
• A Quantum Constraint Generation Framework for Binary Linear Programs
• A quantum search method for quadratic and multidimensional knapsack problems
• From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
• Interference and Measurement: Changing amplitude phase information to amplitude magnitude information
• Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
• Variational quantum simulation of the quantum critical regime
• Encodings of the weighted MAX k-CUT on qubit systems
• Introducing Reduced-Width QNNs, an AI-inspired Ansatz Design Pattern