Homomorphic encryption of the k = 2 Bernstein-Vazirani algorithm
From MaRDI portal
Publication:6601062
DOI10.1088/1751-8121/AD6C04MaRDI QIDQ6601062FDOQ6601062
Authors: Pablo Fernández, Miguel A. Martín-Delgado 
Publication date: 10 September 2024
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Quantum computation and quantum information. 10th anniversary edition
- Information and computation: Classical and quantum aspects
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Rapid solution of problems by quantum computation
- (Leveled) fully homomorphic encryption without bootstrapping
- Quantum complexity theory
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
This page was built for publication: Homomorphic encryption of the \(k = 2\) Bernstein-Vazirani algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601062)
