Pages that link to "Item:Q2634672"

The following pages link to Complexity of reversible circuits and their quantum implementations (Q2634672):

Displaying 24 items.

• On asymptotic gate complexity and depth of reversible circuits without additional memory (Q340566) (← links)
• Minimal universal library for \(n\times n\) reversible circuits (Q950038) (← links)
• Quantum reversible circuit of AES-128 (Q1654144) (← links)
• Simulation of a multidimensional input quantum perceptron (Q1993729) (← links)
• 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 (Q1996847) (← links)
• Inverse problems, constraint satisfaction, reversible logic, invertible logic and Grover quantum oracles for practical problems (Q2039887) (← links)
• An improved and cost reduced quantum circuit generator approach for image encoding applications (Q2107995) (← links)
• Macroscopic instructions vs microscopic operations in quantum circuits (Q2212905) (← links)
• Upper bounds for reversible circuits based on Young subgroups (Q2446569) (← links)
• Advanced exact synthesis of Clifford+T circuits (Q2681689) (← links)
• (Q3114283) (← links)
• Reversibility and adiabatic computation: trading time and space for energy (Q3126112) (← links)
• Reversible and Quantum Circuit Optimization: A Functional Approach (Q3453739) (← links)
• Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (Q3591441) (← links)
• Boolean satisfiability in quantum compilation (Q4993497) (← links)
• Identification of a reversible quantum gate: assessing the resources (Q5141581) (← links)
• OR-Toffoli and OR-Peres Reversible Gates (Q5162618) (← links)
• A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits (Q5237211) (← links)
• Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures (Q5237219) (← links)
• Reversibility and Irreversibility in Quantum Computation and in Quantum Computational Logics (Q5425999) (← links)
• Complexity Invariance by Replication in the Quantum Square Well (Q5851893) (← links)
• MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits (Q6089492) (← links)
• Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
• Leveraging Grover's algorithm for quantum searchable encryption in cloud infrastructure and its application in AES resource estimation (Q6600933) (← links)