Quantum computation based on retarded and advanced propagation.

DOI10.1016/S0167-2789(98)00044-XzbMATH Open1040.81507arXivquant-ph/9706019MaRDI QIDQ1586917FDOQ1586917

Authors: Giuseppe Castagnoli 

Publication date: 20 November 2000

Published in: Physica D (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/quant-ph/9706019

Recommendations

• Quantum ground–state computation with kinematical gates
• scientific article; zbMATH DE number 2013192
• Counterfactual computation
• Quantum computation and NP-complete problems
• Entropy generation in a model of reversible computation

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Conservative logic
• Logical Reversibility of Computation
• Rapid solution of problems by quantum computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum complexity theory
• Bicontinuous extensions of invertible combinatorial functions
• Universality in quantum computation
• Hypothetical solution of the problem of measurement through the notion of quantum backward causality

Cited In (3)

• Quantum ground–state computation with kinematical gates
• Quasiclassical computation
• Quantum interference computation

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)