One qubit as a universal approximant
- 2 July 2021
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (1) , 012405
Abstract
A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The single-qubit approximant presented in this work is operated through a series of gates that take as their parametrization the independent variable of the target function and an additional set of adjustable parameters. The independent variable is re-uploaded in every gate while the parameters are optimized for each target function. The output state of this quantum circuit becomes more accurate as the number of re-uploadings of the independent variable increases, i.e., as more layers of gates parameterized with the independent variable are applied. In this work, we provide two proofs of this claim related to both the Fourier series and the universal approximation theorem for neural networks, and we benchmark both methods against their classical counterparts. We further implement a single-qubit approximant in a real superconducting qubit device, demonstrating how the ability to describe a set of functions improves with the depth of the quantum circuit. This work shows the robustness of the re-uploading technique on quantum machine learning.Keywords
All Related Versions
Funding Information
- Generalitat de Catalunya
This publication has 22 references indexed in Scilit:
- Observation of High Coherence in Josephson Junction Qubits Measured in a Three-Dimensional Circuit QED ArchitecturePhysical Review Letters, 2011
- Scalable and Robust Randomized Benchmarking of Quantum ProcessesPhysical Review Letters, 2011
- Optimized driving of superconducting artificial atoms for improved single-qubit gatesPhysical Review A, 2010
- Simple Pulses for Elimination of Leakage in Weakly Nonlinear QubitsPhysical Review Letters, 2009
- A Limited Memory Algorithm for Bound Constrained OptimizationSIAM Journal on Scientific Computing, 1995
- Multilayer feedforward networks with a nonpolynomial activation function can approximate any functionNeural Networks, 1993
- Approximation capabilities of multilayer feedforward networksNeural Networks, 1991
- Approximation by superpositions of a sigmoidal functionMathematics of Control, Signals, and Systems, 1989
- On convergence and growth of partial sums of Fourier seriesActa Mathematica, 1966
- Über lineare Gleichungssysteme in linearen Räumen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1927