Irreducible multi-partite correlations as an order parameter for k-local nontrivial states

• URL: http://arxiv.org/abs/2106.05269v1
• Date: Wed, 9 Jun 2021 18:00:00 GMT
• Title: Irreducible multi-partite correlations as an order parameter for k-local nontrivial states
• Authors: Yahya Alavirad, Ali Lavasani
• Abstract summary: We look for a non-geometric quantity that can capture k-local non-triviality of a given state. We introduce an order parameter designed to capture such correlations. We discuss general relations between this order parameter and the erasure thresholds of quantum error correcting codes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Geometrically nontrivial quantum states can be defined as states that cannot be prepared by a constant depth geometrically local unitary circuit starting from a product state. However, for topological phases, as well as a large class of quantum error correcting codes without an underlying geometric structure, the required circuit depth remains infinite even if we replace the condition of geometric locality with the weaker condition of k-locality. Motivated by this observation, we look for a non-geometric quantity that can capture k-local non-triviality of a given state, for example, we ask if it is possible to distinguish the ground state of the toric code from a trivial state without having access to the position label of the qubits. We observe that a fundamental property of k-local nontrivial states is the presence of irreducible many-partite correlations shared between an infinitely large number of randomly chosen parties, i.e. correlations that cannot be inferred by accessing only a finite number of parties. We introduce an order parameter designed to capture such correlations. We demonstrate the utility of our order parameter by applying it to a wide variety of examples: The toric code on a square lattice, random stabilizer states, quantum expander codes, and a particular holographic stabilizer state. We discuss general relations between this order parameter and the erasure thresholds of quantum error correcting codes as well as the classical bond percolation problem.

Related papers

• LDPC stabilizer codes as gapped quantum phases: stability under graph-local perturbations [0.025206105035672277]
  We generalize the proof of stability of topological order, due to Bravyi, Hastings and Michalakis, to Hamiltonians corresponding to low-density parity check codes. We show that LDPC codes very generally define stable gapped quantum phases, even in the non-Euclidean setting.
  arXiv  Detail & Related papers  (2024-11-04T18:52:44Z)
• Sample-Optimal Quantum State Tomography for Structured Quantum States in One Dimension [25.333797381352973]
  We study whether the number of state copies can saturate the information theoretic bound (i.e., $O(n)$) using physical quantum measurements. We propose a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem and show that it can efficiently find an estimate with bounded recovery error.
  arXiv  Detail & Related papers  (2024-10-03T15:26:26Z)
• An analog of topological entanglement entropy for mixed states [0.3749861135832073]
  We show that co(QCMI) is non-increasing with increasing decoherence when Kraus operators are proportional to the product of onsite unitaries. For the 2d toric code decohered by onsite bit/phase-flip noise, we show that co(QCMI) is non-zero below the error-recovery threshold and zero above it. We conjecture and provide evidence that in this example, co(QCMI) equals TEE of a recently introduced pure state.
  arXiv  Detail & Related papers  (2024-07-30T02:26:45Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Intrinsic Mixed-state Quantum Topological Order [4.41737598556146]
  We show that decoherence can give rise to new types of topological order. We construct concrete examples by proliferating fermionic anyons in the toric code via local quantum channels. The resulting mixed states retain long-range entanglement, which manifests in the nonzero topological entanglement negativity.
  arXiv  Detail & Related papers  (2023-07-25T18:34:10Z)
• Simulating scalar field theories on quantum computers with limited resources [62.997667081978825]
  We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers. The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
  arXiv  Detail & Related papers  (2022-10-14T17:28:15Z)
• Hierarchy of topological order from finite-depth unitaries, measurement and feedforward [0.0]
  Single-site measurements provide a loophole, allowing for finite-time state preparation in certain cases. We show how this observation imposes a complexity hierarchy on long-range entangled states based on the minimal number of measurement layers required to create the state, which we call "shots" This hierarchy paints a new picture of the landscape of long-range entangled states, with practical implications for quantum simulators.
  arXiv  Detail & Related papers  (2022-09-13T17:55:36Z)
• Geometrical Rabi oscillations and Landau-Zener transitions in non-Abelian systems [0.0]
  We propose universal protocols to determine quantum geometric properties in non-Abelian systems. Our schemes suggest a way to prepare eigenstates of the quantum metric.
  arXiv  Detail & Related papers  (2021-05-06T14:09:52Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)

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.