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

arXiv:0904.2286

Reversible computation as a model for the quantum measurement process

Karl Svozil

Published Apr 15, 2009• 0 citations
arXivHTMLPDF

Abstract

One-to-one reversible automata are introduced. Their applicability to a modelling of the quantum mechanical measurement process is discussed.
DOI
10.48550/arxiv.0904.2286

Related papers

On the Weakness of One-Way Quantum Pushdown Automata

Masaki Nakanishi

In general, quantum computation models are expected to be more powerful than classical counterparts. However, sometimes this is not the case.It is known that there exists some regular language which one-way quantum finite automata and one-way quantum counter automata cannot recognize. This is due to the restriction of reversibility which quantum models must satisfy. Thus, it is an interesting question: what kinds of quantum models suffer from/overcome the restriction? To tackle this problem, we focus on (empty-stack acceptance) one-way quantum pushdown automata, and show that there exists a regular language which one-way quantum pushdown automata cannot recognize. This implies adding a stack to one-way finite automata cannot overcome the restriction of reversibility if we adopt empty-stack acceptance as the acceptance mode.

International Conference on Quantum, Nano and Micro Technologies (ICQNM)•Feb 1, 2010•0 citations

Abstract Quantum Automata as Formal Models of Quantum Information Processing Systems

Mizal H. Alobaidi, Andriy Batyiv, Grygoriy Zholtkevych

Communications in computer and information science•Jan 1, 2013•0 citations

Modeling and Processing Using Reversible Conservative Noisy Elementary Cellular Automata Circuits and their M-Ary Quantum Computing

Anas N. Al‐Rabadi

Abstract Modeling noisy discrete systems utilizing conservative reversible elementary cellular automata (CRECA) is introduced. Reversibility in the ECA evolution rule and reversibility in the ECA circuit implementation are both achieved using a new Swap-based algorithm called Swap-based CRECA (SCRECA). The new method results in adding variable redundancy to counteract the effect of noise. The problem of obtaining a reversible map from an irreversible map is important because quantum circuits are inherently reversible and thus does not consume power, while irreversible circuits (due to either an irreversible mapping or to noise within a reversible mapping) cannot exist in the quantum domain and its circuits consume power. Since noise is an integral part of any real process and since the reduction of power consumption is a main requirement for the circuit design of future technologies such as in quantum computing (QC), the main features of several future technologies will include reversibility, and thus the...

Intelligent Automation & Soft Computing•Jan 1, 2008•0 citations

Reversible Quantum Measurements on a Spin ½ and Measuring the State of a Single System

Antoine Royer

In [1],a reversible measurement on a spin 1/2 was introduced, and it was concluded that this would allow us, with a very small but finite probability of success, to measure the state of a single system.This conclusion is not correct.Let me recapitulate the argument: The measurement yields one of two outcomes, Tl or Tq, with respective probabilities P]

Physical Review Letters•Feb 6, 1995•25 citations

What Exactly Are Quantum Computations? Classical and Quantum Turing Machines

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini +1 more

Trends in logic•Jan 1, 2018•2 citations

Quantum Cellular Automata Model

Jincheng Zhang

This paper proposes a novel model utilizing Quantum Cellular Automata (QCA) to simulate complex system evolution. The core idea involves transforming classical Cellular Automata (CA) into QCA, incorporating quantum phenomena such as superposition and entanglement to model intricate dynamics. This approach offers a fresh perspective on complex system modeling by leveraging the principles of quantum mechanics. The model's design incorporates key QCA mechanisms, including the Bloch sphere representation of states and the application of unitary transformations to govern cell interactions. We present a foundational framework for QCA simulation and discuss potential applications in areas such as pattern formation, reaction-diffusion processes, and emergent behavior. The focus is on demonstrating the theoretical feasibility and outlining a methodology for future research, rather than presenting empirical experimental results. This work emphasizes the conceptual shift and potential computational advantages offered by QCA in understanding complex systems.

•Aug 28, 2026•0 citations
In general, quantum computation models are expected to be more powerful than classical counterparts. However, sometimes this is not the case.It is known that there exists some regular language which one-way quantum finite automata and one-way quantum counter automata cannot recognize. This is due to the restriction of reversibility which quantum models must satisfy. Thus, it is an interesting question: what kinds of quantum models suffer from/overcome the restriction? To tackle this problem, we focus on (empty-stack acceptance) one-way quantum pushdown automata, and show that there exists a regular language which one-way quantum pushdown automata cannot recognize. This implies adding a stack to one-way finite automata cannot overcome the restriction of reversibility if we adopt empty-stack acceptance as the acceptance mode.
Abstract Modeling noisy discrete systems utilizing conservative reversible elementary cellular automata (CRECA) is introduced. Reversibility in the ECA evolution rule and reversibility in the ECA circuit implementation are both achieved using a new Swap-based algorithm called Swap-based CRECA (SCRECA). The new method results in adding variable redundancy to counteract the effect of noise. The problem of obtaining a reversible map from an irreversible map is important because quantum circuits are inherently reversible and thus does not consume power, while irreversible circuits (due to either an irreversible mapping or to noise within a reversible mapping) cannot exist in the quantum domain and its circuits consume power. Since noise is an integral part of any real process and since the reduction of power consumption is a main requirement for the circuit design of future technologies such as in quantum computing (QC), the main features of several future technologies will include reversibility, and thus the...
This paper proposes a novel model utilizing Quantum Cellular Automata (QCA) to simulate complex system evolution. The core idea involves transforming classical Cellular Automata (CA) into QCA, incorporating quantum phenomena such as superposition and entanglement to model intricate dynamics. This approach offers a fresh perspective on complex system modeling by leveraging the principles of quantum mechanics. The model's design incorporates key QCA mechanisms, including the Bloch sphere representation of states and the application of unitary transformations to govern cell interactions. We present a foundational framework for QCA simulation and discuss potential applications in areas such as pattern formation, reaction-diffusion processes, and emergent behavior. The focus is on demonstrating the theoretical feasibility and outlining a methodology for future research, rather than presenting empirical experimental results. This work emphasizes the conceptual shift and potential computational advantages offered by QCA in understanding complex systems.