Toffoli-depth reduction method preserving in-place quantum circuits and its application to SHA3-256
From MaRDI portal
(Redirected from Publication:6547301)
Recommendations
- Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- New quantum circuit implementations of SM4 and SM3
- Quantum circuit optimization by Hadamard gate reduction
- Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations
Cites work
- A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations
- Ancilla-free synthesis of large reversible functions using binary decision diagrams
- Checking Reversibility of Boolean Functions
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Implementing Grover oracles for quantum key search on AES and LowMC
- Mapping NCV Circuits to Optimized Clifford+T Circuits
- MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
- Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
- Optimal synthesis of linear reversible circuits
- Synthesis and optimization of reversible circuits -- a survey
- T-Count Optimization and Reed–Muller Codes
- Templates for positive and negative control Toffoli networks
- Theory and Applications of Models of Computation
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
Cited in
(1)
This page was built for publication: Toffoli-depth reduction method preserving in-place quantum circuits and its application to SHA3-256
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547301)
