Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements

Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang
8/14/2023
quant-phcs.LG

No confident code implementation found for this paper.

Abstract

Recent work has shown that $n$-qubit quantum states output by circuits with at most $t$ single-qubit non-Clifford gates can be learned to trace distance $ε$ using $\mathsf{poly}(n,2^t,1/ε)$ time and samples. All prior algorithms achieving this runtime use entangled measurements across two copies of the input state. In this work, we give a similarly efficient algorithm that learns the same class of states using only single-copy measurements.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{grewal2023efficient,
  title  = {Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements},
  author = {Sabee Grewal and Vishnu Iyer and William Kretschmer and Daniel Liang},
  year   = {2023},
  eprint = {2308.07175},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.07175v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.07175.svg)](https://codeofpaper.com/paper/2308.07175)

Discussion