Exploring Quantum Average-Case Distances: proofs, properties, and examples

• URL: http://arxiv.org/abs/2112.14284v6
• Date: Wed, 1 Mar 2023 03:23:21 GMT
• Title: Exploring Quantum Average-Case Distances: proofs, properties, and examples
• Abstract summary: We study recently introduced average-case quantum distances. Average-case distances approximate the average Total-Variation (TV) distance between measurement outputs of two quantum processes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we perform an in-depth study of recently introduced average-case quantum distances. The average-case distances approximate the average Total-Variation (TV) distance between measurement outputs of two quantum processes, in which quantum objects of interest (states, measurements, or channels) are intertwined with random circuits. Contrary to conventional distances, such as trace distance or diamond norm, they quantify $\textit{average-case}$ statistical distinguishability via random circuits. We prove that once a family of random circuits forms an $\delta$-approximate $4$-design, with $\delta=o(d^{-8})$, then the average-case distances can be approximated by simple explicit functions that can be expressed via degree two polynomials in objects of interest. We prove that those functions, which we call quantum average-case distances, have a plethora of desirable properties, such as subadditivity, joint convexity, and (restricted) data-processing inequalities. Notably, all of the distances utilize the Hilbert-Schmidt norm which provides an operational interpretation it did not possess before. We also derive upper bounds on the maximal ratio between worst-case and average-case distances. For each dimension $d$ this ratio is at most $d^{\frac{1}{2}},\ d, \ d^{\frac{3}{2}}$ for states, measurements, and channels, respectively. To support the practical usefulness of our findings, we study multiple examples in which average-case quantum distances can be calculated analytically.

Related papers

• Quantum Multi-Level Estimation of Functionals of Discrete Distributions [23.53427184324404]
  We propose a quantum multi-level estimation framework for a functional $sum_i=1n f(p_i)$ of a discrete distribution.<n>We present efficient quantum estimators for the $q$-Tsallis entropy of discrete distributions.
  arXiv  Detail & Related papers  (2026-05-05T12:25:17Z)
• ENTCALC: Toolkit for calculating geometric entanglement in multipartite quantum systems [43.748379918040854]
  We present entcalc, a Python package for estimating the geometric entanglement of multipartite quantum states.<n>For pure states, it computes the geometric entanglement together with an estimation error.<n>For mixed states, it provides both lower and upper bounds on the geometric entanglement.
  arXiv  Detail & Related papers  (2025-12-11T18:14:43Z)
• Optimal learning of quantum channels in diamond distance [0.0]
  We show that a quantum channel acting on a $d$-dimensional system can be estimated to accuracy $varepsilon$ in diamond distance.<n>We obtain, to the best of our knowledge, the first essentially optimal strategies for operator-norm learning of binary POVMs and isometries.
  arXiv  Detail & Related papers  (2025-12-11T02:04:03Z)
• Distances between pure quantum states induced by a distance matrix [0.0]
  We construct an infinite family of distances $d_p$ on the complex projective space $mathbbP(mathbbCn)$.<n>The paper significantly extends earlier work, resolving an important question about the geometry of quantum state space imposed by the quantum Wasserstein distances.
  arXiv  Detail & Related papers  (2025-09-18T08:23:33Z)
• Relative-Translation Invariant Wasserstein Distance [82.6068808353647]
  We introduce a new family of distances, relative-translation invariant Wasserstein distances ($RW_p$) We show that $RW_p distances are also real distance metrics defined on the quotient set $mathcalP_p(mathbbRn)/sim$ invariant to distribution translations.
  arXiv  Detail & Related papers  (2024-09-04T03:41:44Z)
• 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)
• The quantum beam splitter with many partially indistinguishable photons: multiphotonic interference and asymptotic classical correspondence [44.99833362998488]
  We present the analysis of the quantum two-port interferometer in the $n rightarrow infty$ limit of $n$ partially indistinguishable photons. Our main result is that the output distribution is dominated by the $O(sqrtn)$ channels around a certain $j*$ that depends on the degree of indistinguishability. The form is essentially the doubly-humped semi-classical envelope of the distribution that would arise from $2 j*$ indistinguishable photons, and which reproduces the corresponding classical intensity distribution.
  arXiv  Detail & Related papers  (2023-12-28T01:48:26Z)
• Quantum Distance Calculation for $\epsilon$-Graph Construction [0.0]
  We investigate the potential for quantum advantage in the case of quantum distance calculation for computing $epsilon$-graphs. We show that, relying on existing quantum multi-state SWAP test based algorithms, the query complexity for correctly identifying two points are not $epsilon$-neighbours is at least O(n3 / ln n)
  arXiv  Detail & Related papers  (2023-06-07T09:43:28Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• 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)
• Nystr\"om Kernel Mean Embeddings [92.10208929236826]
  We propose an efficient approximation procedure based on the Nystr"om method. It yields sufficient conditions on the subsample size to obtain the standard $n-1/2$ rate. We discuss applications of this result for the approximation of the maximum mean discrepancy and quadrature rules.
  arXiv  Detail & Related papers  (2022-01-31T08:26:06Z)
• Operational Quantum Average-Case Distances [9.860241174078372]
  We introduce distance measures between quantum states, measurements, and channels based on their statistical distinguishability in generic experiments. We show that for circuits forming approximate 4-designs, the average TVDs can be approximated by simple explicit functions of the underlying objects. We apply them to analyze the effects of noise in quantum advantage experiments and for efficient discrimination of high-dimensional states and channels without quantum memory.
  arXiv  Detail & Related papers  (2021-12-28T20:00:38Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Quasi-polynomial time algorithms for free quantum games in bounded dimension [11.56707165033]
  We give a semidefinite program of size $exp(mathcalObig(T12(log2(AT)+log(Q)log(AT))/epsilon2big)) to compute additive $epsilon$-approximations on the values of two-player free games. We make a connection to the quantum separability problem and employ improved multipartite quantum de Finetti theorems with linear constraints.
  arXiv  Detail & Related papers  (2020-05-18T16:55:08Z)
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates [0.0]
  We prove that $poly(t)cdot n1/D$-depth local random quantum circuits with two qudit nearest-neighbor gates are approximate $t$-designs in various measures. We also prove that anti-concentration is possible in depth O(log(n) loglog(n) using a different model.
  arXiv  Detail & Related papers  (2018-09-18T22:28:15Z)

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.