Classical variational simulation of the Quantum Approximate Optimization
Algorithm
- URL: http://arxiv.org/abs/2009.01760v3
- Date: Mon, 21 Jun 2021 18:03:28 GMT
- Title: Classical variational simulation of the Quantum Approximate Optimization
Algorithm
- Authors: Matija Medvidovic, Giuseppe Carleo
- Abstract summary: We introduce a method to simulate layered quantum circuits consisting of parametrized gates.
A neural-network parametrization of the many-qubit wave function is used.
For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A key open question in quantum computing is whether quantum algorithms can
potentially offer a significant advantage over classical algorithms for tasks
of practical interest. Understanding the limits of classical computing in
simulating quantum systems is an important component of addressing this
question. We introduce a method to simulate layered quantum circuits consisting
of parametrized gates, an architecture behind many variational quantum
algorithms suitable for near-term quantum computers. A neural-network
parametrization of the many-qubit wave function is used, focusing on states
relevant for the Quantum Approximate Optimization Algorithm (QAOA). For the
largest circuits simulated, we reach 54 qubits at 4 QAOA layers, approximately
implementing 324 RZZ gates and 216 RX gates without requiring large-scale
computational resources. For larger systems, our approach can be used to
provide accurate QAOA simulations at previously unexplored parameter values and
to benchmark the next generation of experiments in the Noisy Intermediate-Scale
Quantum (NISQ) era.
Related papers
- Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers.
Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
arXiv Detail & Related papers (2024-06-17T14:10:10Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods.
An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state.
Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
arXiv Detail & Related papers (2023-11-06T18:53:50Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - An introduction to variational quantum algorithms on gate-based quantum
computing for combinatorial optimization problems [0.0]
This tutorial provides a mathematical description of the class of Variational Quantum Algorithms.
We introduce precisely the key aspects of these hybrid algorithms on the quantum side and the classical side.
We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions.
arXiv Detail & Related papers (2022-12-22T14:27:52Z) - Hybrid Quantum Classical Simulations [0.0]
We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE)
Both are hybrid quantum classical algorithms as they require incremental communication between a classical central processing unit and a quantum processing unit to solve a problem.
arXiv Detail & Related papers (2022-10-06T10:49:15Z) - An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers.
This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
arXiv Detail & Related papers (2022-05-11T12:10:52Z) - Fundamental limitations on optimization in variational quantum
algorithms [7.165356904023871]
A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs)
We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability.
This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
arXiv Detail & Related papers (2022-05-10T17:14:57Z) - Strong quantum computational advantage using a superconducting quantum
processor [33.030717006448526]
We develop a two-dimensional programmable superconducting quantum processor, textitZuchongzhi, composed of 66 functional qubits in a tunable coupling architecture.
Our work establishes an unambiguous quantum computational advantage that is infeasible classical computation in a reasonable amount of time.
arXiv Detail & Related papers (2021-06-28T14:06:07Z) - Quantum mean value approximator for hard integer value problems [19.4417702222583]
We show that an optimization can be improved substantially by using an approximation rather than the exact expectation.
Together with efficient classical sampling algorithms, a quantum algorithm with minimal gate count can thus improve the efficiency of general integer-value problems.
arXiv Detail & Related papers (2021-05-27T13:03:52Z)
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.