Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits

• URL: http://arxiv.org/abs/2507.05989v1
• Date: Tue, 08 Jul 2025 13:49:53 GMT
• Title: Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits
• Authors: Shuo Qi, Wen-Jun Li, Gang Su, Shi-Ju Ran,
• Abstract summary: We present a class of multipartite entanglement measures that incorporate the matrix product state representation.<n>These measures are dubbed as $chi$-specified matrix product entanglement ($chi$-MPE)<n>Our results establish tensor networks as a powerful and general tool for developing parametrized measures of multipartite entanglement.
• Score: 1.9443029989289298
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multipartite entanglement offers a powerful framework for understanding the complex collective phenomena in quantum many-body systems that are often beyond the description of conventional bipartite entanglement measures. Here, we propose a class of multipartite entanglement measures that incorporate the matrix product state (MPS) representation, enabling the characterization of the optimality of quantum circuits for state preparation. These measures are defined as the minimal distances from a target state to the manifolds of MPSs with specified virtual bond dimensions $\chi$, and thus are dubbed as $\chi$-specified matrix product entanglement ($\chi$-MPE). We demonstrate superlinear, linear, and sublinear scaling behaviors of $\chi$-MPE with respect to the negative logarithmic fidelity $F$ in state preparation, which correspond to excessive, optimal, and insufficient circuit depth $D$ for preparing $\chi$-virtual-dimensional MPSs, respectively. Specifically, a linearly-growing $\chi$-MPE with $F$ suggests $\mathcal{H}_{\chi} \simeq \mathcal{H}_{D}$, where $\mathcal{H}_{\chi}$ denotes the manifold of the $\chi$-virtual-dimensional MPSs and $\mathcal{H}_{D}$ denotes that of the states accessible by the $D$ layer circuits. We provide an exact proof that $\mathcal{H}_{\chi=2} \equiv \mathcal{H}_{D=1}$. Our results establish tensor networks as a powerful and general tool for developing parametrized measures of multipartite entanglement. The matrix product form adopted in $\chi$-MPE can be readily extended to other tensor network ans\"atze, whose scaling behaviors are expected to assess the optimality of quantum circuit in preparing the corresponding tensor network states.

Related papers

• Scaling Up Liquid-Resistance Liquid-Capacitance Networks for Efficient Sequence Modeling [53.925413758281096]
  We present LrcSSM, a $textitnonlinear$ recurrent model that processes long sequences as fast as today's linear state-space layers.<n>LrcSSM offers a formal gradient-stability guarantee that other input-varying systems such as Liquid-S4 and Mamba do not provide.<n>We show that on a series of long-range forecasting tasks, LrcSSM outperforms LRU, S5 and Mamba.
  arXiv  Detail & Related papers  (2025-05-27T20:02:59Z)
• A Unified Variational Framework for Quantum Excited States [2.935517095941649]
  We introduce a novel variational principle that overcomes limitations, enabling the textitsimultaneous determination of multiple low-energy excited states.<n>We demonstrate the power and generality of this method across diverse physical systems and variational ansatzes.<n>In all applications, the method accurately and simultaneously obtains multiple lowest-lying energy levels and their corresponding states.
  arXiv  Detail & Related papers  (2025-04-30T09:28:04Z)
• Scalable simulation of random quantum circuits using projected entangled-pair states [0.0]
  We use the simple update of projected entangled-pair states (PEPSs) in the Vidal gauge to simulate the states of random quantum circuits (RQCs)<n>We find the universal scaling behaviors of the state fidelity by performing large-scale simulations for $n leq 104$ or $chi leq 128$ on a conventional CPU.
  arXiv  Detail & Related papers  (2025-04-07T06:47:48Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Hamiltonian Mechanics of Feature Learning: Bottleneck Structure in Leaky ResNets [58.460298576330835]
  We study Leaky ResNets, which interpolate between ResNets and Fully-Connected nets depending on an 'effective depth'<n>We leverage this intuition to explain the emergence of a bottleneck structure, as observed in previous work.
  arXiv  Detail & Related papers  (2024-05-27T18:15:05Z)
• 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)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Sample Complexity of Neural Policy Mirror Descent for Policy Optimization on Low-Dimensional Manifolds [75.51968172401394]
  We study the sample complexity of the neural policy mirror descent (NPMD) algorithm with deep convolutional neural networks (CNN) In each iteration of NPMD, both the value function and the policy can be well approximated by CNNs. We show that NPMD can leverage the low-dimensional structure of state space to escape from the curse of dimensionality.
  arXiv  Detail & Related papers  (2023-09-25T07:31:22Z)
• Multi-Unitary Complex Hadamard Matrices [0.0]
  We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. Such matrices find several applications in quantum many-body theory, tensor networks and classification of multipartite quantum entanglement.
  arXiv  Detail & Related papers  (2023-05-30T20:11:18Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Exceptional points and domains of unitarity for a class of strongly non-Hermitian real-matrix Hamiltonians [0.0]
  A Hamiltonian of a closed (i.e., unitary) quantum system is assumed to have an $N$ by $N$ real-matrix form. We describe the quantum phase-transition boundary $partial cal D[N]$ at which the unitarity of the system is lost.
  arXiv  Detail & Related papers  (2021-04-22T12:27:09Z)

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.