Quick Navigation

Topics

Trapped Ion Quantum Computing

Designs from Local Random Quantum Circuits with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><mml:mi>SU</mml:mi><mml:mo stretchy="false"></mml:mo><mml:mi>d</mml:mi><mml:mo stretchy="false"></mml:mo></mml:math> Symmetry

Crossref
Authors: Zimu Li, Han Zheng, Junyu Liu, Liang Jiang, Zi-Wen Liu

Year

2024

Paper ID

13883

Status

Peer-reviewed

Abstract Read

~2 min

Abstract Words

272

Citations

N/A

Abstract

The generation of k-designs (pseudorandom distributions that emulate the Haar measure up to k moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive understanding of this problem for ordinary random circuits, the crucial situations in which symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. Here, we construct explicit local unitary ensembles that can achieve high-order unitary k-designs under transversal continuous symmetry, in the particularly important SU(d) case. Specifically, we define the convolutional quantum alternating (CQA) group generated by 4-local SU(d)-symmetric Hamiltonians as well as associated 4-local SU(d)-symmetric random unitary circuit ensembles and prove that they form and converge to SU(d)-symmetric k-designs, respectively, for all k<n(n−3)/2, with n being the number of qudits. A key technique that we employ to obtain the results is the Okounkov-Vershik approach to Sn representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and the Sn branching rule. We provide strong evidence for a subconstant spectral gap and certain convergence time scales of various important circuit architectures, which contrast with the symmetry-free case. We also provide comprehensive explanations of the difficulties and limitations in rigorously analyzing the convergence time using methods that have been effective for cases without symmetries, including Knabe’s local gap threshold and Nachtergaele’s martingale methods. This suggests that a novel approach is likely necessary for understanding the convergence time of SU(d)-symmetric local random circuits. Published by the American Physical Society 2024

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.
  • The generation of k-designs (pseudorandom distributions that emulate the Haar measure up to k moments) with local quantum circuit ensembles is a problem of fundamental...

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.

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

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.