Designs from Local Random Quantum Circuits with SU(d) Symmetry

• URL: http://arxiv.org/abs/2309.08155v3
• Date: Mon, 30 Dec 2024 08:06:03 GMT
• Title: Designs from Local Random Quantum Circuits with SU(d) Symmetry
• Authors: Zimu Li, Han Zheng, Junyu Liu, Liang Jiang, Zi-Wen Liu,
• Abstract summary: We construct, for the first time, explicit local unitary ensembles that can achieve high-order unitary $k$-designs under continuous symmetry. Specifically, we define the Convolutional Quantum Alternating group (CQA) generated by 4-local SU$(d)$-symmetric Hamiltonians. We 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.
• Score: 10.563048698227115
• License:
• 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 where symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. We construct, for the first time, 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 group (CQA) 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 $S_n$ representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and $S_n$ 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.

Related papers

• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies. We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency. We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Variational Quantum Simulation of Anyonic Chains [0.0]
  Anyonic chains provide lattice realizations of a rich set of quantum field theories in two space-time dimensions. The described quantum simulation scheme provides a systematic approach to give rise to a large family of quantum field theories.
  arXiv  Detail & Related papers  (2024-12-23T18:39:28Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning [11.861283136635837]
  We show that in the presence of SU(d) symmetry, the local conserved quantities would exhibit residual values even at $t rightarrow infty$. We also show that SU(d)-symmetric unitaries can be used to constructally optimal codes. We derive an overpartameterization threshold via the quantum neural kernel.
  arXiv  Detail & Related papers  (2023-09-28T16:12:31Z)
• A quantum tug of war between randomness and symmetries on homogeneous spaces [0.0]
  We consider states as $H$-equivalent if related by a symmetry transformation characterized by the group $H$. We introduce the Haar measure on the homogeneous space $mathbbU/H$, characterizing true randomness for $H$-equivalent systems.
  arXiv  Detail & Related papers  (2023-09-11T06:06:31Z)
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans\"atze [13.651587339535961]
  We develop a framework for convolutional quantum circuits with SU$(d)$symmetry. We prove Harrow's statement on equivalence between $nameSU(d)$ and $S_n$ irrep bases.
  arXiv  Detail & Related papers  (2021-12-14T18:03:43Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions [0.0]
  We show that $1D$ random quantum circuits have a spectral gap scaling as $Omega(n-1)$, provided that $t$ is small compared to the local dimension: $t2leq O(q)$. Our second result is an unconditional spectral gap bounded below by $Omega(n-1log-1(n) t-alpha(q))$ for random quantum circuits with all-to-all interactions.
  arXiv  Detail & Related papers  (2020-12-09T19:00:50Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.