Quick Navigation

Topics

Quantum Machine Learning

Sample optimal Quantum identity testing via Pauli Measurements

arXiv
Authors: Nengkun Yu

Year

2020

Paper ID

20457

Status

Preprint

Abstract Read

~2 min

Abstract Words

36

Citations

N/A

Abstract

In this paper, we show that Θ\(poly(n\)cdotfrac{4n}{ε2}) is the sample complexity of testing whether two n-qubit quantum states ρ and σ are identical or ε-far in trace distance using two-outcome Pauli measurements.

Why This Paper Matters

  • This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
  • It adds a 2020 reference point for readers tracking recent quantum research.
  • In this paper, we show that Θ(poly(n)cdotfrac4^nε^2) is the sample complexity of testing whether two n-qubit quantum states ρ and σ are identical or ε-far in trace distance...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #20457 #69034 Hardware-aware Low-latency Quan... #69025 Machine-Learning Optimization a... #69003 QBugLM: An Agentic Benchmarking... #68993 Tomography of quantum states wi...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.