Quick Navigation

Topics

Trapped Ion Quantum Computing

Learning quantum states prepared by shallow circuits in polynomial time

arXiv
Authors: Zeph Landau, Yunchao Liu

Year

2024

Paper ID

37415

Status

Preprint

Abstract Read

~2 min

Abstract Words

112

Citations

N/A

Abstract

We give a polynomial time algorithm that, given copies of an unknown quantum state vertψrangle=Uvert 0nrangle that is prepared by an unknown constant depth circuit U on a finite-dimensional lattice, learns a constant depth quantum circuit that prepares vertψrangle. The algorithm extends to the case when the depth of U is polylog(n), with a quasi-polynomial run-time. The key new idea is a simple and general procedure that efficiently reconstructs the global state vertψrangle from its local reduced density matrices. As an application, we give an efficient algorithm to test whether an unknown quantum state on a lattice has low or high quantum circuit complexity.

Why This Paper Matters

  • This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
  • It adds a 2024 reference point for readers tracking recent quantum research.
  • We give a polynomial time algorithm that, given copies of an unknown quantum state vertψrangle=Uvert 0^nrangle that is prepared by an unknown constant depth circuit U on a...

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 #37415

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.