One qubit as a Universal Approximant

• URL: http://arxiv.org/abs/2102.04032v2
• Date: Tue, 13 Jul 2021 10:11:19 GMT
• Title: One qubit as a Universal Approximant
• Authors: Adri\'an P\'erez-Salinas, David L\'opez-N\'u\~nez, Artur Garc\'ia-S\'aez, P. Forn-D\'iaz, Jos\'e I. Latorre
• Abstract summary: A single-qubit approximant can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. This work shows the robustness of the re-uploading technique on Quantum Machine Learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 parameterization 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 different 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.

Related papers

• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint state method together with reverse-time back-propagation to solve prohibitively large open-system quantum control problems. We apply this framework to optimize two inherently dissipative operations in superconducting qubits. Our results show that, given a fixed set of system parameters, shaping the control pulses can yield 2x improvements in the fidelity and duration for both of these operations.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Universality and Limitations of Prompt Tuning [65.8354898840308]
  We take one of the first steps to understand the role of soft-prompt tuning for transformer-based architectures. We analyze prompt tuning from the lens of universality and limitations with finite-depth pretrained transformers for continuous-valued functions. Our result guarantees the existence of a strong transformer with a prompt to approximate any sequence-to-sequence function in the set of Lipschitz functions.
  arXiv  Detail & Related papers  (2023-05-30T06:47:07Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Variational waveguide QED simulators [58.720142291102135]
  Waveguide QED simulators are made by quantum emitters interacting with one-dimensional photonic band-gap materials. Here, we demonstrate how these interactions can be a resource to develop more efficient variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-02-03T18:55:08Z)
• Continuous quantum gate sets and pulse class meta-optimization [0.0]
  We show that learning families of optimal control pulses depend adaptively on various parameters, in order to obtain a global optimal mapping from the space of potential parameter values to the control space. Our proposed method is tested on different experimentally relevant quantum gates and proves capable of producing high-fidelity pulses even in presence of multiple variable or uncertain parameters with wide ranges.
  arXiv  Detail & Related papers  (2022-03-25T11:43:40Z)
• Parameterized Two-Qubit Gates for Enhanced Variational Quantum Eigensolver [0.0]
  We simulate a variational quantum eigensolver algorithm using fixed and parameterized two-qubit gates in the circuit ansatz. We show that the parameterized versions outperform the fixed versions, both when it comes to best energy and reducing outliers, for a range of Hamiltonians with applications in quantum chemistry and materials science.
  arXiv  Detail & Related papers  (2022-03-09T19:00:01Z)
• Simulating Time Evolution with Fully Optimized Single-Qubit Gates on Parameterized Quantum Circuits [3.5462326830737805]
  We propose a novel method to sequentially optimize arbitrary single-qubit gates in parameterized quantum circuits. We show the method can be applied to real time evolution and discuss the tradeoff between its simulation accuracy and hardware efficiency.
  arXiv  Detail & Related papers  (2021-11-10T05:46:15Z)
• Generalized quantum circuit differentiation rules [23.87373187143897]
  Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits. Here, we propose the rules for differentiating quantum circuits (unitaries) with arbitrary generators.
  arXiv  Detail & Related papers  (2021-08-03T00:29:45Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.