The following pages link to (Q3886867):
Displaying 50 items.
- Optimization approaches for designing quantum reversible arithmetic logic unit (Q293885) (← links)
- On reversible Turing machines and their function universality (Q303695) (← links)
- The complexity of the representation of multiple-output Boolean functions (Q332335) (← links)
- Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Q334289) (← links)
- On asymptotic gate complexity and depth of reversible circuits without additional memory (Q340566) (← links)
- The Toffoli-Hadamard gate system: an algebraic approach (Q358697) (← links)
- Implementing a one-bit reversible full adder using quantum-dot cellular automata (Q481653) (← links)
- Novel designs of nanometric parity preserving reversible compressor (Q488150) (← links)
- Ancilla-free synthesis of large reversible functions using binary decision diagrams (Q491242) (← links)
- Novel designs of quantum reversible counters (Q517687) (← links)
- Product Łukasiewicz quantum logic (Q630175) (← links)
- Tree search and quantum computation (Q638594) (← links)
- Universal computation and other capabilities of hybrid and continuous dynamical systems (Q673870) (← links)
- Fuzzy type representation of the Fredkin gate in quantum computation with mixed states (Q682640) (← links)
- Maxwell's demon and the thermodynamics of computation (Q720453) (← links)
- Synthesis of reversible circuits with minimal costs (Q734115) (← links)
- The algebraic structure of an approximately universal system of quantum computational gates (Q735194) (← links)
- A class of reversible primitive recursive functions (Q737109) (← links)
- Invertible cellular automata: A review (Q807058) (← links)
- Three ``quantum'' algorithms to solve 3-SAT (Q872207) (← links)
- Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction (Q924667) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- On figures of merit in reversible and quantum logic designs (Q1039611) (← links)
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis (Q1044673) (← links)
- Intractable problems in reversible cellular automata (Q1104752) (← links)
- PhysComp96. Proceedings of the 4th workshop on physics and computation, Boston, MA, USA, November 22--24, 1996 (Q1587487) (← links)
- Modular adder designs using optimal reversible and fault tolerant gates in field-coupled QCA nanocomputing (Q1640112) (← links)
- Designing nanoscale counter using reversible gate based on quantum-dot cellular automata (Q1643474) (← links)
- Toward efficient design of reversible logic gates in quantum-dot cellular automata with power dissipation analysis (Q1643493) (← links)
- Reversible circuit synthesis by genetic programming using dynamic gate libraries (Q1679386) (← links)
- Finite generating sets for reversible gate sets under general conservation laws (Q1682853) (← links)
- Optimized 4-bit quantum reversible arithmetic logic unit (Q1700857) (← links)
- Toffoli gate and quantum correlations: a geometrical approach (Q1701971) (← links)
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits (Q1717423) (← links)
- Cayley graphs and complexity geometry (Q1735572) (← links)
- Quantum circuit realization of morphological gradient for quantum grayscale image (Q1740994) (← links)
- Transformation rules for CNOT-based quantum circuits and their applications (Q1880336) (← links)
- Co-evolving non-uniform cellular automata to perform computations (Q1912486) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901) (← links)
- Logic circuits from zero forcing (Q2003480) (← links)
- Classical leakage resilience from fault-tolerant quantum computation (Q2010581) (← links)
- A one-dimensional physically universal cellular automaton (Q2011676) (← links)
- Fuzzy approach for Toffoli gate in quantum computation with mixed states (Q2018744) (← links)
- An instruction set for reversible Turing machines (Q2041688) (← links)
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields (Q2056720) (← links)
- On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs (Q2081007) (← links)
- Some efficient quantum circuit implementations of Camellia (Q2107075) (← links)
