Quick Navigation

Topics

Quantum Machine Learning

Learning shallow quantum circuits with many-qubit gates

arXiv
Authors: Francisca Vasconcelos, Hsin-Yuan Huang

Year

2024

Paper ID

37816

Status

Preprint

Abstract Read

~2 min

Abstract Words

94

Citations

N/A

Abstract

We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates. Specifically, we provide a quasi-polynomial time and sample complexity algorithm for learning unknown QAC0 circuits - constant-depth circuits with arbitrary single-qubit gates and polynomially many CZ gates of unbounded width - with at most logarithmic ancilla, up to inverse-polynomially small error. Furthermore, we show that the learned unitary can be efficiently synthesized in poly-logarithmic depth. This work expands the family of efficiently learnable quantum circuits, notably since in finite-dimensional circuit geometries, QAC0 circuits require polynomial depth to implement.

Why This Paper Matters

  • This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
  • It adds a 2024 reference point for readers tracking recent quantum research.
  • We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates.

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 #37816 #69596 Comprehensive pKa Data Augmenta... #69584 OQMD: Single-Qubit Rotation Con... #69549 REGRID-QAOA: A Resource-Efficie... #69539 Learning ground state observabl...

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.