Biunitary constructions in quantum information
arXiv:1609.07775 · doi:10.21136/HS.2019.04
Abstract
We present an infinite number of construction schemes involving unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on biunitary connections, algebraic objects which play a central role in the theory of planar algebras. They have an attractive graphical calculus which allows simple correctness proofs for the constructions we present. We apply these techniques to construct a unitary error basis that cannot be built using any previously known method.
48 pages, Mathematica notebook attached; final version
References in corpus (10)
- Connectivity is a Poor Indicator of Fast Quantum Search
- Quasistrict symmetric monoidal 2-categories via wire diagrams
- Planar Para Algebras, Reflection Positivity
- Constructing Mutually Unbiased Bases from Quantum Latin Squares
- A finiteness result for commuting squares of matrix algebras
- On bipartite unitary matrices generating subalgebra-preserving quantum operations
- Higher Quantum Theory
- Subfactors and Hadamard Matrices
- Constructive Simulation and Topological Design of Protocols
- New Construction of Mutually Unbiased Bases in Square Dimensions
Cited by in corpus (22)
- A compositional approach to quantum functions
- Construction and the ergodicity properties of dual unitary quantum circuits
- The algebra of entanglement and the geometry of composition
- Exact dynamics in dual-unitary quantum circuits with projective measurements
- The Morita theory of quantum graph isomorphisms
- Quons: A 3D Language for Quantum Information
- Causal and compositional structure of unitary transformations
- From dual-unitary to biunitary: a 2-categorical model for exactly-solvable many-body quantum dynamics
- Operator dynamics and entanglement in space-time dual Hadamard lattices
- Exactly solvable many-body dynamics from space-time duality
- A covariant Stinespring theorem
- Tensor network decompositions for absolutely maximally entangled states
- Construction of perfect tensors using biunimodular vectors
- Shaded Tangles for the Design and Verification of Quantum Programs (Extended Abstract)
- Covariant quantum combinatorics with applications to zero-error communication
- Shaded tangles for the design and verification of quantum circuits
- Geometric constructions of generalized dual-unitary circuits from biunitarity
- Zigzag normalisation for associative -categories
- Planar algebras, quantum information theory and subfactors
- A classical groupoid model for quantum networks
- Entanglement-invertible channels
- A Categorical Model for Classical and Quantum Block Designs