Logical Reversibility of Computation
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The complexity of small universal Turing machines: A survey
- Heuristic methods to use don't cares in automated design of reversible and quantum logic circuits
- Theory of one-tape linear-time Turing machines
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- Quantum mechanical Hamiltonian models of Turing machines
- Intractable problems in reversible cellular automata
- ``Superconducting causal nets
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Generation of invertible functions
- A notion of information related to computation
- Uncertainty principle and minimal energy dissipation in the computer
- Physics of selective systems: Computation and biology
- Conservative logic
- Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines
- Computation-universality of one-dimensional one-way reversible cellular automata
- Computation and construction universality of reversible cellular automata
- Computability and complexity of ray tracing
- Universality of a reversible two-counter machine
- Self-reproduction in a reversible cellular space
- On the computational power of dynamical systems and hybrid systems
- Physical versus computational complementarity. I
- Running programs backwards: The logical inversion of imperative computation
- Linear programs in a simple reversible language.
- On the simulation of quantum Turing machines.
- Reversible space equals deterministic space
- Frontier between decidability and undecidability: A survey
- 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 model of computations: Underlying principles and achievements
- Quantum neural networks
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations
- Circuit complexity in interacting QFTs and RG flows
- 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
- 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
- Improving the quantum cost of reversible Boolean functions using reorder algorithm
- Reversible computation in term rewriting
- The complexity of translationally invariant spin chains with low local dimension
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Optimized 4-bit quantum reversible arithmetic logic unit
- Towards quantum reversible ternary coded decimal adder
- Designing novel quaternary quantum reversible subtractor circuits
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Epistemic horizons and the foundations of quantum mechanics
- Shannon logic based novel QCA full adder design with energy dissipation analysis
- Modular design of ultra-efficient reversible full adder-subtractor in QCA with power dissipation analysis
- Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit
- Reversible pushdown automata
- Quantum walks: a comprehensive review
- On one application of computations with oracle
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- Uniformity of quantum circuit families for error-free algorithms
- Theory of cellular automata: a survey
- A theory of reversibility for Erlang
- Negative feedback and physical limits of genes
- Thermodynamics of natural selection. I: Energy flow and the limits on organization
- Thermodynamics of natural selection. III: Landauer's principle in computation and chemistry
- Computing with quanta -- impacts of quantum theory on computation.
- Regular languages accepted by quantum automata
- Mathematical models of quantum computation
- One complexity theorist's view of quantum computing
- A quantum algorithm using NMR computers to break secret-key cryptosystems
- Efficient exhaustive listings of reversible one dimensional cellular automata
- The complexity of reversible cellular automata
- A unification of probabilistic choice within a design-based model of reversible computation
- Quantum speed-up for unsupervised learning
- Optimization approaches for designing a novel 4-bit reversible comparator
- Space-bounded quantum complexity
- Simulating reversible computation with reaction systems
- Reversible computation in nature inspired rule-based systems
- Theory of reaction automata: a survey
- A class of recursive permutations which is primitive recursive complete
- Image classification based on quantum K-nearest-neighbor algorithm
- Quantum-enhanced feature selection with forward selection and backward elimination
- The physics of implementing logic: Landauer's principle and the multiple-computations theorem
- Brownian computation is thermodynamically irreversible
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Reversible parallel communicating finite automata systems
- An instruction set for reversible Turing machines
- Reversibility for stateless ordered RRWW-automata
- Gliders in the game of life and in a reversible cellular automaton
- Reversible elementary triangular partitioned cellular automata and their complex behavior
- A novel and efficient square root computation quantum circuit for floating-point standard
- The \(\aleph \)-calculus. A declarative model of reversible programming
- Quantum implementation and resource estimates for rectangle and knot
- Novel qutrit circuit design for multiplexer, de-multiplexer, and decoder
- Optimal designs of reversible/quantum decoder circuit using new quantum gates
- Generic conversion method for various spatial domain filters in quantum image processing
- Reversible effects as inverse arrows
- Controlled reversibility in communicating reaction systems
- Energy complexity of regular language recognition
- Computing the number of the equivalence classes for reversible logic functions
- An axiomatic approach to reversible computation
- Reversibility of computations in graph-walking automata
- A parametric framework for reversible \(\pi\)-calculi
- The bouncing ball and the Grünwald-Letnikov definition of fractional derivative
- T-count optimized Wallace tree integer multiplier for quantum computing
This page was built for publication: Logical Reversibility of Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5684240)
