On The Stabilizer Formalism And Its Generalization

• URL: http://arxiv.org/abs/2309.09815v1
• Date: Mon, 18 Sep 2023 14:36:45 GMT
• Title: On The Stabilizer Formalism And Its Generalization
• Authors: \'Eloi Descamps and Borivoje Daki\'c
• Abstract summary: The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable. We prove that if the closure of the stabilizing set is dense in the set of $SU(d)$ transformations, then the associated Clifford group is trivial. We conjecture that a large class of generalized stabilizer states are equivalent to the standard ones.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem. This work analyzes the mathematical structure behind this theorem to find possible generalizations and derivation of constraints required for constructing a non-trivial generalized Clifford group. We prove that if the closure of the stabilizing set is dense in the set of $SU(d)$ transformations, then the associated Clifford group is trivial, consisting only of local gates and permutations of subsystems. This result demonstrates the close relationship between the density of the stabilizing set and the simplicity of the corresponding Clifford group. We apply the analysis to investigate stabilization with binary observables for qubits and find that the formalism is equivalent to the standard stabilization for a low number of qubits. Based on the observed patterns, we conjecture that a large class of generalized stabilizer states are equivalent to the standard ones. Our results can be used to construct novel Gottesman-Knill-type results and consequently draw a sharper line between quantum and classical computation.

Related papers

• Operator space fragmentation in perturbed Floquet-Clifford circuits [0.0]
  Floquet quantum circuits are able to realise a wide range of non-equilibrium quantum states. We investigate the stability of operator localisation and emergence of chaos in random Floquet-Clifford circuits.
  arXiv  Detail & Related papers  (2024-08-02T19:18:30Z)
• The Structure of the Majorana Clifford Group [0.0]
  In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits) A crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system in which the fundamental degrees of freedom are fermionic. We prove that the subgroup of parity-preserving fermionic Cliffords can be represented by the group over the binary field $mathbbF$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code.
  arXiv  Detail & Related papers  (2024-07-16T02:20:14Z)
• Covariant operator bases for continuous variables [0.0]
  We work out an alternative basis consisting of monomials on the basic observables, with the crucial property of behaving well under symplectic transformations. Given the density matrix of a state, the expansion coefficients in that basis constitute the multipoles, which describe the state in a canonically covariant form that is both concise and explicit.
  arXiv  Detail & Related papers  (2023-09-18T18:00:15Z)
• Simulating quantum circuit expectation values by Clifford perturbation theory [0.0]
  We consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations. We introduce a perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture. Results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approxing expectation values of large near-Clifford circuits.
  arXiv  Detail & Related papers  (2023-06-07T21:42:10Z)
• Lipschitz Continuity Retained Binary Neural Network [52.17734681659175]
  We introduce the Lipschitz continuity as the rigorous criteria to define the model robustness for BNN. We then propose to retain the Lipschitz continuity as a regularization term to improve the model robustness. Our experiments prove that our BNN-specific regularization method can effectively strengthen the robustness of BNN.
  arXiv  Detail & Related papers  (2022-07-13T22:55:04Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Controlling the Complexity and Lipschitz Constant improves polynomial nets [55.121200972539114]
  We derive new complexity bounds for the set of Coupled CP-Decomposition (CCP) and Nested Coupled CP-decomposition (NCP) models of Polynomial Nets. We propose a principled regularization scheme that we evaluate experimentally in six datasets and show that it improves the accuracy as well as the robustness of the models to adversarial perturbations.
  arXiv  Detail & Related papers  (2022-02-10T14:54:29Z)
• Non-standard entanglement structure of local unitary self-dual models as a saturated situation of repeatability in general probabilistic theories [61.12008553173672]
  We show the existence of infinite structures of quantum composite system such that it is self-dual with local unitary symmetry. We also show the existence of a structure of quantum composite system such that non-orthogonal states in the structure are perfectly distinguishable.
  arXiv  Detail & Related papers  (2021-11-29T23:37:58Z)
• Stability of Neural Networks on Manifolds to Relative Perturbations [118.84154142918214]
  Graph Neural Networks (GNNs) show impressive performance in many practical scenarios. GNNs can scale well on large size graphs, but this is contradicted by the fact that existing stability bounds grow with the number of nodes.
  arXiv  Detail & Related papers  (2021-10-10T04:37:19Z)
• Stability Analysis of Quantum Systems: a Lyapunov Criterion and an Invariance Principle [1.7360163137925997]
  We show that the set of invariant density operators is both closed and convex. We then show how to analyze the stability of this set via a candidate Lyapunov operator.
  arXiv  Detail & Related papers  (2020-08-01T06:53:20Z)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54:43Z)

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.