Full classification of Pauli Lie algebras

• URL: http://arxiv.org/abs/2408.00081v1
• Date: Wed, 31 Jul 2024 18:00:11 GMT
• Title: Full classification of Pauli Lie algebras
• Authors: Gerard Aguilar, Simon Cichy, Jens Eisert, Lennart Bittel,
• Abstract summary: We provide a comprehensive classification of Lie algebras generated by an arbitrary set of Pauli operators. We find a no-go result for the existence of small Lie algebras beyond the free-fermionic case in the Pauli setting. These results bear significant impact in ideas in a number of fields like quantum control, quantum machine learning, or classical simulation of quantum circuits.
• Score: 0.29998889086656577
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Lie groups, and therefore Lie algebras, are fundamental structures in quantum physics that determine the space of possible trajectories of evolving systems. However, classification and characterization methods for these structures are often impractical for larger systems. In this work, we provide a comprehensive classification of Lie algebras generated by an arbitrary set of Pauli operators, from which an efficient method to characterize them follows. By mapping the problem to a graph setting, we identify a reduced set of equivalence classes: the free-fermionic Lie algebra, the set of all anti-symmetric Paulis on n qubits, the Lie algebra of symplectic Paulis on n qubits, and the space of all Pauli operators on n qubits, as well as controlled versions thereof. Moreover, out of these, we distinguish 6 Clifford inequivalent cases and find a simple set of canonical operators for each, which allow us to give a physical interpretation of the dynamics of each class. Our findings reveal a no-go result for the existence of small Lie algebras beyond the free-fermionic case in the Pauli setting and offer efficiently computable criteria for universality and extendibility of gate sets. These results bear significant impact in ideas in a number of fields like quantum control, quantum machine learning, or classical simulation of quantum circuits.

Related papers

• Efficient classical simulation of quantum computation beyond Wigner positivity [0.0]
  We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits.
  arXiv  Detail & Related papers  (2024-07-14T22:25:13Z)
• The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems [0.7673339435080445]
  We study the structure of the qudit Pauli group for any, including composite, $d$ in several ways. For any specified set of commutation relations, we construct a set of qudit Paulis satisfying those relations. We also study the maximum size of sets of Paulis that mutually non-commute and sets that non-commute in pairs.
  arXiv  Detail & Related papers  (2023-02-15T22:06:40Z)
• Quantum Supermaps are Characterized by Locality [0.6445605125467572]
  We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. We do so by providing a simple definition of locally-applicable transformation on a monoidal category. In our main technical contribution, we use this diagrammatic representation to show that locally-applicable transformations on quantum channels are in one-to-one correspondence with deterministic quantum supermaps.
  arXiv  Detail & Related papers  (2022-05-19T20:36:33Z)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• Classical shadows with Pauli-invariant unitary ensembles [0.0]
  We consider the class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator. Our results pave the way for more efficient or robust protocols for predicting important properties of quantum states.
  arXiv  Detail & Related papers  (2022-02-07T15:06:30Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters [1.0587959762260986]
  Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis. In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters. We show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry.
  arXiv  Detail & Related papers  (2020-03-30T16:29:40Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

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.