Nonlinear functions of quantum states
- URL: http://arxiv.org/abs/2412.01696v2
- Date: Tue, 14 Jan 2025 22:35:25 GMT
- Title: Nonlinear functions of quantum states
- Authors: Hongshun Yao, Yingjian Liu, Tengxiang Lin, Xin Wang,
- Abstract summary: We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits.<n>We develop quantum algorithms of fundamental tasks, achieving a sample complexity of $tildemathcalO (1/(varepsilon2kappa)$ for both von Neumann entropy estimation and quantum state fidelity calculations.
- Score: 5.641998714611475
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Efficient estimation of nonlinear functions of quantum states is crucial for various key tasks in quantum computing, such as entanglement spectroscopy, fidelity estimation, and feature analysis of quantum data. Conventional methods using state tomography and estimating numerous terms of the series expansion are computationally expensive, while alternative approaches based on a purified query oracle impose practical constraints. In this paper, we introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits. Our framework enables the implementation of arbitrary degree-$n$ polynomial functions of quantum states with precision $\varepsilon$ using $\mathcal{O}(n/\varepsilon^2)$ copies. We further apply QSF for developing quantum algorithms of fundamental tasks, achieving a sample complexity of $\tilde{\mathcal{O}}(1/(\varepsilon^2\kappa))$ for both von Neumann entropy estimation and quantum state fidelity calculations, where $\kappa$ represents the minimal nonzero eigenvalue. Our work establishes a concise and unified paradigm for estimating and realizing nonlinear functions of quantum states, paving the way for the practical processing and analysis of quantum data.
Related papers
- Tensor Cross Interpolation of Purities in Quantum Many-Body Systems [0.0]
In quantum many-body systems the exponential scaling of the Hilbert space with the number of degrees of freedom renders a complete state characterization.
Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed.
In this work, we demonstrate that the entanglement feature can be efficiently defining using only a amount of samples in the number of degrees of freedom.
arXiv Detail & Related papers (2025-03-21T15:33:00Z) - Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
Quantum homogenization is a reservoir-based quantum state approximation protocol.
We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.
We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
arXiv Detail & Related papers (2024-12-19T05:50:54Z) - Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations [0.28917933888634956]
matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits.
We derive rigorous expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function.
We construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits.
arXiv Detail & Related papers (2024-12-06T17:31:35Z) - 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 Natural Stochastic Pairwise Coordinate Descent [6.187270874122921]
Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years.
This paper introduces the quantum natural pairwise coordinate descent (2QNSCD) optimization method.
We develop a highly sparse unbiased estimator of the novel metric tensor using a quantum circuit with gate complexity $Theta(1)$ times that of the parameterized quantum circuit and single-shot quantum measurements.
arXiv Detail & Related papers (2024-07-18T18:57:29Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Quantum Realization of the Finite Element Method [0.0]
This paper presents a quantum algorithm for the solution of second-order linear elliptic partial differential equations discretized by $d$-linear finite elements.
An essential step in the construction is a BPX preconditioner, which transforms the linear system into a sufficiently well-conditioned one.
We provide a constructive proof demonstrating that, for any fixed dimension, our quantum algorithm can compute suitable functionals of the solution to a given tolerance.
arXiv Detail & Related papers (2024-03-28T15:44:20Z) - Determining the ability for universal quantum computing: Testing
controllability via dimensional expressivity [39.58317527488534]
Controllability tests can be used in the design of quantum devices to reduce the number of external controls.
We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
arXiv Detail & Related papers (2023-08-01T15:33:41Z) - Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
We analyze and optimize an improved quantum algorithm for topological data analysis.
We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation.
We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
arXiv Detail & Related papers (2022-09-27T17:56:15Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Quantum algorithms for estimating quantum entropies [6.211541620389987]
We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state.
We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
arXiv Detail & Related papers (2022-03-04T15:44:24Z) - K-sparse Pure State Tomography with Phase Estimation [1.2183405753834557]
Quantum state tomography (QST) for reconstructing pure states requires exponentially increasing resources and measurements with the number of qubits.
QST reconstruction for any pure state composed of the superposition of $K$ different computational basis states of $n$bits in a specific measurement set-up is presented.
arXiv Detail & Related papers (2021-11-08T09:43:12Z) - Estimating Gibbs partition function with quantumClifford sampling [6.656454497798153]
We develop a hybrid quantum-classical algorithm to estimate the partition function.
Our algorithm requires only a shallow $mathcalO(1)$-depth quantum circuit.
Shallow-depth quantum circuits are considered vitally important for currently available NISQ (Noisy Intermediate-Scale Quantum) devices.
arXiv Detail & Related papers (2021-09-22T02:03:35Z)
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.