Practically implementable minimal universal gate sets for multi-Qudit systems with cryptographic validation

DOI10.1007/978-3-032-13301-4_17MaRDI QIDQ6840135zbMATH OpenFDO

Authors Anisha Dutta, Sayantan Chakraborty, Chandan Goswami, Avishek Adhikari

Publication date 23 March 2026

Full work available at URL https://doi.org/10.1007/978-3-032-13301-4_17

zbMATH Keywords

Grover's algorithmminimal universal quantum gatesmulti-fold QuditPython-CirqQKDquantum cryptologyReck's decomposition

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A geometric algebra perspective on quantum computational gates and universality in quantum computing
• A new universal and fault-tolerant quantum basis
• A universal two-bit gate for quantum computation
• An efficient quantum secret sharing scheme for general access structure based on a novel partitioning technique
• Arbitrary d( 2)-level (t, n) threshold quantum secret reconstruction scheme using symmetric entanglements
• Basic modern algebra with applications
• Building qutrit diagonal gates from phase gadgets
• Expressing the operations of quantum computing in multiparticle geometric algebra.
• Quantum computation and quantum information. 10th anniversary edition
• Quantum computations: algorithms and error correction
• Quantum gates and circuits
• Qutrit metaplectic gates are a subset of Clifford+T
• Universality in quantum computation
• Universality of single-qudit gates

This page was built for publication: Practically implementable minimal universal gate sets for multi-Qudit systems with cryptographic validation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6840135)