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

Theoretical Computer Science

Some formal tools for analyzing quantum automata

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Published Mar 1, 2006• 24 citations
Publisher
DOI
10.1016/j.tcs.2006.01.042

Related papers

Quantum Cellular Automata, Black Hole Thermodynamics and the Laws of Quantum Complexity

Ruhi Shah, Jonathan Gorard

This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators. It subsequently uses this formalism to analyze and validate several conjectures, stemming from a formal analogy between quantum computational complexity theory and classical thermodynamics, that have arisen recently in the context of black hole physics. In particular, the apparent resonance and thermalization effects present within such QCAs are investigated, and it is demonstrated that the expected exponential relationships between the quantum circuit complexity of the evolution operator, the classical entropy of the equilibrium QCA state, and the characteristic equilibration time of the QCA, all hold within this new model. Finally, a rigorous explanation for this empirical relationship is provided, as well as for the relationship with black hole thermodynamics, by drawing an explicit mathematical connection with the mean ergodic theorem, and the ergodicity of k-local quantum systems.

arXiv:1910.00578•Complex Systems•Dec 15, 2019•9 citations

Various Aspects of Finite Quantum Automata

Mika Hirvensalo

Lecture notes in computer science•Jan 1, 2008•32 citations

Analysis and Verification of Quantum Communication Protocols in UPPAAL

René Bødker Christensen, Nikolaj Rossander Kristensen, Kim G. Larsen +3 more

Abstract We introduce a formal modeling methodology to analyze quantum communication protocols in the tool Uppaal . Our approach encodes quantum states, operations, and measurements into Uppaal timed automata with data extensions and external function calls, enabling both exhaustive verification in the ideal (noiseless) case and statistical model checking for realistic noisy scenarios. We apply our framework to the Beyond Superdense Coding protocol—a time-slotted variant of superdense coding—combined with quantum entanglement distillation, and demonstrate that Uppaal can deal with these protocols even under complex timing and decoherence constraints.

Lecture notes in computer science•Jan 1, 2026•0 citations

Algebraic Results on Quantum Automata

Andris Ambainis, Martin Beaudry, Marats Golovkins +3 more

Lecture notes in computer science•Jan 1, 2004•12 citations

Algebraic Results on Quantum Automata

Andris Ambainis, Martin Beaudry, Marats Golovkins +3 more

Theory of Computing Systems•Nov 29, 2005•73 citations

Quantum cellular automata without quiescent states

Robert J. Irwin, Howard A. Blair

We show how to construct quantum cellular automata (QCA) based on the formalism introduced by Watrous but without that formalism's "quiescent states," by using shift-invariant Lebesgue measure on Cantor space. Although QCA's with quiescent states are strictly sufficient for computational purposes, removing quiescent states as a requirement allows global QCA states with infinite support that allows the state space of the QCA to be identified with the class of interpretations of logic-based formalism in a formal methods approach to proving the correctness correctness of QCAs with respect to formal specifications.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 13, 2011•1 citation
This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators. It subsequently uses this formalism to analyze and validate several conjectures, stemming from a formal analogy between quantum computational complexity theory and classical thermodynamics, that have arisen recently in the context of black hole physics. In particular, the apparent resonance and thermalization effects present within such QCAs are investigated, and it is demonstrated that the expected exponential relationships between the quantum circuit complexity of the evolution operator, the classical entropy of the equilibrium QCA state, and the characteristic equilibration time of the QCA, all hold within this new model. Finally, a rigorous explanation for this empirical relationship is provided, as well as for the relationship with black hole thermodynamics, by drawing an explicit mathematical connection with the mean ergodic theorem, and the ergodicity of k-local quantum systems.
Abstract We introduce a formal modeling methodology to analyze quantum communication protocols in the tool Uppaal . Our approach encodes quantum states, operations, and measurements into Uppaal timed automata with data extensions and external function calls, enabling both exhaustive verification in the ideal (noiseless) case and statistical model checking for realistic noisy scenarios. We apply our framework to the Beyond Superdense Coding protocol—a time-slotted variant of superdense coding—combined with quantum entanglement distillation, and demonstrate that Uppaal can deal with these protocols even under complex timing and decoherence constraints.
We show how to construct quantum cellular automata (QCA) based on the formalism introduced by Watrous but without that formalism's "quiescent states," by using shift-invariant Lebesgue measure on Cantor space. Although QCA's with quiescent states are strictly sufficient for computational purposes, removing quiescent states as a requirement allows global QCA states with infinite support that allows the state space of the QCA to be identified with the class of interpretations of logic-based formalism in a formal methods approach to proving the correctness correctness of QCAs with respect to formal specifications.