Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices

Abstract

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems. Despite its promise for near-term quantum applications, not much is currently understood about QAOA's performance beyond its lowest-depth variant. An essential but missing ingredient for understanding and deploying QAOA is a constructive approach to carry out the outer-loop classical optimization. We provide an in-depth study of the performance of QAOA on MaxCut problems by developing an efficient parameter-optimization procedure and revealing its ability to exploit non-adiabatic operations. Building on observed patterns in optimal parameters, we propose heuristic strategies for initializing optimizations to find quasi-optimal $p$-level QAOA parameters in $O(\text{poly}(p))$ time, whereas the standard strategy of random initialization requires $2^{O(p)}$ optimization runs to achieve similar performance. We then benchmark QAOA and compare it with quantum annealing, especially on difficult instances where adiabatic quantum annealing fails due to small spectral gaps. The comparison reveals that QAOA can learn via optimization to utilize non-adiabatic mechanisms to circumvent the challenges associated with vanishing spectral gaps. Finally, we provide a realistic resource analysis on the experimental implementation of QAOA. When quantum fluctuations in measurements are accounted for, we illustrate that optimization will be important only for problem sizes beyond numerical simulations, but accessible on near-term devices. We propose a feasible implementation of large MaxCut problems with a few hundred vertices in a system of 2D neutral atoms, reaching the regime to challenge the best classical algorithms.

arXiv comment13+10 pages, 15 figures

References in corpus (32)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum information with Rydberg atoms
• Probing many-body dynamics on a 51-atom quantum simulator
• Quantum Annealing in the Transverse Ising Model
• Barren plateaus in quantum neural network training landscapes
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computing
• Quantum computing with trapped ions
• Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
• Quantum annealing with more than one hundred qubits
• Demonstration of a small programmable quantum computer with atomic qubits
• Realizing quantum Ising models in tunable two-dimensional arrays of single Rydberg atoms
• Quantum optimization using variational algorithms on near-term quantum devices
• Defining and detecting quantum speedup
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
• Quantum Kibble-Zurek mechanism and critical dynamics on a programmable Rydberg simulator
• Digitized adiabatic quantum computing with a superconducting circuit
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• High-fidelity control and entanglement of Rydberg atom qubits
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
• Reinforcement Learning in Different Phases of Quantum Control
• An omniscient Maxwell's demon
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Near-optimal quantum circuit for Grover's unstructured search using a transverse field
• Efficient variational simulation of non-trivial quantum states
• Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
• Training A Quantum Optimizer
• Tunneling and speedup in quantum optimization for permutation-symmetric problems

Cited by in corpus (284)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• A Race Track Trapped-Ion Quantum Processor
• Quantum simulation and computing with Rydberg-interacting qubits
• General parameter-shift rules for quantum gradients
• Warm-starting quantum optimization
• The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• Stochastic gradient descent for hybrid quantum-classical optimization
• Variational Quantum Linear Solver
• A concise review of Rydberg atom based quantum computation and quantum simulation
• Differentiable Quantum Architecture Search
• Quantum annealing initialization of the quantum approximate optimization algorithm
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Computational advantage of quantum random sampling
• Exponential Error Suppression for Near-Term Quantum Devices
• Quantum Algorithm Implementations for Beginners
• Variational Quantum algorithm for Poisson equation
• Filtering variational quantum algorithms for combinatorial optimization
• Optimal Protocols in Quantum Annealing and QAOA Problems
• Parameter Concentration in Quantum Approximate Optimization
• Counterdiabaticity and the quantum approximate optimization algorithm
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• MAXCUT QAOA performance guarantees for p >1
• Quantum Variational Optimization of Ramsey Interferometry and Atomic Clocks
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
• Evaluating the noise resilience of variational quantum algorithms
• A case study of variational quantum algorithms for a job shop scheduling problem
• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
• Barren plateaus in quantum tensor network optimization
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• NISQ Computers: A Path to Quantum Supremacy
• Reinforcement Learning assisted Quantum Optimization
• Learning quantum data with the quantum Earth Mover's distance
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Quantum Technologies in the Telecommunications Industry
• Pulser: An open-source package for the design of pulse sequences in programmable neutral-atom arrays
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• On the statistical complexity of quantum circuits
• Efficient encoding of the weighted MAX k-CUT on a quantum computer using QAOA
• Quantum Algorithms for Mixed Binary Optimization applied to Transaction Settlement
• $N$-body interactions between trapped ion qubits via spin-dependent squeezing
• Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
• The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
• Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Markovian Quantum Neuroevolution for Machine Learning
• Graph neural network initialisation of quantum approximate optimisation
• Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
• Error propagation in NISQ devices for solving classical optimization problems
• Training Saturation in Layerwise Quantum Approximate Optimisation
• Programmable Quantum Annealing Architectures with Ising Quantum Wires
• Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach
• Quantum optimization via four-body Rydberg gates
• Low depth mechanisms for quantum optimization
• Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
• Challenges of variational quantum optimization with measurement shot noise
• Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs
• Qubit-efficient encoding schemes for binary optimisation problems
• Expectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems
• Parameter Setting in Quantum Approximate Optimization of Weighted Problems
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• 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
• NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
• An entanglement perspective on the quantum approximate optimization algorithm
• Training Gaussian Boson Sampling Distributions
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• Analysis of The Vehicle Routing Problem Solved via Hybrid Quantum Algorithms in Presence of Noisy Channels
• Predicting toxicity by quantum machine learning
• Two-dimensional ${\mathbb{Z}}_2$ lattice gauge theory on a near-term quantum simulator: variational quantum optimization, confinement, and topological order
• QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
• Probing many-body localization by excited-state VQE
• Quantum approximate optimization algorithm for qudit systems
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
• Quantum algorithms with local particle number conservation: noise effects and error correction
• Number Partitioning with Grover's Algorithm in Central Spin Systems
• Parameters Fixing Strategy for Quantum Approximate Optimization Algorithm
• Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups
• Self-healing of Trotter error in digital adiabatic state preparation
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• Nonlinear dynamics and quantum chaos of a family of kicked $p$-spin models
• Analytical Framework for Quantum Alternating Operator Ansätze
• Shortcuts to adiabaticity: theoretical framework, relations between different methods, and versatile approximations
• Probing Geometric Excitations of Fractional Quantum Hall States on Quantum Computers
• Quantifying the efficiency of state preparation via quantum variational eigensolvers
• An evolving objective function for improved variational quantum optimisation
• On Circuit Depth Scaling For Quantum Approximate Optimization
• Training variational quantum algorithms with random gate activation
• Demonstration of weighted graph optimization on a Rydberg atom array using local light-shifts
• Threshold-Based Quantum Optimization
• Modular Parity Quantum Approximate Optimization
• Efficient Generation of Spin Cat States
• Calibrating the role of entanglement in variational quantum circuits
• Ultrastrong tunable coupler between superconducting LC resonators
• Shortcuts to Quantum Approximate Optimization Algorithm
• Mean-Field Approximate Optimization Algorithm
• Lie-algebraic classical simulations for quantum computing
• Stochastic noise can be helpful for variational quantum algorithms
• Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
• Quantum Dropout: On and Over the Hardness of Quantum Approximate Optimization Algorithm
• Extending relax-and-round combinatorial optimization solvers with quantum correlations
• Mitigating algorithmic errors in quantum optimization through energy extrapolation
• A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
• Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
• Quantum algorithms for scientific computing
• Parity Quantum Optimization: Benchmarks
• Quantum Optimization Methods for Satellite Mission Planning
• Improved variational quantum eigensolver via quasi-dynamical evolution
• High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
• Transfer learning of optimal QAOA parameters in combinatorial optimization
• Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations
• 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
• Quantum Annealing with Trigger Hamiltonians: Application to 2-SAT and Nonstoquastic Problems
• Diabatic Quantum Annealing for the Frustrated Ring Model
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
• Thermal variational quantum simulation on a superconducting quantum processor
• Success of digital adiabatic simulation with large Trotter step
• Continuous-variable quantum approximate optimization on a programmable photonic quantum processor
• Universal Quantum Optimization with Cold Atoms in an Optical Cavity
• Iterative Layerwise Training for Quantum Approximate Optimization Algorithm
• Computationally Efficient Quantum Expectation with Extended Bell Measurements
• Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits
• Effects of Cosine Tapering Window on Quantum Phase Estimation
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval
• Minimal Constraints in the Parity Formulation of Optimization Problems
• Guided quantum walk
• Performance Analysis of Multi-Angle QAOA for p > 1
• Solving The Vehicle Routing Problem via Quantum Support Vector Machines
• A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz
• Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
• Quantum Approximate Optimization Algorithm Parameter Prediction Using a Convolutional Neural Network
• Automatic Depth Optimization for Quantum Approximate Optimization Algorithm
• Solving the max-3-cut problem using synchronized dissipative networks
• Multi-Objective Optimization and Network Routing with Near-Term Quantum Computers
• Convergence of Digitized-Counterdiabatic QAOA: circuit depth versus free parameters
• Continuous-time quantum walks for MAX-CUT are hot
• Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
• Transit facility allocation: Hybrid quantum-classical optimization
• Symmetry-informed transferability of optimal parameters in the Quantum Approximate Optimization Algorithm
• Robust optimization for quantum reinforcement learning control using partial observations
• Robustness of Variational Quantum Algorithms against stochastic parameter perturbation
• Measurement-induced entanglement phase transitions in variational quantum circuits
• Instance Independence of Single Layer Quantum Approximate Optimization Algorithm on Mixed-Spin Models at Infinite Size
• Low-depth Clifford circuits approximately solve MaxCut
• Realization of programmable Ising models in a trapped-ion quantum simulator
• QAOA with $N\cdot p\ge 200$
• Calibration-Aware Transpilation for Variational Quantum Optimization
• Certificates of quantum many-body properties assisted by machine learning
• Stochastic approach for quantum metrology with generic Hamiltonians
• Emergence of noise-induced barren plateaus in arbitrary layered noise models
• Efficient and Robust Parameter Optimization of the Unitary Coupled-Cluster Ansatz
• Towards Optimizations of Quantum Circuit Simulation for Solving Max-Cut Problems with QAOA
• Evaluating the Resilience of Variational Quantum Algorithms to Leakage Noise
• Virtual distillation with noise dilution
• Computing Graph Edit Distance with Algorithms on Quantum Devices
• Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry
• Forbidden subspaces for level-1 QAOA and IQP circuits
• Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
• Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems
• Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
• Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
• Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection in Massive MIMO
• Parameter-Parallel Distributed Variational Quantum Algorithm
• A Universal Quantum Circuit Design for Periodical Functions
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
• Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
• Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
• Optimized QUBO formulation methods for quantum computing
• Modelling noise in global Molmer-Sorensen interactions applied to quantum approximate optimization
• Quantum Natural Gradient optimizer on noisy platforms: QAOA as a case study
• Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
• Quantum Approximate Optimization Algorithm with Sparsified Phase Operator
• Maximising Quantum-Computing Expressive Power through Randomised Circuits
• Quantum approximate optimization algorithm with random and subgraph phase operators
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Experimental pairwise entanglement estimation for an N-qubit system :A machine learning approach for programming quantum hardware
• Quantum circuit compilation with quantum computers
• Red-QAOA: Efficient Variational Optimization through Circuit Reduction
• From quantum-enhanced to quantum-inspired Monte Carlo
• Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe
• Quantum Relaxation for Solving Multiple Knapsack Problems
• Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles
• Universal quantum processors in spin systems via robust local pulse sequences
• Machine-Learning Insights into the Entanglement-trainability Correlation of Parameterized Quantum Circuits
• Quantum Algorithm for Estimating Betti Numbers Using Cohomology Approach
• Energy Landscape Plummeting in Variational Quantum Eigensolver: Subspace Optimization, Non-iterative Corrections and Generator-informed Initialization for Improved Quantum Efficiency
• Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation
• A framework for optimal quantum spatial search using alternating phase-walks
• Compressed space quantum approximate optimization algorithm for constrained combinatorial optimization
• Warm Start Adaptive-Bias Quantum Approximate Optimization Algorithm
• QCEDA: Using Quantum Computers for EDA
• Information scrambling and entanglement in quantum approximate optimization algorithm circuits
• Sketching the Best Approximate Quantum Compiling Problem
• Quantifying Grover speed-ups beyond asymptotic analysis
• Computational complexity of three-dimensional Ising spin glass: Lessons from D-Wave annealer
• Optimization via Quantum Preconditioning
• Advancing Hybrid Quantum-Classical Algorithms via Mean-Operators
• Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications
• Universal Resources for QAOA and Quantum Annealing
• Probing many-body Bell correlation depth with superconducting qubits
• Optimized numerical gradient and Hessian estimation for variational quantum algorithms
• Charged particle reconstruction for future high energy colliders with Quantum Approximate Optimization Algorithm
• Diabatic quantum and classical annealing of the Sherrington-Kirkpatrick model
• Spontaneous symmetry breaking in a $SO(3)$ non-Abelian lattice gauge theory in $2+1$D with quantum algorithms
• Harnessing Quantum Computing for Energy Materials: Opportunities and Challenges
• Approximating maximum independent set on Rydberg atom arrays using local detunings
• Depth scaling of unstructured search via quantum approximate optimization
• Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation
• A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack
• Deep Unfolded Local Quantum Annealing
• One-step implementation of nonadiabatic geometric fSim gate in superconducting circuits
• Single-shot quantum measurements sketch quantum many-body states
• The Overlap Gap Property limits limit swapping in the QAOA
• Generation of quantum phases of matter and finding a maximum-weight independent set of unit-disk graphs using Rydberg atoms
• Fighting Exponentially Small Gaps by Counterdiabatic Driving
• Generalized Probabilistic Approximate Optimization Algorithm
• Extrapolation method to optimize linear-ramp QAOA parameters: Evaluation of QAOA runtime scaling
• On the Effects of Small Graph Perturbations in the MaxCut Problem by QAOA
• Escaping Local Minima with Quantum Coherent Cooling
• Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Quantum Data Loading
• IF-QAOA: A Penalty-Free Approach to Accelerating Constrained Quantum Optimization
• Systematic and Efficient Construction of Quadratic Unconstrained Binary Optimization Forms for High-order and Dense Interactions
• Superconducting Qubit Readout Using Next-Generation Reservoir Computing
• Efficient Large-Scale Quantum Optimization via Counterdiabatic Ansatz
• Dual Map Framework for Noise Characterization of Quantum Computers
• Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm
• Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
• The Perturbed Ferromagnetic Chain: A Tuneable Test of Quantum Hardness in the Transverse-Field Ising Model
• Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming
• Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization
• Experimental factoring integers using fixed-point-QAOA with a trapped-ion quantum processor
• Compressed sensing enhanced by quantum approximate optimization algorithm
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• Efficient measurement of neutral-atom qubits with matched filters
• Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem
• Graph Coloring via Quantum Optimization on a Rydberg-Qudit Atom Array
• Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
• Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem
• Exploiting many-body localization for scalable variational quantum simulation
• Signatures of quantum chaos and complexity in the Ising model on random graphs
• Continuous-wave quantum light control via engineered Rydberg-induced dephasing
• Continuous-wave all-optical single-photon transistor based on a Rydberg-atom ensemble
• The Quantum Approximate Optimization Algorithm Can Require Exponential Time to Optimize Linear Functions
• Robustness of optimized numerical estimation schemes for noisy variational quantum algorithms
• Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems
• Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems
• Extended parameter shift rules with minimal derivative variance for parameterized quantum circuits
• Pangenome-guided sequence assembly via binary optimisation
• Quantum-inspired search method for low-energy states of classical Ising Hamiltonians
• Inference of maximum parsimony phylogenetic trees with model-based classical and quantum methods
• Qubit-efficient quantum combinatorial optimization solver
• Role of overparametrization in quantum approximate optimization
• Decoded Quantum Interferometry Under Noise
• Evidence for effectively constant shot complexity in the quantum approximate optimization algorithm without per-instance optimization
• Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut
• Digital controllability of transverse field Ising chains
• Resource-Efficient Quantum Optimization via Higher-Order Encoding
• Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems
• Variational matrix product states for combinatorial optimization
• Adiabatic Dynamics of Entanglement
• Quantum imaginary time evolution and UD-MIS problem
• Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers
• Distributed variational quantum computing with deterministic entanglement tuning
• Robust composite two-qubit gates for silicon-based spin qubits
• Investigating layer-selective transfer learning of QAOA parameters for Max-Cut problem
• Encodings of the weighted MAX k-CUT on qubit systems
• Hidden local adiabatic ramp in the modulated time evolution and the quantum approximate optimization algorithm
• A New Scaling Function for QAOA Tensor Network Simulations
• Variational Quantum Algorithm for Solving the Liouvillian Gap
• Optimization of Quantum Systems Emulation via a Variant of the Bandwidth Minimization Problem
• Quantum community detection via deterministic elimination
• Topological and geometric patterns in optimal bang-bang protocols for variational quantum algorithms: application to the $XXZ$ model on the square lattice
• Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA
• Quantum Alternating Operator Ansatz for the Preparation and Detection of Long-Lived Singlet States in NMR