Related papers: Approximating Korobov Functions via Quantum Circuits

Approximating Korobov Functions via Quantum Circuits

URL: http://arxiv.org/abs/2404.14570v3
Date: Tue, 17 Dec 2024 17:08:36 GMT
Title: Approximating Korobov Functions via Quantum Circuits
Authors: Junaid Aftab, Haizhao Yang,
Abstract summary: We construct quantum circuits that can approximate $d$-dimensional functions in the Korobov function space. Since the Korobov space is a subspace of Sobolev spaces, our work establishes a theoretical foundation for implementing a broad class of functions on quantum computers.
Score: 6.460951804337735
License:
Abstract: Studying quantum circuits through the lens of approximation theory is crucial to upper bound the computational complexity of such circuits to approximate various mathematical functions. In this paper, we construct quantum circuits that can approximate $d$-dimensional functions in the Korobov function space using quantum signal processing and linear combinations of unitaries algorithms. We provide error bounds and complexity estimates for these circuits. Since the Korobov space is a subspace of Sobolev spaces, our work establishes a theoretical foundation for implementing a broad class of functions on quantum computers.

Related papers

Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks [2.0257616108612373]
Quantum walks are powerful tools for various graph-based applications. We present a circuit design for implementing discrete-time quantum walks on complex networks.
arXiv Detail & Related papers (2024-08-28T09:11:47Z)
Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z)
Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z)
Quantum computing topological invariants of two-dimensional quantum matter [0.0]
We present two quantum circuits for calculating Chern numbers of two-dimensional quantum matter on quantum computers. First algorithm uses many qubits, and we analyze it using a tensor-network simulator of quantum circuits. Second circuit uses fewer qubits, and we implement it experimentally on a quantum computer based on superconducting qubits.
arXiv Detail & Related papers (2024-04-09T06:22:50Z)
Analysis of arbitrary superconducting quantum circuits accompanied by a Python package: SQcircuit [0.0]
Superconducting quantum circuits are a promising hardware platform for realizing a fault-tolerant quantum computer. We develop a framework to construct a superconducting quantum circuit's quantized Hamiltonian from its physical description. We implement the methods described in this work in an open-source Python package SQcircuit.
arXiv Detail & Related papers (2022-06-16T17:24:51Z)
Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z)
Quantum circuits for the preparation of spin eigenfunctions on quantum computers [63.52264764099532]
Hamiltonian symmetries are an important instrument to classify relevant many-particle wavefunctions. This work presents quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers.
arXiv Detail & Related papers (2022-02-19T00:21:46Z)
Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z)
Characterizing quantum circuits with qubit functional configurations [0.0]
We propose a theory of characterizing quantum circuits with qubit functional configurations. We demonstrate the theory's application to the hardware-efficient ansatzes of variational quantum algorithms.
arXiv Detail & Related papers (2021-10-05T22:42:14Z)
Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z)
Quantum Simulation of Light-Front Parton Correlators [0.0]
The physics of high-energy colliders relies on the knowledge of non-perturbative parton correlators. We propose a quantum algorithm to perform a quantum simulation of these type of correlators.
arXiv Detail & Related papers (2020-11-02T19:38:33Z)

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