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

International Journal of Theoretical Physics

Quantum Logic as a Basis for Computations

Jarosław Pykacz

Published Mar 1, 2000• 7 citations
Publisher
DOI
10.1023/a:1003678913718

Related papers

Quantum logic and quantum computation

Mladen Pavičić, Norman D. Megill

Elsevier eBooks•Jan 1, 2007•16 citations

Development of Quantum Logic and Its Theoretical Foundation

Bang-Hai Wang

The emergence of quantum information and quantum computing is the inevitable choice in the development of information science. Introduces the historical development of quantum logic,research and the theoretical foundation of quantum logic related to orthomodular lattice on the basis of the closed subspace of Hilbert space and several open issues. Based on the above content,introduces the enormous computing power source of quantum computing and looks forward to the possibility of a quantum logic research.

Modern Computer•Jan 1, 2009•0 citations

Quantum Logic and Related Systems

Akira Ocirc IDE

Annals of the Japan Association for Philosophy of Science•Jan 1, 1983•1 citation

Universal quantum computation with shutter logic

Juan Carlos García-Escartín, Pedro Chamorro‐Posada

We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum computer. An interaction-free model for a quantum shutter is given.

arXiv:quant-ph/0504215•Quantum Information and Computation•Sep 1, 2006•0 citations

Quantum Computational Logics and Possible Applications

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

International Journal of Theoretical Physics•Jul 27, 2007•3 citations

Scheme for Quantum Computing Immune to Decoherence

Colin P. Williams, Farrokh Vatan

A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.

•Mar 1, 2008•0 citations
The emergence of quantum information and quantum computing is the inevitable choice in the development of information science. Introduces the historical development of quantum logic,research and the theoretical foundation of quantum logic related to orthomodular lattice on the basis of the closed subspace of Hilbert space and several open issues. Based on the above content,introduces the enormous computing power source of quantum computing and looks forward to the possibility of a quantum logic research.
A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.