Related papers: Fourier expansion in variational quantum algorithms

Fourier expansion in variational quantum algorithms

URL: http://arxiv.org/abs/2304.03787v2
Date: Sun, 16 Apr 2023 13:39:34 GMT
Title: Fourier expansion in variational quantum algorithms
Authors: Nikita A. Nemkov and Evgeniy O. Kiktenko and Aleksey K. Fedorov
Abstract summary: We focus on the class of variational circuits, where constant gates are Clifford gates and parameterized gates are generated by Pauli operators. We give a classical algorithm that computes coefficients of all trigonometric monomials up to a degree $m$ in time bounded by $mathcalO(N2m)$.
Score: 1.4732811715354455
License: http://creativecommons.org/licenses/by/4.0/
Abstract: The Fourier expansion of the loss function in variational quantum algorithms (VQA) contains a wealth of information, yet is generally hard to access. We focus on the class of variational circuits, where constant gates are Clifford gates and parameterized gates are generated by Pauli operators, which covers most practical cases while allowing much control thanks to the properties of stabilizer circuits. We give a classical algorithm that, for an $N$-qubit circuit and a single Pauli observable, computes coefficients of all trigonometric monomials up to a degree $m$ in time bounded by $\mathcal{O}(N2^m)$. Using the general structure and implementation of the algorithm we reveal several novel aspects of Fourier expansions in Clifford+Pauli VQA such as (i) reformulating the problem of computing the Fourier series as an instance of multivariate boolean quadratic system (ii) showing that the approximation given by a truncated Fourier expansion can be quantified by the $L^2$ norm and evaluated dynamically (iii) tendency of Fourier series to be rather sparse and Fourier coefficients to cluster together (iv) possibility to compute the full Fourier series for circuits of non-trivial sizes, featuring tens to hundreds of qubits and parametric gates.

Related papers

Fourier Analysis of Variational Quantum Circuits for Supervised Learning [0.0]
VQC can be understood through the lens of Fourier analysis. We show that the spectrum available to that truncated Fourier sum is not entirely determined by the encoding gates of the circuit. We show that it is possible to predict which VQC out of a given list of choices will be able to best fit the data.
arXiv Detail & Related papers (2024-11-05T19:07:26Z)
A Fourier analysis framework for approximate classical simulations of quantum circuits [0.0]
I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. I also discuss generalisations to homogeneous spaces, qudit systems and a way to analyse random circuits via matrix coefficients of irreducible representations.
arXiv Detail & Related papers (2024-10-17T17:59:34Z)
Fourier Series Guided Design of Quantum Convolutional Neural Networks for Enhanced Time Series Forecasting [0.9060149007362646]
We apply 1D quantum convolution to address the task of time series forecasting. By encoding multiple points into the quantum circuit to predict subsequent data, each point becomes a feature, transforming the problem into a multidimensional one.
arXiv Detail & Related papers (2024-04-23T01:35:07Z)
Constrained and Vanishing Expressivity of Quantum Fourier Models [2.7746258981078196]
We show a new correlation between the Fourier coefficients of the quantum model and its encoding gates. We also show a phenomenon of vanishing expressivity in certain settings. These two behaviors imply novel forms of constraints which limit the expressivity of PQCs.
arXiv Detail & Related papers (2024-03-14T14:05:24Z)
Fourier Continuation for Exact Derivative Computation in Physics-Informed Neural Operators [53.087564562565774]
PINO is a machine learning architecture that has shown promising empirical results for learning partial differential equations. We present an architecture that leverages Fourier continuation (FC) to apply the exact gradient method to PINO for nonperiodic problems.
arXiv Detail & Related papers (2022-11-29T06:37:54Z)
Deep Fourier Up-Sampling [100.59885545206744]
Up-sampling in the Fourier domain is more challenging as it does not follow such a local property. We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
arXiv Detail & Related papers (2022-10-11T06:17:31Z)
Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder. Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
arXiv Detail & Related papers (2022-09-30T02:36:42Z)
Unified Fourier-based Kernel and Nonlinearity Design for Equivariant Networks on Homogeneous Spaces [52.424621227687894]
We introduce a unified framework for group equivariant networks on homogeneous spaces. We take advantage of the sparsity of Fourier coefficients of the lifted feature fields. We show that other methods treating features as the Fourier coefficients in the stabilizer subgroup are special cases of our activation.
arXiv Detail & Related papers (2022-06-16T17:59:01Z)
Factorized Fourier Neural Operators [77.47313102926017]
The Factorized Fourier Neural Operator (F-FNO) is a learning-based method for simulating partial differential equations. We show that our model maintains an error rate of 2% while still running an order of magnitude faster than a numerical solver.
arXiv Detail & Related papers (2021-11-27T03:34:13Z)
Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
arXiv Detail & Related papers (2020-10-01T14:31:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.