DOI10.1007/BF01857727zbMath0496.94015OpenAlexW4251109627WikidataQ56228175 ScholiaQ56228175MaRDI QIDQ1170163
Tommaso Toffoli, Edward Fredkin
Publication date: 1982
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01857727
Predictability in deterministic theories ⋮
Entropy and computation: the Landauer-Bennett thesis reexamined ⋮
Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics ⋮
From reversible programs to univalent universes and back ⋮
How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme ⋮
Cellular automata for nanometer-scale computation ⋮
Quantum conservative many-valued computing ⋮
Optimization approaches for designing quantum reversible arithmetic logic unit ⋮
Boolean delay equations. II: Periodic and aperiodic solutions ⋮
The 50\% advanced information rule of the quantum algorithms ⋮
User authentication based on quantum-dot cellular automata using reversible logic for secure nanocommunication ⋮
Modular adder designs using optimal reversible and fault tolerant gates in field-coupled QCA nanocomputing ⋮
Universality of a reversible two-counter machine ⋮
Universal computation and physical dynamics ⋮
Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup ⋮
Cellular automata as a paradigm for ecological modeling ⋮
Multi-qubit non-adiabatic holonomic controlled quantum gates in decoherence-free subspaces ⋮
Intractable problems in reversible cellular automata ⋮
Holistic and compositional logics based on the Bertini gate ⋮
``Superconducting causal nets ⋮ Fuzzy representation of finite-valued quantum gates ⋮ Improving the quantum cost of reversible Boolean functions using reorder algorithm ⋮ Single-photon controlled multi-photon polarization unitary gate based on weak cross-Kerr nonlinearities ⋮ Reversible and endoreversible computing ⋮ Co-evolving non-uniform cellular automata to perform computations ⋮ Three ``quantum algorithms to solve 3-SAT ⋮
Physical versus computational complementarity. I ⋮
Collision-based implementation of a two-bit adder in excitable cellular automaton ⋮
Phenomenlogy of nonlocal cellular automata ⋮
An order-preserving property of additive invariants for Takesue-type reversible cellular automata ⋮
Information dissipation in quantum-chaotic systems: Computational view and measurement induction ⋮
Thermodynamic aspects of confidentiality ⋮
Reversible circuit synthesis by genetic programming using dynamic gate libraries ⋮
Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton ⋮
Finite generating sets for reversible gate sets under general conservation laws ⋮
Quantum theory, namely the pure and reversible theory of information ⋮
Fundamentals of reversible flowchart languages ⋮
Heralded quantum gates for atomic systems assisted by the scattering of photons off single emitters ⋮
Fast synthesis of the Fredkin gate via quantum Zeno dynamics ⋮
Explicit construction of single input-single output logic gates from three soliton solution of Manakov system ⋮
Optimized 4-bit quantum reversible arithmetic logic unit ⋮
The computational complexity of generating random fractals ⋮
Realization and synthesis of reversible functions ⋮
Compact quantum gates for hybrid photon-atom systems assisted by Faraday rotation ⋮
Uncertainty principle and minimal energy dissipation in the computer ⋮
Physics of selective systems: Computation and biology ⋮
An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits ⋮
Novel parity-preserving designs of reversible 4-bit comparator ⋮
Reversible computing and cellular automata -- a survey ⋮
Cellular vacuum ⋮
Nonlinearity and computation: Implementing logic as a nonlinear dynamical system ⋮
Artificial life with autonomously emerging boundaries ⋮
Physical limits of inference ⋮
Novel designs of nanometric parity preserving reversible compressor ⋮
The form of life. I: It is possible but not necessary ⋮
Reversible simulation of one-dimensional irreversible cellular automata ⋮
The mechanism of quantum computation ⋮
New design of reversible full adder/subtractor using \(R\) gate ⋮
Theory of reaction automata: a survey ⋮
High-fidelity hybrid universal quantum controlled gates on photons and quantum-dot spins ⋮
Designing of parity preserving reversible vedic multiplier ⋮
Memory systems, computation, and the second law of thermodynamics ⋮
Emergence of universal global behavior from reversible local transitions in asynchronous systems ⋮
Minimal universal library for \(n\times n\) reversible circuits ⋮
Join inverse categories and reversible recursion ⋮
Computation-universality of one-dimensional one-way reversible cellular automata ⋮
Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits ⋮
Forms of life: Unprogrammability constitutes the outside of a system and its autonomy ⋮
One-way permutations, computational asymmetry and distortion. ⋮
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements ⋮
Logic circuits from zero forcing ⋮
Sequential and maximally parallel multiset rewriting: reversibility and determinism ⋮
The physics of implementing logic: Landauer's principle and the multiple-computations theorem ⋮
The Higgs-physical and number theoretical arguments for the necessity of a triple elementary particle in super symmetric spacetime ⋮
Collision-based computing in Belousov--Zhabotinsky medium ⋮
Controlled gates for multi-level quantum computation ⋮
The diagonalization method in quantum recursion theory ⋮
The logic of optics and the optics of logic ⋮
Majority-based reversible logic gates ⋮
Maxwell's demon and the thermodynamics of computation ⋮
On quantum jumps, events, and spontaneous localization models ⋮
Notes on Landauer's principle, reversible computation, and Maxwell's demon ⋮
Computational complexity and 3-manifolds and zombies ⋮
The quantum speed up as advanced cognition of the solution ⋮
An instruction set for reversible Turing machines ⋮
Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮
On figures of merit in reversible and quantum logic designs ⋮
A computation-universal two-dimensional 8-state triangular reversible cellular automaton ⋮
Gliders in the game of life and in a reversible cellular automaton ⋮
Reversible elementary triangular partitioned cellular automata and their complex behavior ⋮
On the mathematical treatment of the Fredkin-Toffoli-Milburn gate. ⋮
Quantum computation based on retarded and advanced propagation. ⋮
PhysComp96. Proceedings of the 4th workshop on physics and computation, Boston, MA, USA, November 22--24, 1996 ⋮
Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers ⋮
Minimum energy requirements of information transfer and computing ⋮
PSPACE-completeness of reversible deterministic systems ⋮
Invertible cellular automata: A review ⋮
Glider-based computing in reaction-diffusion hexagonal cellular automata ⋮
Computing with planar toppling domino arrangements ⋮
Optimal designs of reversible/quantum decoder circuit using new quantum gates
This page was built for publication: Conservative logic