Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers

• URL: http://arxiv.org/abs/2206.13040v1
• Date: Mon, 27 Jun 2022 04:22:30 GMT
• Title: Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers
• Authors: Lane G. Gunderman
• Abstract summary: We prove the obtainable lower-bound for the number of qubits needed to represent such Pauli operations. We provide a procedure for determining such a set of minimal register Pauli operations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Transformations which convert between Fermionic modes and qubit operations have become a ubiquitous tool in quantum algorithms for simulating systems. Similarly, collections of Pauli operators might be obtained from solutions of non-local games and satisfiability problems. Drawing on ideas from entanglement-assisted quantum error-correcting codes and quantum convolutional codes, we prove the obtainable lower-bound for the number of qubits needed to represent such Pauli operations which are equivalent and provide a procedure for determining such a set of minimal register Pauli operations.

Related papers

• Efficiently manipulating Pauli strings with PauliArray [0.0]
  Pauli matrices and Pauli strings are widely used in quantum computing. It is important to have a well-rounded, versatile and efficient tool to handle a large number of Pauli strings and operators expressed in this basis. This library introduces data structures to represent arrays of Pauli strings and operators as well as various methods to modify and combine them.
  arXiv  Detail & Related papers  (2024-05-29T17:18:08Z)
• Existence of Pauli-like stabilizers for every quantum error-correcting code [0.0]
  We will show that every quantum error-correcting code has a similar structure, in that the code can be stabilized by commutative Paulian'' operators. Examples concerning codeword stabilized codes and bosonic codes will be presented.
  arXiv  Detail & Related papers  (2023-08-29T17:01:17Z)
• Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation [0.0]
  We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps. A parametrized quantum circuit is employed to accommodate for dynamical maps.
  arXiv  Detail & Related papers  (2023-07-31T22:57:29Z)
• Unitary Complexity and the Uhlmann Transformation Problem [41.67228730328207]
  We introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes. We use this framework to study the complexity of transforming one entangled state into another via local operations. Our framework for unitary complexity thus provides new avenues for studying the computational complexity of many natural quantum information processing tasks.
  arXiv  Detail & Related papers  (2023-06-22T17:46:39Z)
• Fast Partitioning of Pauli Strings into Commuting Families for Optimal Expectation Value Measurements of Dense Operators [0.0]
  Pauli strings appearing in the decomposition of an operator can be can be grouped into commuting families. We detail an algorithm to completely partition the full set of Pauli strings acting on any number of qubits into the minimal number of sets of commuting families.
  arXiv  Detail & Related papers  (2023-05-19T17:39:33Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)
• 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)

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.