High-Round QAOA for MAX k-SAT on Trapped Ion NISQ Devices

06/05/2023
by   Elijah Pelofske, et al.
0

The Quantum Alternating Operator Ansatz (QAOA) is a hybrid classical-quantum algorithm that aims to sample the optimal solution(s) of discrete combinatorial optimization problems. We present optimized QAOA circuit constructions for sampling MAX k-SAT problems, specifically for k=3 and k=4. The novel 4-SAT QAOA circuit construction we present uses measurement based uncomputation, followed by classical feed forward conditional operations. The QAOA circuit parameters for 3-SAT are optimized via exact classical (noise-free) simulation, using HPC resources to simulate up to 20 rounds on 10 qubits. In order to explore the limits of current NISQ devices we execute these optimized QAOA circuits for random 3-SAT test instances with clause-to-variable ratio 4 on four trapped ion quantum computers: Quantinuum H1-1 (20 qubits), IonQ Harmony (11 qubits), IonQ Aria 1 (25 qubits), and IonQ Forte (30 qubits). The QAOA circuits that are executed include n=10 up to p=20, and n=22 for p=1 and p=2. The high round circuits use upwards of 9,000 individual gate instructions, making these some of the largest QAOA circuits executed on NISQ devices. Our main finding is that current NISQ devices perform best at low round counts (i.e., p = 1,…, 5) and then – as expected due to noise – gradually start returning satisfiability truth assignments that are no better than randomly picked solutions as the number of QAOA rounds are further increased.

READ FULL TEXT
research
03/01/2022

Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond

Satisfiability Testing (SAT) techniques are well-established in classica...
research
08/29/2023

Probing Quantum Telecloning on Superconducting Quantum Processors

Quantum information can not be perfectly cloned, but approximate copies ...
research
01/02/2023

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers

Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) ar...
research
01/26/2023

The Quantum Alternating Operator Ansatz for Satisfiability Problems

We comparatively study, through large-scale numerical simulation, the pe...
research
02/10/2021

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

Combinatorial optimization on near-term quantum devices is a promising p...
research
01/08/2021

QAOA-based Fair Sampling on NISQ Devices

We study the status of fair sampling on Noisy Intermediate Scale Quantum...
research
12/31/2019

Efficient classical simulation of random shallow 2D quantum circuits

Random quantum circuits are commonly viewed as hard to simulate classica...

Please sign up or login with your details

Forgot password? Click here to reset