scientific article

zbMath0443.68038MaRDI QIDQ3886867

Tommaso Toffoli

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reversible computing

Mathematics Subject Classification ID

Related Items (only showing first 100 items - show all)

Transformation rules for CNOT-based quantum circuits and their applications ⋮ From reversible programs to univalent universes and back ⋮ Optimization approaches for designing quantum reversible arithmetic logic unit ⋮ Reversible effects as inverse arrows ⋮ Efficient and exact quantum compression ⋮ The Classification of Reversible Bit Operations ⋮ On reversible Turing machines and their function universality ⋮ Complexity of reversible circuits and their quantum implementations ⋮ Modular adder designs using optimal reversible and fault tolerant gates in field-coupled QCA nanocomputing ⋮ Designing nanoscale counter using reversible gate based on quantum-dot cellular automata ⋮ Toward efficient design of reversible logic gates in quantum-dot cellular automata with power dissipation analysis ⋮ Design of p-Valued Deutsch Quantum Gates with Multiple Control Signals and Mixed Polarity ⋮ Strongly Universal Reversible Gate Sets ⋮ Enumeration of Reversible Functions and Its Application to Circuit Complexity ⋮ Checking Reversibility of Boolean Functions ⋮ Towards a multi target quantum computational logic ⋮ The complexity of the representation of multiple-output Boolean functions ⋮ Intractable problems in reversible cellular automata ⋮ Graph Transformation Meets Reversible Circuits: Model Transformation and Optimization ⋮ Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates ⋮ On asymptotic gate complexity and depth of reversible circuits without additional memory ⋮ Co-evolving non-uniform cellular automata to perform computations ⋮ The Toffoli-Hadamard gate system: an algebraic approach ⋮ On design of parity preserving reversible adder circuits ⋮ Three ``quantum algorithms to solve 3-SAT ⋮ Reversible circuit synthesis by genetic programming using dynamic gate libraries ⋮ An efficient design for reversible Wallace unsigned multiplier ⋮ Finite generating sets for reversible gate sets under general conservation laws ⋮ A general protocol for distributed quantum gates ⋮ Tangible reduction in learning sample complexity with large classical samples and small quantum system ⋮ An optimized quantum circuit for converting from sign-magnitude to two's complement ⋮ Quantum circuit for the fast Fourier transform ⋮ Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs ⋮ Product Łukasiewicz quantum logic ⋮ Optimized 4-bit quantum reversible arithmetic logic unit ⋮ Quantum circuit implementations of AES with fewer qubits ⋮ Toffoli gate and quantum correlations: a geometrical approach ⋮ Reversible computing from a programming language perspective ⋮ Tree search and quantum computation ⋮ Unnamed Item ⋮ Efficient designs of reversible BCD to EX-3 Converter with low quantum cost in nanoscale ⋮ An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits ⋮ Fredkin and Toffoli Gates Implemented in Oregonator Model of Belousov–Zhabotinsky Medium ⋮ Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction ⋮ Reversible computing and cellular automata -- a survey ⋮ Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder ⋮ Considering nearest neighbor constraints of quantum circuits at the reversible circuit level ⋮ Implementing a one-bit reversible full adder using quantum-dot cellular automata ⋮ Novel designs of nanometric parity preserving reversible compressor ⋮ Cayley graphs and complexity geometry ⋮ Ancilla-free synthesis of large reversible functions using binary decision diagrams ⋮ Quantum circuit realization of morphological gradient for quantum grayscale image ⋮ Universal computation and other capabilities of hybrid and continuous dynamical systems ⋮ Two-way remote preparations of inequivalent quantum states under a common control ⋮ Hybrid Control of Toffoli and Peres Gates ⋮ The fixed point problem of a simple reversible language ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Fuzzy type representation of the Fredkin gate in quantum computation with mixed states ⋮ Novel designs of quantum reversible counters ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ OR-Toffoli and OR-Peres Reversible Gates ⋮ One-way permutations, computational asymmetry and distortion. ⋮ Logic circuits from zero forcing ⋮ Classical leakage resilience from fault-tolerant quantum computation ⋮ A one-dimensional physically universal cellular automaton ⋮ On the computational power of molecular heat engines ⋮ Fuzzy approach for Toffoli gate in quantum computation with mixed states ⋮ Maxwell's demon and the thermodynamics of computation ⋮ Qubit semantics and quantum trees ⋮ Canonical mixed-polarity multi-target Toffoli circuits: shift and removal ⋮ Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants ⋮ General design of reversible sequential machines based on reversible logic elements ⋮ Concise Representations of Reversible Automata ⋮ Computing with Semirings and Weak Rig Groupoids ⋮ Synthesis of reversible circuits with minimal costs ⋮ The algebraic structure of an approximately universal system of quantum computational gates ⋮ A class of reversible primitive recursive functions ⋮ An instruction set for reversible Turing machines ⋮ When-and how-can a cellular automaton be rewritten as a lattice gas? ⋮ Optimized parity preserving quantum reversible full adder/subtractor ⋮ Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements ⋮ A quantum speedup in machine learning: finding anN-bit Boolean function for a classification ⋮ Unnamed Item ⋮ \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields ⋮ A Classical Propositional Logic for Reasoning About Reversible Logic Circuits ⋮ Improved Algorithms for Debugging Problems on Erroneous Reversible Circuits ⋮ Unnamed Item ⋮ Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures ⋮ An improved design of \(n\)-bit universal reversible gate library ⋮ Effective designs of reversible Vedic multiplier ⋮ On figures of merit in reversible and quantum logic designs ⋮ Bicontinuous extensions of invertible combinatorial functions ⋮ On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs ⋮ \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis ⋮ On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography ⋮ PhysComp96. Proceedings of the 4th workshop on physics and computation, Boston, MA, USA, November 22--24, 1996 ⋮ Some efficient quantum circuit implementations of Camellia ⋮ New quantum circuit implementations of SM4 and SM3 ⋮ Invertible cellular automata: A review ⋮ Graphical description of unitary transformations on hypergraph states

This page was built for publication: