Magic of Random Matrix Product States

• URL: http://arxiv.org/abs/2211.10350v3
• Date: Fri, 29 Mar 2024 17:36:36 GMT
• Title: Magic of Random Matrix Product States
• Authors: Liyuan Chen, Roy J. Garcia, Kaifeng Bu, Arthur Jaffe,
• Abstract summary: We study the magic of the $1$-dimensional Random Matrix Product States (RMPSs) using the $L_1$-norm measure. Our numerical results confirm that the magic grows exponentially in the qubit case.
• Score: 0.5231056284485742
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the $1$-dimensional Random Matrix Product States (RMPSs) using the $L_{1}$-norm measure. We firstly relate the $L_{1}$-norm to the $L_{4}$-norm. We then employ a unitary $4$-design to map the $L_{4}$-norm to a $24$-component statistical physics model. By evaluating partition functions of the model, we obtain a lower bound on the expectation values of the $L_{1}$-norm. This bound grows exponentially with respect to the qudit number $n$, indicating that the $1$D RMPS is highly magical. Our numerical results confirm that the magic grows exponentially in the qubit case.

Related papers

• A Quantum Computational Determination of the Weak Mixing Angle in the Standard Model [0.688204255655161]
  Non-stabilizerness - the magic - characterizes the computational advantage of a quantum system over classical computers.<n>We compute and minimize the magic production as a function of $s2_W$ in the Mo ller scattering $e-e-to e-e-$, which is free of kinematic thresholds.<n>The finding suggests the electroweak sector of the Standard Model tends to generate minimal quantum resources from the computational viewpoint.
  arXiv  Detail & Related papers  (2025-09-22T18:00:01Z)
• Maximal Magic for Two-qubit States [0.0]
  We investigate two-qubit states with maximal magic, which are most distinct from classical simulability. We reveal a striking interplay between magic and entanglement: the entanglement of maximal magic states is restricted to two possible values.
  arXiv  Detail & Related papers  (2025-02-24T19:00:00Z)
• Independent stabilizer Rényi entropy and entanglement fluctuations in random unitary circuits [1.2815904071470707]
  We investigate numerically the joint distribution of magic ($M$) and entanglement ($S$) in $N$-qubit Haar-random quantum states. The distribution $P_N(M,S)$ as well as the marginals become exponentially localized. Although exponentially many states with magic $M=0$ and entropy $Sapprox S_textHaar$ exist, they represent an exponentially small fraction compared to typical quantum states.
  arXiv  Detail & Related papers  (2025-01-20T13:39:28Z)
• Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms [50.15964512954274]
  We study the problem of residual error estimation for matrix and vector norms using a linear sketch. We demonstrate that this gives a substantial advantage empirically, for roughly the same sketch size and accuracy as in previous work. We also show an $Omega(k2/pn1-2/p)$ lower bound for the sparse recovery problem, which is tight up to a $mathrmpoly(log n)$ factor.
  arXiv  Detail & Related papers  (2024-08-16T02:33:07Z)
• Quantum State Designs with Clifford Enhanced Matrix Product States [0.0]
  Nonstabilizerness, or magic', is a critical quantum resource that characterizes the non-trivial complexity of quantum states. We show that Clifford enhanced Matrix Product States ($mathcalC$MPS) can approximate $4$-spherical designs with arbitrary accuracy.
  arXiv  Detail & Related papers  (2024-04-29T14:50:06Z)
• Layered State Discovery for Incremental Autonomous Exploration [106.37656068276901]
  Layered Autonomous Exploration (LAE) is a novel algorithm for AX that attains a sample complexity of $tildemathcalO(LSrightarrow_LAln12(Srightarrow_LAln12(Srightarrow_LAln12(Srightarrow_LAln12(Srightar row_LAln12(Srightarrow_LAln12
  arXiv  Detail & Related papers  (2023-02-07T22:58:12Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Testing matrix product states [5.225550006603552]
  We study the problem of testing whether an unknown state $|psirangle$ is a matrix product state (MPS) in the property testing model. MPS are a class of physically-relevant quantum states which arise in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2022-01-05T21:10:50Z)
• Random matrices in service of ML footprint: ternary random features with no performance loss [55.30329197651178]
  We show that the eigenspectrum of $bf K$ is independent of the distribution of the i.i.d. entries of $bf w$. We propose a novel random technique, called Ternary Random Feature (TRF) The computation of the proposed random features requires no multiplication and a factor of $b$ less bits for storage compared to classical random features.
  arXiv  Detail & Related papers  (2021-10-05T09:33:49Z)
• Spectral properties of sample covariance matrices arising from random matrices with independent non identically distributed columns [50.053491972003656]
  It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$. Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
  arXiv  Detail & Related papers  (2021-09-06T14:21:43Z)
• Entanglement scaling for $\lambda\phi_2^4$ [0.0]
  We show that the order parameter $phi$, the correlation length $xi$ and quantities like $phi3$ and the entanglement entropy exhibit useful double scaling properties. We find the value $alpha_c=11.09698(31)$ for the critical point, improving on previous results.
  arXiv  Detail & Related papers  (2021-04-21T14:43:12Z)
• Improved Weak Simulation of Universal Quantum Circuits by Correlated $L_1$ Sampling [0.0]
  Weak simulation is often called weak simulation and is a way to determine when they confer a quantum advantage. We constructively tighten the upper bound on the worst-case $L_$ norm sampling cost to next order in $t$ from $mathcal O(xit delta-2)$. This is the first weak simulation algorithm that has lowered this bound's dependence on finite $t$ in the worst-case to our knowledge.
  arXiv  Detail & Related papers  (2021-04-15T05:50:11Z)
• Sparse sketches with small inversion bias [79.77110958547695]
  Inversion bias arises when averaging estimates of quantities that depend on the inverse covariance. We develop a framework for analyzing inversion bias, based on our proposed concept of an $(epsilon,delta)$-unbiased estimator for random matrices. We show that when the sketching matrix $S$ is dense and has i.i.d. sub-gaussian entries, the estimator $(epsilon,delta)$-unbiased for $(Atop A)-1$ with a sketch of size $m=O(d+sqrt d/
  arXiv  Detail & Related papers  (2020-11-21T01:33:15Z)
• Improved Simulation of Quantum Circuits by Fewer Gaussian Eliminations [0.0]
  We show that the cost of strong simulation of quantum circuits using $t$ $T$ gate magic states exhibits non-trivial reductions on its upper bound. This agrees with previous numerical bounds found for qubits.
  arXiv  Detail & Related papers  (2020-03-02T19:00:04Z)
• Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness [151.67113334248464]
  We show that extending the smoothing technique to defend against other attack models can be challenging. We present experimental results on CIFAR to validate our theory.
  arXiv  Detail & Related papers  (2020-02-08T22:02:14Z)

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.