Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

THE NOTIONS OF SYMMETRY AND COMPUTATIONAL FEEDBACK IN THE PARADIGM OF STEADY, SIMULTANEOUS QUANTUM COMPUTATION

Giuseppe Castagnoli, Mario Rasetti

Published Jan 1, 1993• 0 citations
OpenAlex

Related papers

The notions of symmetry and computational feedback in the paradigm of steady, simultaneous quantum computation

Giuseppe Castagnoli, Mario Rasetti

International Journal of Theoretical Physics•Dec 1, 1993•14 citations

OVERVIEW OF QUANTUM COMPUTATION

H.E. Caicedo-Ortiz, Elizabeth Santiago-Cortes

Apple Academic Press eBooks•Oct 22, 2014•1 citation

QUANTUM COMPUTATION: AN INTRODUCTION

Adriano Barenco

WORLD SCIENTIFIC eBooks•Oct 1, 1998•13 citations

QUANTUM COMPUTATION AND INFORMATION

A. Carlini

The Ninth Marcel Grossmann Meeting•Dec 1, 2002•92 citations

STEADY, SIMULTANEOUS QUANTUM COMPUTATION: A PARADIGM FOR THE INVESTIGATION OF NONDETERMINISTIC AND NON-RECURSIVE COMPUTATION

Giuseppe Castagnoli, Mario Rasetti, Antonio Vincenzi

We introduce the notion of a class of abstract digital computers based on quantum reversibility and indeterminism (not 011 the classical sequential architecture), which are compatible with quantum laws and may perform nondeterministic and non-recursive computation.

International Journal of Modern Physics C•Aug 1, 1992•5 citations

QUANTUM STEADY COMPUTATION

Giuseppe Castagnoli

Current conceptions of "quantum mechanical computers" inherit from conventional digital machines two apparently interacting features, machine imperfection and temporal development of the computational process. On account of machine imperfection, the process would become ideally reversible only in the limiting case of zero speed. Therefore the process is irreversible in practice and cannot be considered to be a fundamental quantum one. By giving up classical features and using a linear, reversible and non-sequential representation of the computational process — not realizable in classical machines — the process can be identified with the mathematical form of a quantum steady state. This form of steady quantum computation would seem to have an important bearing on the notion of cognition.

International Journal of Modern Physics B•Aug 10, 1991•3 citations
Current conceptions of "quantum mechanical computers" inherit from conventional digital machines two apparently interacting features, machine imperfection and temporal development of the computational process. On account of machine imperfection, the process would become ideally reversible only in the limiting case of zero speed. Therefore the process is irreversible in practice and cannot be considered to be a fundamental quantum one. By giving up classical features and using a linear, reversible and non-sequential representation of the computational process — not realizable in classical machines — the process can be identified with the mathematical form of a quantum steady state. This form of steady quantum computation would seem to have an important bearing on the notion of cognition.