Optimal T-depth quantum circuits for implementing arbitrary Boolean functions
From MaRDI portal
Cites work
- \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing
- Ciphers for MPC and FHE
- Constructing quantum implementations with the minimal T-depth or minimal width and their applications
- DEFAULT: cipher level resistance against differential fault attack
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- Grover meets Simon -- quantumly attacking the FX-construction
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Implementing Grover oracles for quantum key search on AES and LowMC
- Improved quantum circuits for AES: reducing the depth and the number of qubits
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Quantum circuits of AES with a low-depth linear layer and a new structure
- Rapid solution of problems by quantum computation
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- Universal quantum computation with ideal Clifford gates and noisy ancillas
This page was built for publication: Optimal T-depth quantum circuits for implementing arbitrary Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295946)
