SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning

• URL: http://arxiv.org/abs/2309.16556v2
• Date: Wed, 4 Oct 2023 14:37:13 GMT
• Title: SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning
• Authors: Zimu Li, Han Zheng, Yunfei Wang, Liang Jiang, Zi-Wen Liu, Junyu Liu
• Abstract summary: 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.
• Score: 11.861283136635837
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum information processing in the presence of continuous symmetry is of wide importance and exhibits many novel physical and mathematical phenomena. SU(d) is a continuous symmetry group of particular interest since it represents a fundamental type of non-Abelian symmetry and also plays a vital role in quantum computation. Here, we explicate the applications of SU(d)-symmetric random unitaries in three different contexts ranging from physics to quantum computing: information scrambling with non-Abelian conserved quantities, covariant quantum error correcting random codes, and geometric quantum machine learning. First, we show that, in the presence of SU(d) symmetry, the local conserved quantities would exhibit residual values even at $t \rightarrow \infty$ which decays as $\Omega(1/n^{3/2})$ under local Pauli basis for qubits and $\Omega(1/n^{(d+2)^2/2})$ under local symmetric basis for general qudits with respect to the system size, in contrast to $O(1/n)$ decay for U(1) case and the exponential decay for no-symmetry case in the sense of out-of-time ordered correlator (OTOC). Second, we show that SU(d)-symmetric unitaries can be used to construct asymptotically optimal (in the sense of saturating the fundamental limits on the code error that have been called the approximate Eastin-Knill theorems) SU(d)-covariant codes that encodes any constant $k$ logical qudits, extending [Kong \& Liu; PRXQ 3, 020314 (2022)]. Finally, we derive an overpartameterization threshold via the quantum neural tangent kernel (QNTK) required for exponential convergence guarantee of generic ansatz for geometric quantum machine learning, which reveals that the number of parameters required scales only with the dimension of desired subspaces rather than that of the entire Hilbert space. We expect that our work invites further research on quantum information with continuous symmetries.

Related papers

• Hilbert space geometry and quantum chaos [39.58317527488534]
  We consider the symmetric part of the QGT for various multi-parametric random matrix Hamiltonians. We find for a two-dimensional parameter space that, while the ergodic phase corresponds to the smooth manifold, the integrable limit marks itself as a singular geometry with a conical defect.
  arXiv  Detail & Related papers  (2024-11-18T19:00:17Z)
• Symmetry: a fundamental resource for quantum coherence and metrology [0.0]
  We show that when the quantum state is an eigenstate of an operator $A$, observables $G$ which are completely off-diagonal have purely quantum fluctuations. This property holds regardless of the purity of the quantum state, and it implies that off-diagonal fluctuations represent a metrological resource for phase estimation.
  arXiv  Detail & Related papers  (2024-07-01T07:19:37Z)
• Solving the homogeneous Bethe-Salpeter equation with a quantum annealer [34.173566188833156]
  The homogeneous Bethe-Salpeter equation (hBSE) was solved for the first time by using a D-Wave quantum annealer. A broad numerical analysis of the proposed algorithms was carried out using both the proprietary simulated-anneaing package and the D-Wave Advantage 4.1 system.
  arXiv  Detail & Related papers  (2024-06-26T18:12:53Z)
• Designs from Local Random Quantum Circuits with SU(d) Symmetry [10.563048698227115]
  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.
  arXiv  Detail & Related papers  (2023-09-15T04:41:10Z)
• 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)
• Solomon equations for qubit and two-level systems: Insights into non-Poissonian quantum jumps [41.94295877935867]
  We measure and model the combined relaxation of a qubit coupled to a discrete two-level system(TLS) environment. If the TLSs are much longer-lived than the qubit, non-exponential relaxation and non-Poissonian quantum jumps can be observed.
  arXiv  Detail & Related papers  (2023-07-13T16:51:29Z)
• Quantum Current and Holographic Categorical Symmetry [62.07387569558919]
  A quantum current is defined as symmetric operators that can transport symmetry charges over an arbitrary long distance. The condition for quantum currents to be superconducting is also specified, which corresponds to condensation of anyons in one higher dimension.
  arXiv  Detail & Related papers  (2023-05-22T11:00:25Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• 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)
• Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries [1.2183405753834557]
  We analytically study the most essential cases of $U(1)$ and $SU(d)$ symmetries. We show that for both symmetry groups the error of the covariant codes generated by Haar-random symmetric unitaries, typically scale as $O(n-1)$ in terms of both the average- and worst-case distances against erasure noise.
  arXiv  Detail & Related papers  (2021-12-02T18:46:34Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.