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

Springer eBooks

Sequential Quantum Logic

Ernst-Walther Stachow

Published Jan 1, 1981• 8 citations
Publisher
DOI
10.1007/978-1-4613-3228-2_13

Related papers

Extended Quantum Logic

Kenji Tokuo

Journal of Philosophical Logic•Sep 23, 2003•6 citations

Entropy of Partitions on Sequential Effect Algebras

Wang Jia-Mei, Junde Wu, Cho Minhyung

By using the sequential effect algebra theory, we establish the partitions and refinements of quantum logics and study their entropies.

arXiv:0908.2510•Communications in Theoretical Physics•Mar 1, 2010•6 citations

Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer

Matthew Leifer

In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum gravity. In this letter, I give a method for deciding the truth of a proposition in SQL with nonzero probability of success on a quantum computer.

arXiv:quant-ph/0509193•Sep 28, 2005•0 citations

Quantum Logic

Peter Mittelstaedt

Springer eBooks•Jan 1, 2009•4 citations

Quantum logic

Peter Gibbins

•Jan 1, 1997•0 citations

On design of multiple-valued sequential reversible circuits for nanotechnology based systems

Majid Mohammadi, Mohammad Eshghi, Majid Haghparast

Multiple-valued reversible logic is an emerging area in reversible and quantum logic circuit synthesis. Multiple-valued reversible logic circuits can potentially reduce the width of the reversible or quantum circuit which is a limitation in current quantum technology. In this paper we propose a method to synthesize the multiple-valued reversible sequential circuits. Implementations for ternary D and T flip flops and edge triggered D flip flop are proposed. Synthesis of generalized fanout circuit and generalized r-valued T flip flop are also presented.

IEEE Region 10 Conference (TENCON)•Nov 1, 2008•18 citations
In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum gravity. In this letter, I give a method for deciding the truth of a proposition in SQL with nonzero probability of success on a quantum computer.
Multiple-valued reversible logic is an emerging area in reversible and quantum logic circuit synthesis. Multiple-valued reversible logic circuits can potentially reduce the width of the reversible or quantum circuit which is a limitation in current quantum technology. In this paper we propose a method to synthesize the multiple-valued reversible sequential circuits. Implementations for ternary D and T flip flops and edge triggered D flip flop are proposed. Synthesis of generalized fanout circuit and generalized r-valued T flip flop are also presented.