Complexity of reversible circuits and their quantum implementations
From MaRDI portal
Publication:2634672
Recommendations
- Upper bounds for reversible circuits based on Young subgroups
- Minimal universal library for \(n\times n\) reversible circuits
- Transforming MCT circuits to NCVW circuits
- Realization and synthesis of reversible functions
- On asymptotic gate complexity and depth of reversible circuits without additional memory
Cites work
- A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3692653 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- On figures of merit in reversible and quantum logic designs
- Quantum circuit optimization by Hadamard gate reduction
- Reversible Computing
- Upper bounds for reversible circuits based on Young subgroups
- Young subgroups for reversible computers.
Cited in
(27)- Quantum reversible circuit of AES-128
- Simulation of a multidimensional input quantum perceptron
- On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
- Inverse problems, constraint satisfaction, reversible logic, invertible logic and Grover quantum oracles for practical problems
- An improved and cost reduced quantum circuit generator approach for image encoding applications
- Macroscopic instructions vs microscopic operations in quantum circuits
- Upper bounds for reversible circuits based on Young subgroups
- Advanced exact synthesis of Clifford+T circuits
- Transforming MCT circuits to NCVW circuits
- scientific article; zbMATH DE number 6003196 (Why is no real title available?)
- Reversibility and adiabatic computation: trading time and space for energy
- On asymptotic gate complexity and depth of reversible circuits without additional memory
- Reversible and Quantum Circuit Optimization: A Functional Approach
- Optimal 4-bit reversible mixed-polarity Toffoli circuits
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
- Boolean satisfiability in quantum compilation
- Identification of a reversible quantum gate: assessing the resources
- OR-Toffoli and OR-Peres Reversible Gates
- A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits
- Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures
- Mapping a multiple-control Toffoli gate cascade to an elementary quantum gate circuit
- Reversibility and Irreversibility in Quantum Computation and in Quantum Computational Logics
- Complexity Invariance by Replication in the Quantum Square Well
- MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
- Commuting quantum circuits and complexity of Ising partition functions
- Leveraging Grover's algorithm for quantum searchable encryption in cloud infrastructure and its application in AES resource estimation
- Minimal universal library for \(n\times n\) reversible circuits
This page was built for publication: Complexity of reversible circuits and their quantum implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634672)
