• Corpus ID: 245537117

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

@inproceedings{Maciejewski2021ExploringQA,
  title={Exploring Quantum Average-Case Distances: proofs, properties, and examples},
  author={Filip B. Maciejewski and Zbigniew Puchała and Michał Oszmaniec},
  year={2021}
}
In this work, we present an in-depth study of average-case quantum distances introduced in [1]. The average-case distances approximate, up to the relative error, 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 quantum circuits. Contrary to conventional distances, such as trace distance or diamond norm, they quantify average-case statistical… 

Figures and Tables from this paper

Operational Quantum Average-Case Distances

It is argued that ACDs are better suited for assessing the quality of NISQ devices than common distance measures such as trace distance or the diamond norm.

The Wasserstein distance of order $1$ for quantum spin systems on infinite lattices

We propose a generalization of the Wasserstein distance of order 1 to quantum spin systems on the lattice Z d , which we call specific quantum W 1 distance. The proposal is based on the W 1 distance

References

SHOWING 1-10 OF 76 REFERENCES

Pseudo-randonmess and Learning in Quantum Computation

It is shown that for a natural model of a random quantum circuit, the distribution of random circuits quickly converges to a 2-design, and many large deviation bound results for Haar random unitaries carry over to k-designs for k = poly(n).

Quantum Supremacy through the Quantum Approximate Optimization Algorithm

It is argued that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable complexity theoretic assumptions, the output distribution of even the lowest depth version cannot be efficiently simulated on any classical device.

Detecting and Eliminating Quantum Noise of Quantum Measurements

Quantum measurements are indispensable in the quantum era as they are the bridge that connects the micro-scopic world of quantum phenomena and the macroscopic world of observable events. However,

The Church of the Symmetric Subspace

The purpose of the article is to collect in one place many, if not all, of the quantum information applications of the symmetric subspace, and to collect some new proofs of existing results, such as a variant of the exponential de Finetti theorem.

Measurements of Quantum Hamiltonians with Locally-Biased Classical Shadows

Obtaining precise estimates of quantum observables is a crucial step of variational quantum algorithms. We consider the problem of estimating expectation values of quantum Hamiltonians, obtained on

IEEE TRANSACTIONS ON INFORMATION THEORY

Since at most T of these equations can come from (7), at least (m T) of them come from (8’). Thus, for the distribution (PI’, . . . , p,‘), at most T of the probabilities are nonzero. The proof of

Adaptive Pauli Shadows for Energy Estimation

By adding a fraction of this classical computing resource to the locally-biased classical shadows setting, this present note shows that the modified algorithm, termed Adaptive Pauli Shadows is state-of-the-art for energy estimation.

and a at

The xishacorene natural products are structurally unique apolar diterpenoids that feature a bicyclo[3.3.1] framework. These secondary metabolites likely arise from the well-studied, structurally

Quantum Computation and Quantum Information (10th Anniversary edition)

Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.

Physical Review A 71

  • 10.1103/physreva.71.062310
  • 2005
...