Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
arXiv:2302.01792 · doi:10.1088/2058-9565/acf59c
Abstract
Noisy Intermediate-Scale Quantum (NISQ) devices are restricted by their limited number of qubits and their short decoherence times. An approach addressing these problems is quantum circuit cutting. It decomposes the execution of a large quantum circuit into the execution of multiple smaller quantum circuits with additional classical postprocessing. Since these smaller quantum circuits require fewer qubits and gates, they are more suitable for NISQ devices. To investigate the effect of quantum circuit cutting in a quantum algorithm targeting NISQ devices, we design two experiments using the Quantum Approximate Optimization Algorithm (QAOA) for the Maximum Cut (MaxCut) problem and conduct them on state-of-the-art superconducting devices. Our first experiment studies the influence of circuit cutting on the objective function of QAOA, and the second evaluates the quality of results obtained by the whole algorithm with circuit cutting. The results show that circuit cutting can reduce the effects of noise in QAOA, and therefore, the algorithm yields better solutions on NISQ devices.
References in corpus (45)
- Quantum Computing in the NISQ era and beyond
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- Quantum Teleportation is a Universal Computational Primitive
- A Quantum Approximate Optimization Algorithm
- Quantum Chemistry in the Age of Quantum Computing
- Error mitigation for short-depth quantum circuits
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- tket : A Retargetable Compiler for NISQ Devices
- The Future of Quantum Computing with Superconducting Qubits
- Trading classical and quantum computational resources
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Warm-starting quantum optimization
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Effect of barren plateaus on gradient-free optimization
- Improving Variational Quantum Optimization using CVaR
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- Optimal Quantum Measurements of Expectation Values of Observables
- Doubling the size of quantum simulators by entanglement forging
- CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
- Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
- Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
- Circuit knitting with classical communication
- Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
- Constructing a virtual two-qubit gate by sampling single-qubit operations
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
- How many qubits are needed for quantum computational supremacy?
- Fast quantum circuit cutting with randomized measurements
- Quasiprobability decompositions with reduced sampling overhead
- Network Community Detection On Small Quantum Computers
- Multilevel Combinatorial Optimization Across Quantum Architectures
- Overhead for simulating a non-local channel with local channels by quasiprobability sampling
- Measurement Error Mitigation for Variational Quantum Algorithms
- High Dimensional Quantum Machine Learning With Small Quantum Computers
- Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits
- Quantum Divide and Compute: Exploring The Effect of Different Noise Sources
- Quantum Divide and Compute: Hardware Demonstrations and Noisy Simulations
- Experimental Simulation of Larger Quantum Circuits with Fewer Superconducting Qubits
- A Closer Look at Deep Policy Gradients
- Classical Splitting of Parametrized Quantum Circuits
- Quantum Local Search with the Quantum Alternating Operator Ansatz
- ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors
- Entanglement Forging with generative neural network models
- Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation
Cited by in corpus (13)
- An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
- Warm-Starting and Quantum Computing: A Systematic Mapping Study
- Architectural Vision for Quantum Computing in the Edge-Cloud Continuum
- Cutting a Wire with Non-Maximally Entangled States
- Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
- A Multilevel Framework for Partitioning Quantum Circuits
- Joint Wire Cutting with Non-Maximally Entangled States
- Optimization via Quantum Preconditioning
- Accelerating Feedback-Based Quantum Algorithms through Time Rescaling
- Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA
- Implementation of Tensor Network Simulation TN-Sim under NWQ-Sim
- Qubit-efficient quantum combinatorial optimization solver
- Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits