Provable Advantage of Parameterized Quantum Circuit in Function
Approximation
- URL: http://arxiv.org/abs/2310.07528v1
- Date: Wed, 11 Oct 2023 14:29:11 GMT
- Title: Provable Advantage of Parameterized Quantum Circuit in Function
Approximation
- Authors: Zhan Yu, Qiuhao Chen, Yuling Jiao, Yinan Li, Xiliang Lu, Xin Wang,
Jerry Zhijian Yang
- Abstract summary: We analyze the expressivity of PQCs through the lens of function approximation.
We compare our proposed PQCs to nearly optimal deep neural networks in approxing high-dimensional smooth functions.
- Score: 17.286013304279013
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Understanding the power of parameterized quantum circuits (PQCs) in
accomplishing machine learning tasks is one of the most important questions in
quantum machine learning. In this paper, we analyze the expressivity of PQCs
through the lens of function approximation. Previously established universal
approximation theorems for PQCs are mainly nonconstructive, leading us to the
following question: How large do the PQCs need to be to approximate the target
function up to a given error? We exhibit explicit constructions of data
re-uploading PQCs for approximating continuous and smooth functions and
establish quantitative approximation error bounds in terms of the width, the
depth and the number of trainable parameters of the PQCs. To achieve this, we
utilize techniques from quantum signal processing and linear combinations of
unitaries to construct PQCs that implement multivariate polynomials. We
implement global and local approximation techniques using Bernstein polynomials
and local Taylor expansion and analyze their performances in the quantum
setting. We also compare our proposed PQCs to nearly optimal deep neural
networks in approximating high-dimensional smooth functions, showing that the
ratio between model sizes of PQC and deep neural networks is exponentially
small with respect to the input dimension. This suggests a potentially novel
avenue for showcasing quantum advantages in quantum machine learning.
Related papers
- Machine learning framework for predicting the entangling capability of parameterized quantum circuits [17.975555487972166]
Variational quantum algorithms (VQAs) are promising solutions, but their performance heavily depends on the parameterized quantum circuits (PQCs)
entanglement of PQCs is an important metric for constructing PQCs.
We propose a machine learning framework that utilizes a long short-term memory (LSTM) model and gate encoding technology to predict the entangling capability of PQCs.
arXiv Detail & Related papers (2024-06-04T06:28:05Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Predicting Expressibility of Parameterized Quantum Circuits using Graph
Neural Network [5.444441239596186]
We propose a novel method based on Graph Neural Networks (GNNs) for predicting the expressibility of Quantum Circuits (PQCs)
By leveraging the graph-based representation of PQCs, our GNN-based model captures intricate relationships between circuit parameters and their resulting expressibility.
Experimental evaluation on a four thousand random PQC dataset and IBM Qiskit's hardware efficient ansatz sets demonstrates the superior performance of our approach.
arXiv Detail & Related papers (2023-09-13T14:08:01Z) - Variational Quantum Approximate Spectral Clustering for Binary
Clustering Problems [0.7550566004119158]
We introduce the Variational Quantum Approximate Spectral Clustering (VQASC) algorithm.
VQASC requires optimization of fewer parameters than the system size, N, traditionally required in classical problems.
We present numerical results from both synthetic and real-world datasets.
arXiv Detail & Related papers (2023-09-08T17:54:42Z) - Parametrized Quantum Circuits and their approximation capacities in the
context of quantum machine learning [1.3108652488669736]
Parametrized quantum circuits (PQC) are quantum circuits which consist of both fixed and parametrized gates.
We show that PQCs can approximate the space of continuous functions, $p$-integrable functions and the $Hk$ Sobolev spaces under specific distances.
arXiv Detail & Related papers (2023-07-27T11:43:08Z) - Quantum Federated Learning with Entanglement Controlled Circuits and
Superposition Coding [44.89303833148191]
We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs)
We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs.
In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
arXiv Detail & Related papers (2022-12-04T03:18:03Z) - End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
We provide a complete quantum circuit-level description of the algorithm from problem input to problem output.
We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
arXiv Detail & Related papers (2022-11-22T18:54:48Z) - Symmetric Pruning in Quantum Neural Networks [111.438286016951]
Quantum neural networks (QNNs) exert the power of modern quantum machines.
QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes.
We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
arXiv Detail & Related papers (2022-08-30T08:17:55Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - qLEET: Visualizing Loss Landscapes, Expressibility, Entangling Power and
Training Trajectories for Parameterized Quantum Circuits [0.0]
qLEET is an open-source Python package for studying parameterized quantum circuits (PQCs)
It enables the computation of properties such as expressibility and entangling power of a PQC.
It supports quantum circuits and noise models built using popular quantum computing libraries such as Qiskit, Cirq, and Pyquil.
arXiv Detail & Related papers (2022-05-04T14:47:23Z) - FLIP: A flexible initializer for arbitrarily-sized parametrized quantum
circuits [105.54048699217668]
We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits.
FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters.
We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
arXiv Detail & Related papers (2021-03-15T17:38:33Z)
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.