Abstract

Digital computation—i.e., the coherent concatenation of logicalif/then statements—is generally mapped onto the temporal transformation of a physical state. In the alternative paradigm of steady, simultaneous quantum computation, logical concatenations are mapped onto the transformations of a quantum steady state into itself. Such transformations, separated from the time variable and thus freed from the one-way progression of time, can mapcircular logical concatenations. This gives rise to nondeterministic and nonrecursive computation. Toy model Hamiltonians of elementary (steady) computations are given to exemplify the applicability of the paradigm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.