Fast Simulation of High-Depth QAOA Circuits
- URL: http://arxiv.org/abs/2309.04841v2
- Date: Tue, 12 Sep 2023 23:23:10 GMT
- Title: Fast Simulation of High-Depth QAOA Circuits
- Authors: Danylo Lykov, Ruslan Shaydulin, Yue Sun, Yuri Alexeev, Marco Pistoia
- Abstract summary: We present a simulator for the Quantum Approximate Optimization Algorithm (QAOA)
Our simulator is designed with the goal of reducing the computational cost of QAOA parameter optimization.
We reduce the time for a typical QAOA parameter optimization by eleven times for $n = 26$ qubits compared to a state-of-the-art GPU quantum circuit simulator based on cuQuantum.
- Score: 10.778538580079365
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Until high-fidelity quantum computers with a large number of qubits become
widely available, classical simulation remains a vital tool for algorithm
design, tuning, and validation. We present a simulator for the Quantum
Approximate Optimization Algorithm (QAOA). Our simulator is designed with the
goal of reducing the computational cost of QAOA parameter optimization and
supports both CPU and GPU execution. Our central observation is that the
computational cost of both simulating the QAOA state and computing the QAOA
objective to be optimized can be reduced by precomputing the diagonal
Hamiltonian encoding the problem. We reduce the time for a typical QAOA
parameter optimization by eleven times for $n = 26$ qubits compared to a
state-of-the-art GPU quantum circuit simulator based on cuQuantum. Our
simulator is available on GitHub: https://github.com/jpmorganchase/QOKit
Related papers
- Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization [39.58317527488534]
We present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO) problems.
Our protocol is experimentally validated using 156 qubits on an IBM quantum processor with a heavy-hex architecture.
arXiv Detail & Related papers (2024-09-05T17:38:59Z) - Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling [33.04597339860113]
We propose digitized counterdiabatic quantum optimization (DCQO)algorithms for two scheduling problems.
For the job-shop scheduling problem, we aim at finding the optimal schedule for a robot executing a number of tasks under specific constraints.
For the traveling salesperson problem, the goal is to find the path that covers all cities and is associated with the shortest traveling distance.
arXiv Detail & Related papers (2024-05-24T16:53:30Z) - TANQ-Sim: Tensorcore Accelerated Noisy Quantum System Simulation via QIR on Perlmutter HPC [16.27167995786167]
TANQ-Sim is a full-scale density matrix based simulator designed to simulate practical deep circuits with both coherent and non-coherent noise.
To address the significant computational cost associated with such simulations, we propose a new density-matrix simulation approach.
To optimize performance, we also propose specific gate fusion techniques for density matrix simulation.
arXiv Detail & Related papers (2024-04-19T21:16:29Z) - Hybrid quantum algorithms for flow problems [0.0]
We debut here a high performance quantum simulator which we term QFlowS (Quantum Flow Simulator)
We first choose to simulate two well known flows using QFlowS and demonstrate a previously unseen, full gate-level implementation of a hybrid and high precision Quantum Linear Systems Algorithms (QLSA)
This work suggests a path towards quantum simulation of fluid flows, and highlights the special considerations needed at the gate level implementation of QC.
arXiv Detail & Related papers (2023-07-01T17:39:21Z) - The QAOA with Few Measurements [4.713817702376467]
The Approximate Quantum Optimization Algorithm (QAOA) was originally developed to solve optimization problems.
Fully descriptive benchmarking techniques are often expensive for large numbers of qubits.
Some experimental quantum computing platforms such as neutral atom quantum computers have slow repetition rates.
arXiv Detail & Related papers (2022-05-13T18:42:20Z) - Performance Evaluation and Acceleration of the QTensor Quantum Circuit
Simulator on GPUs [6.141912076989479]
We implement NumPy, PyTorch, and CuPy backends and benchmark the codes to find the optimal allocation of tensor simulations to either a CPU or a GPU.
Our method achieves $176times$ speedup on a GPU over the NumPy baseline on a CPU for the benchmarked QAOA circuits to solve MaxCut problem.
arXiv Detail & Related papers (2022-04-12T19:03:44Z) - Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity.
We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree.
These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
arXiv Detail & Related papers (2022-01-06T21:02:30Z) - QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits [26.130594925642143]
Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (NISQ) computers.
We propose and experimentally implement QuantumNAS, the first comprehensive framework for noise-adaptive co-search of variational circuit and qubit mapping.
For QML tasks, QuantumNAS is the first to demonstrate over 95% 2-class, 85% 4-class, and 32% 10-class classification accuracy on real quantum computers.
arXiv Detail & Related papers (2021-07-22T17:58:13Z) - GPU-accelerated simulations of quantum annealing and the quantum
approximate optimization algorithm [0.0]
We study large-scale applications using a GPU-accelerated version of the massively parallel J"ulich universal quantum computer simulator (JUQCS--G)
arXiv Detail & Related papers (2021-04-07T17:52:50Z) - Simulation of Quantum Computing on Classical Supercomputers [23.350853237013578]
We propose a scheme based on cutting edges of undirected graphs.
This scheme cuts edges of undirected graphs with large tree width to obtain many undirected subgraphs.
It can simulate 120-qubit 3-regular QAOA algorithm on 4096-core supercomputer.
arXiv Detail & Related papers (2020-10-28T13:26:41Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.