Ancilla-free certification of unitary quantum processes
- URL: http://arxiv.org/abs/2211.15647v1
- Date: Mon, 28 Nov 2022 18:53:11 GMT
- Title: Ancilla-free certification of unitary quantum processes
- Authors: Wei Xie
- Abstract summary: We study efficient quantum certification algorithms for unitary quantum process using no ancilla.
We give an algorithm that distinguishes the two cases with $O(varepsilon-1)$ uses of the unitary, using fewer or no ancilla, outperforming previous relevant results.
- Score: 2.3889084213601346
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study efficient quantum certification algorithms for unitary quantum
process using no ancilla. Previous study showed that one can distinguish
whether an unknown unitary $U$ is equal to or $\varepsilon$-far from a known or
unknown unitary $V$ in fixed dimension with $O(\varepsilon^{-2})$ uses of the
unitary, in which the Choi state is used and thus a high dimensional ancilla
system is always needed. We give an algorithm that distinguishes the two cases
with $O(\varepsilon^{-1})$ uses of the unitary, using fewer or no ancilla,
outperforming previous relevant results.
Related papers
- SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More [37.208622097149714]
We give a new family of upper-time algorithms which can certify bounds on the maximum of $|M u|$.
Our certification algorithm makes essential use of the Sum-of-Squares hierarchy.
arXiv Detail & Related papers (2024-12-30T18:59:46Z) - Storage and retrieval of two unknown unitary channels [37.928612512813494]
We consider the case where the unknown unitary is selected with equal prior probability from two options.
First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary.
Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary.
arXiv Detail & Related papers (2024-10-30T18:27:46Z) - Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.
Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.
We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
arXiv Detail & Related papers (2024-05-14T15:28:37Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Succinct quantum testers for closeness and $k$-wise uniformity of probability distributions [2.3466828785520373]
We explore potential quantum speedups for the fundamental problem of testing the properties of closeness and $k$-wise uniformity of probability distributions.
We show that the quantum query complexities for $ell1$- and $ell2$-closeness testing are $O(sqrtn/varepsilon)$ and $O(sqrtnk/varepsilon)$.
We propose the first quantum algorithm for this problem with query complexity $O(sqrtnk/varepsilon)
arXiv Detail & Related papers (2023-04-25T15:32:37Z) - Unitarity estimation for quantum channels [7.323367190336826]
Unitarity estimation is a basic and important problem in quantum device certification and benchmarking.
We provide a unified framework for unitarity estimation, which induces ancilla-efficient algorithms.
We show that both the $d$-dependence and $epsilon$-dependence of our algorithms are optimal.
arXiv Detail & Related papers (2022-12-19T09:36:33Z) - Quantum Approximation of Normalized Schatten Norms and Applications to
Learning [0.0]
This paper addresses the problem of defining a similarity measure for quantum operations that can be textitefficiently estimated
We develop a quantum sampling circuit to estimate the normalized Schatten 2-norm of their difference and prove a Poly$(frac1epsilon)$ upper bound on the sample complexity.
We then show that such a similarity metric is directly related to a functional definition of similarity of unitary operations using the conventional fidelity metric of quantum states.
arXiv Detail & Related papers (2022-06-23T07:12:10Z) - Quantum Algorithm for Fidelity Estimation [8.270684567157987]
For two unknown mixed quantum states $rho$ and $sigma$ in an $N$-dimensional space, computing their fidelity $F(rho,sigma)$ is a basic problem.
We propose a quantum algorithm that solves this problem in $namepoly(log (N), r, 1/varepsilon)$ time.
arXiv Detail & Related papers (2021-03-16T13:57:01Z) - Quantum certification of state set and unitary channel [2.3889084213601346]
We study efficient quantum certification algorithms for quantum state set and unitary quantum channel.
We present an algorithm that uses $O(varepsilon-4ln |mathcalP|)$ copies of an unknown state to distinguish whether the unknown state is contained in or $varepsilon$-far from a finite set.
arXiv Detail & Related papers (2021-03-04T05:17:49Z) - Linear-Sample Learning of Low-Rank Distributions [56.59844655107251]
We show that learning $ktimes k$, rank-$r$, matrices to normalized $L_1$ distance requires $Omega(frackrepsilon2)$ samples.
We propose an algorithm that uses $cal O(frackrepsilon2log2fracepsilon)$ samples, a number linear in the high dimension, and nearly linear in the matrices, typically low, rank proofs.
arXiv Detail & Related papers (2020-09-30T19:10:32Z) - Finite-Time Analysis for Double Q-learning [50.50058000948908]
We provide the first non-asymptotic, finite-time analysis for double Q-learning.
We show that both synchronous and asynchronous double Q-learning are guaranteed to converge to an $epsilon$-accurate neighborhood of the global optimum.
arXiv Detail & Related papers (2020-09-29T18:48:21Z)
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.