Non-trivial Area Operators Require Non-local Magic

• URL: http://arxiv.org/abs/2306.14996v2
• Date: Tue, 3 Sep 2024 01:26:19 GMT
• Title: Non-trivial Area Operators Require Non-local Magic
• Authors: ChunJun Cao,
• Abstract summary: We show that no stabilizer codes over any local dimension can support a non-trivial area operator for any bipartition of physical degrees of freedom. We suggest that non-local "magic" would play an important role in reproducing features of gravitational back-reaction and the quantum extremal surface formula.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We show that no stabilizer codes over any local dimension can support a non-trivial area operator for any bipartition of the physical degrees of freedom even if certain code subalgebras contain non-trivial centers. This conclusion also extends to more general quantum codes whose logical operators satisfy certain factorization properties, including any complementary code that encodes qubits and supports transversal logical gates that form a nice unitary basis. These results support the observation that some desirable conditions for fault tolerance are in tension with emergent gravity and suggest that non-local "magic" would play an important role in reproducing features of gravitational back-reaction and the quantum extremal surface formula. We comment on conditions needed to circumvent the no-go result and examine some simple instances of non-stabilizer codes that do have non-trivial area operators.

Related papers

• An Exact Link between Nonlocal Magic and Operator Entanglement [0.0]
  Nonstabilizerness, commonly referred to as magic, is a quantum property of states associated with the non-Clifford resources required for their preparation. We establish an exact correspondence between the generation of nonlocal magic and operator entanglement under unitary evolutions.
  arXiv  Detail & Related papers  (2025-04-12T22:40:04Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Asymptotically isometric codes for holography [3.6320742399728645]
  The holographic principle suggests that the low energy effective field theory of gravity has far too many states. It is then natural that any quantum error correcting code with such a quantum field theory as the code subspace is not isometric. We show that an isometric code can be recovered in the $N rightarrow infty$ limit when acting on fixed states in the code Hilbert space.
  arXiv  Detail & Related papers  (2022-11-22T17:46:58Z)
• Non-Abelian braiding of graph vertices in a superconducting processor [144.97755321680464]
  Indistinguishability of particles is a fundamental principle of quantum mechanics. braiding of non-Abelian anyons causes rotations in a space of degenerate wavefunctions. We experimentally verify the fusion rules of the anyons and braid them to realize their statistics.
  arXiv  Detail & Related papers  (2022-10-19T02:28:44Z)
• Designing the Quantum Channels Induced by Diagonal Gates [0.5735035463793007]
  Diagonal gates play an important role in implementing a universal set of quantum operations. This paper describes the process of preparing a code state, applying a diagonal physical gate, measuring a code syndrome, and applying a Pauli correction.
  arXiv  Detail & Related papers  (2021-09-28T04:39:15Z)
• A source fragmentation approach to interacting quantum field theory [0.0]
  We prove that the time-ordered Vacuum Expectation Values and the S-matrix of a regularized Lagrangian quantum theory can be approximated by a local operator. For the Wightman axioms, this suggests a modification that takes the algebra of measurement operators not to be generated by an operator-valued distribution.
  arXiv  Detail & Related papers  (2021-09-09T16:50:43Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• Fault-tolerant logical gates in holographic stabilizer codes are severely restricted [0.0]
  We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We show that the set of stabilizerly implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems.
  arXiv  Detail & Related papers  (2021-03-24T18:00:05Z)
• On the Tightness of Semidefinite Relaxations for Rotation Estimation [49.49997461835141]
  We show that semidefinite relaxations have been successful in numerous applications in computer vision and robotics. A general framework based on tools from algebraic geometry is introduced for analyzing semidefinite relaxations. We show that for some problem, an appropriate pararization guarantees tight relaxations.
  arXiv  Detail & Related papers  (2021-01-06T15:42:02Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.