Polyadic braid operators and higher braiding gates
arXiv:2107.08789 · doi:10.3390/universe7080301
Abstract
Higher braiding gates, a new kind of quantum gate, are introduced. These are matrix solutions of the polyadic braid equations (which differ from the generalized Yang-Baxter equations). Such gates support a special kind of multi-qubit entanglement which can speed up key distribution and accelerate the execution of algorithms. Ternary braiding gates acting on three qubit states are studied in detail. We also consider exotic non-invertible gates which can be related to qubit loss, and define partial identities (which can be orthogonal), partial unitarity, and partially bounded operators (which can be non-invertible). We define two classes of matrices, the star and circle types, and find that the magic matrices (connected with the Cartan decomposition) belong to the star class. The general algebraic structure of the classes introduced here is described in terms of semigroups, ternary and 5-ary groups and modules. The higher braid group and its representation by higher braid operators are given. Finally, we show that for each multi-qubit state there exist higher braiding gates which are not entangling, and the concrete conditions to be non-entangling are given for the binary and ternary gates discussed.
arXiv comment37 pages, revtex 4.2
References in corpus (28)
- Non-Abelian Anyons and Topological Quantum Computation
- Entanglement-free Heisenberg-limited phase estimation
- Optimal Creation of Entanglement Using a Two--Qubit Gate
- Measurement-Only Topological Quantum Computation
- Multi-partite entanglement speeds up quantum key distribution in networks
- Braiding Operators are Universal Quantum Gates
- On local invariants of pure three-qubit states
- Comparing Quantum Entanglement and Topological Entanglement
- Yang-Baxter maps and integrable dynamics
- Quantum methods for clock synchronization: Beating the standard quantum limit without entanglement
- Entangling power and local invariants of two-qubit gates
- Canonical Decompositions of n-qubit Quantum Computations and Concurrence
- Towards topological quantum computer
- Entanglement robustness against particle loss in multiqubit systems
- Yang-Baxter operators need quantum entanglement to distinguish knots
- From Topological to Quantum Entanglement
- Entanglement-free certification of entangling gates
- Entanglement-Free Parameter Estimation of Generalized Pauli Channels
- Unitary Solutions to the Yang-Baxter Equation in Dimension Four
- Quantum -matrices as universal qubit gates
- Solutions to generalized Yang-Baxter equations via ribbon fusion categories
- Learning Algebraic Models of Quantum Entanglement
- Local invariants of braiding quantum gates -- associated link polynomials and entangling power
- Quantum channel-estimation with particle loss: GHZ versus W states
- Higher braid groups and regular semigroups from polyadic-binary correspondence
- Classical simulation of Yang-Baxter gates
- Polyadic Hopf algebras and quantum groups
- Generating W states with braiding operators