Quantum computation based on retarded and advanced propagation.
From MaRDI portal
(Redirected from Publication:1586917)
Abstract: Computation is currently seen as a forward propagator that evolves (retards) a completely defined initial vector into a corresponding final vector. Initial and final vectors map the (logical) input and output of a reversible Boolean network respectively, whereas forward propagation maps a one-way propagation of logical implication, from input to output. Conversely, hard NP-complete problems are characterized by a two-way propagation of logical implication from input to output and vice versa, given that both are partly defined from the beginning. Logical implication can be propagated forward and backward in a computation by constructing the gate array corresponding to the entire reversible Boolean network and constraining output bits as well as input bits. The possibility of modeling the physical process undergone by such a network by using a retarded and advanced in time propagation scheme is investigated. PACS numbers: 89.70.+c, 02.50.-r, 03.65.-w, 89.80.+h
Recommendations
Cites work
- scientific article; zbMATH DE number 862548 (Why is no real title available?)
- scientific article; zbMATH DE number 3208040 (Why is no real title available?)
- Bicontinuous extensions of invertible combinatorial functions
- Conservative logic
- Hypothetical solution of the problem of measurement through the notion of quantum backward causality
- Logical Reversibility of Computation
- Quantum complexity theory
- Rapid solution of problems by quantum computation
- Universality in quantum computation
Cited in
(3)
This page was built for publication: Quantum computation based on retarded and advanced propagation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586917)
