Logical Reversibility of Computation
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A universal cellular automaton without sensitive subsystems
- Towards bridging time and causal reversibility
- Reversibility of computations in graph-walking automata
- T-count optimized Wallace tree integer multiplier for quantum computing
- Reversible computation in nature inspired rule-based systems
- Simulating reversible computation with reaction systems
- Theory of reaction automata: a survey
- Reversify any sequential algorithm
- Analogies and differences between quantum and stochastic automata
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication
- The computing power of determinism and reversibility in chemical reaction automata
- Computation and construction universality of reversible cellular automata
- Quantum model of computations: Underlying principles and achievements
- Modelling reliability of reversible circuits with 2D second-order cellular automata
- Quantum implementation and resource estimates for rectangle and knot
- Quantum reversible fuzzy grammars
- Boolean satisfiability in quantum compilation
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder
- Quaternary quantum/reversible half-adder, full-adder, parallel adder and parallel adder/subtractor circuits
- Total cost of operating an information engine
- Balanced ternary reversible comparator for qutrit quantum circuits
- Towards general-purpose program obfuscation via local mixing
- Reversibility in the higher-order \(\pi\)-calculus
- Application of Permutation Group Theory in Reversible Logic Synthesis
- Quantum circuit oracles for abstract machine computations
- Milestone developments in quantum information and no-go theorems
- Reversible top-down syntax analysis
- Quantum conservative many-valued computing
- Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Quantum computation based on retarded and advanced propagation.
- A certified study of a reversible programming language
- Real-time reversible iterative arrays
- Mathematical models of quantum computation
- A class of recursive permutations which is primitive recursive complete
- Quantum-enhanced feature selection with forward selection and backward elimination
- Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
- New dimensions in non‐classical neural computing, part II: quantum, nano, and optical
- One-way reversible multi-head finite automata
- Primality Test Via Quantum Factorization
- Fast reversible language recognition using cellular automata
- On the simulation of quantum Turing machines.
- Open problems on information and feedback controlled systems
- Life as thermodynamic evidence of algorithmic structure in natural environments
- Exponentially more concise quantum recognition of non-RMM regular languages
- Circuit complexity in interacting QFTs and RG flows
- Novel qutrit circuit design for multiplexer, de-multiplexer, and decoder
- The complexity of iterated reversible computation
- Image classification based on quantum K-nearest-neighbor algorithm
- Notes on Landauer's principle, reversible computation, and Maxwell's demon
- When input-driven pushdown automata meet reversiblity
- An axiomatic approach to reversible computation
- Towards designing quantum reversible ternary multipliers
- Algorithmic arguments in physics of computation
- Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements
- Model-theoretic complexity of automatic structures
- How can we construct reversible machines out of reversible logic element with memory?
- Design of a fault-tolerant reversible control unit in molecular quantum-dot cellular automata
- Intractable problems in reversible cellular automata
- Reversible Ordered Restarting Automata
- Concise representations of reversible automata
- An RNA-based theory of natural universal computation
- Modular design of ultra-efficient reversible full adder-subtractor in QCA with power dissipation analysis
- Shannon logic based novel QCA full adder design with energy dissipation analysis
- Reversible limited automata
- Computing with semirings and weak rig groupoids
- Join inverse categories as models of reversible recursion
- ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS
- Circuits form‐valued classical, reversible and quantum optical computing with application to regular logic design
- Reversibility in process calculi with nondeterminism and probabilities
- \textit{Re}\(\mathcal{Q}\)\textsc{wire}: reasoning about reversible quantum circuits
- Reversible parallel computation: An evolving space-model
- The 50\% advanced information rule of the quantum algorithms
- Computation in reversible cellular automata
- Characterizations of one-way general quantum finite automata
- Information equation of state
- Quantum mechanical algorithm for solving quadratic residue equation
- The logic of optics and the optics of logic
- The stochastic thermodynamics of computation
- Epistemic horizons and the foundations of quantum mechanics
- Oracle Quantum Computing
- Realizable Universal Quantum Logic Gates
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)
- Energy complexity of computation
- Optimization of reversible control flow graphs
- Saving memory space in deep neural networks by recomputing: a survey
- Towards a taxonomy for reversible computation approaches
- Abelian Invertible Automata
- Reversible causal graph dynamics: invertibility, block representation, vertex-preservation
- Undecidability of the Spectral Gap
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- A quantum algorithm using NMR computers to break secret-key cryptosystems
- Quantum Perceptrons
- The many faces of the second law
- Logical gates via gliders collisions
- A Survey on Analog Models of Computation
- Reversible computing and cellular automata -- a survey
- Undecidable event detection problems for ODEs of dimension one and two
- Minimal and Reduced Reversible Automata
- Conservative logic
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)
