The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser
Formalism with Arbitrary Phases
- URL: http://arxiv.org/abs/2203.00103v3
- Date: Tue, 20 Sep 2022 06:17:37 GMT
- Title: The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser
Formalism with Arbitrary Phases
- Authors: Mark A. Webster, Benjamin J. Brown, Stephen D. Bartlett
- Abstract summary: XP stabiliser formalism allows for a wider range of states and codespaces to be represented.
We describe the states which arise in the formalism, and demonstrate an equivalence between XP stabiliser states and 'weighted hypergraph states'
- Score: 3.222802562733787
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We propose an extension to the Pauli stabiliser formalism that includes
fractional $2\pi/N$ rotations around the $Z$ axis for some integer $N$. The
resulting generalised stabiliser formalism - denoted the XP stabiliser
formalism - allows for a wider range of states and codespaces to be
represented. We describe the states which arise in the formalism, and
demonstrate an equivalence between XP stabiliser states and 'weighted
hypergraph states' - a generalisation of both hypergraph and weighted graph
states. Given an arbitrary set of XP operators, we present algorithms for
determining the codespace and logical operators for an XP code. Finally, we
consider whether measurements of XP operators on XP codes can be classically
simulated.
Related papers
- Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes.
We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
arXiv Detail & Related papers (2024-06-17T20:48:43Z) - Extracting topological orders of generalized Pauli stabilizer codes in
two dimensions [5.593891873998947]
We introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems.
The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
arXiv Detail & Related papers (2023-12-18T13:18:19Z) - Bases for optimising stabiliser decompositions of quantum states [14.947570152519281]
We introduce and study the vector space of linear dependencies of $n$-qubit stabiliser states.
We construct elegant bases of linear dependencies of constant size three.
We use them to explicitly compute the stabiliser extent of states of more qubits than is feasible with existing techniques.
arXiv Detail & Related papers (2023-11-29T06:30:05Z) - Quantum Lego and XP Stabilizer Codes [1.8087157239832479]
We apply the recent graphical framework of ''quantum lego'' to XP stabilizer codes.
We show that the idea of operator matching continues to hold for such codes.
We provide an efficient classical algorithm for tracking these symmetries.
arXiv Detail & Related papers (2023-10-30T13:44:39Z) - CP-BCS: Binary Code Summarization Guided by Control Flow Graph and
Pseudo Code [79.87518649544405]
We present a control flow graph and pseudo code guided binary code summarization framework called CP-BCS.
CP-BCS utilizes a bidirectional instruction-level control flow graph and pseudo code that incorporates expert knowledge to learn the comprehensive binary function execution behavior and logic semantics.
arXiv Detail & Related papers (2023-10-24T14:20:39Z) - Taming the Exponential Action Set: Sublinear Regret and Fast Convergence
to Nash Equilibrium in Online Congestion Games [29.384748500302678]
We study the online formulation of congestion games, where agents participate in the game repeatedly and observe feedback with randomness.
We propose CongestEXP, a decentralized algorithm that applies the classic exponential weights method.
We show that CongestEXP attains a regret upper bound of $O(kFsqrtT)$ for every individual player, where $T$ is the time horizon.
arXiv Detail & Related papers (2023-06-19T03:03:44Z) - Error-correcting codes for fermionic quantum simulation [4.199246521960609]
We present methodologies for fermions via qubit systems on a two-dimensional lattice algorithm.
We identify a family of stabilizer codes suitable for fermion simulation.
Our method can increase the code distances without decreasing the (fermionic) code rate.
arXiv Detail & Related papers (2022-10-16T01:43:07Z) - Improved Graph Formalism for Quantum Circuit Simulation [77.34726150561087]
We show how to efficiently simplify stabilizer states to canonical form.
We characterize all linearly dependent triplets, revealing symmetries in the inner products.
Using our novel controlled-Pauli $Z$ algorithm, we improve runtime for inner product computation from $O(n3)$ to $O(nd2)$ where $d$ is the maximum degree of the graph.
arXiv Detail & Related papers (2021-09-20T05:56:25Z) - 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) - Learning Stabilizing Controllers for Unstable Linear Quadratic
Regulators from a Single Trajectory [85.29718245299341]
We study linear controllers under quadratic costs model also known as linear quadratic regulators (LQR)
We present two different semi-definite programs (SDP) which results in a controller that stabilizes all systems within an ellipsoid uncertainty set.
We propose an efficient data dependent algorithm -- textsceXploration -- that with high probability quickly identifies a stabilizing controller.
arXiv Detail & Related papers (2020-06-19T08:58:57Z) - Provably Efficient Safe Exploration via Primal-Dual Policy Optimization [105.7510838453122]
We study the Safe Reinforcement Learning (SRL) problem using the Constrained Markov Decision Process (CMDP) formulation.
We present an provably efficient online policy optimization algorithm for CMDP with safe exploration in the function approximation setting.
arXiv Detail & Related papers (2020-03-01T17:47:03Z)
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.