A Quantum Algorithm for the Commutativity of Finite Dimensional Algebras
A quantum procedure for testing the commutativity of a finite dimensional algebra is introduced. This algorithm, based on Grover's quantum search, is shown to provide a quadratic speed-up (when the number of queries to the algebra multiplication constants is considered) over any classical algor...
Main Authors: | Elias F. Combarro, Jose Ranilla, Ignacio F. Rua |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8678755/ |
Similar Items
-
Post-quantum commutative encryption algorithm
by: A.A. Moldovyan, et al.
Published: (2019-12-01) -
A polynomial time algorithm for prime recognition
by: Domingues, Riaal
Published: (2013) -
Symmetric ideals and numerical primary decomposition
by: Krone, Robert Carlton
Published: (2015) -
Zoology of Atlas-Groups: Dessins D’enfants, Finite Geometries and Quantum Commutation
by: Michel Planat, et al.
Published: (2017-01-01) -
Universal Enveloping Commutative Rota–Baxter Algebras of Pre- and Post-Commutative Algebras
by: Vsevolod Gubarev
Published: (2017-12-01)