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

Quantum Information and Computation II

Eric Donkor, Andrew R. Pirich, Howard E. Brandt

Published Aug 1, 2004• 23 citations
OpenAlex

Related papers

Quantum Information and Computation IV

Howard E. Brandt, Eric Donkor, Andrew R. Pirich

•May 30, 2005•4 citations

Quantum information and computation II : 12-14 April 2004, Orlando, Florida, USA

Eric Donkor, Andrew R. Pirich, Howard E. Brandt

•Jan 1, 2004•0 citations

Approach to Quantum Information starting from Bell's Inequality (Part I) and Statistical Analysis of Time Series Corresponding to Complex Processes (Part II)

Roberto Failla

I: Quantum information obeys laws that subtly extend those governing classical information, making possible novel effect such as cryptography and quantum computation. Quantum computations are extremely sensitive to disruption by interaction of the computer with its environment, but this problem can be overcome by recently developed quantum versions of classical error-correcting codes and fault-tolerant circuits. Based on these ideas, the purpose of this paper is to provide an approach to quantum information by analyzing and demonstrating Bell's inequality and by discussing the problems related to decoherence and error-correcting. II: The growing need for a better understanding of complex processes has stimulated the development of new and more advanced data analysis techniques. The purpose of this research was to investigate some of the already existing techniques (Hurst's rescaled range and relative dispersion analysis), to develop a software able to process time series with these techniques, and to get familiar with the theory of diffusion processes.

•May 1, 2002•0 citations

Quantum Information and Computation IX

Eric Donkor, Michael J. Hayduk

•Jun 30, 2011•2 citations

An electron's spin--Part II

Marc M. Cahay, S. Bandyopadhyay

In Part I of this article, we introduced the notion of encoding binary bit information in the spin polarization of a single electron confined in a quantum dot and placed in a magnetic field. The spin polarization becomes bistable in a magnetic field and the spin can point either parallel to the field or antiparallel to it. These two polarizations encode the classical binary bits 0 and 1. We showed that since the bits can be switched by simply flipping the electron's spin without physically moving the electron in space and causing a current, the energy dissipated during the bit flip operation could be made very small. In Part II we discuss the notion of using a single electron's spin as a quantum bit (or qubit) that represents information in quantum computers. Just as spin is superior to charge as a vehicle to host classical bit information in classical computers it turns out that spin is superior to charge to host quantum information as well. That is why spin-based quantum information processing is gradually becoming the staple of scalable solid state versions of quantum computers.

IEEE Potentials•Jul 1, 2009•5 citations

Quantum Information and Computation VI

Eric Donkor, Andrew R. Pirich, Howard E. Brandt

SPIE eBooks•May 1, 2008•1 citation
I: Quantum information obeys laws that subtly extend those governing classical information, making possible novel effect such as cryptography and quantum computation. Quantum computations are extremely sensitive to disruption by interaction of the computer with its environment, but this problem can be overcome by recently developed quantum versions of classical error-correcting codes and fault-tolerant circuits. Based on these ideas, the purpose of this paper is to provide an approach to quantum information by analyzing and demonstrating Bell's inequality and by discussing the problems related to decoherence and error-correcting. II: The growing need for a better understanding of complex processes has stimulated the development of new and more advanced data analysis techniques. The purpose of this research was to investigate some of the already existing techniques (Hurst's rescaled range and relative dispersion analysis), to develop a software able to process time series with these techniques, and to get familiar with the theory of diffusion processes.
In Part I of this article, we introduced the notion of encoding binary bit information in the spin polarization of a single electron confined in a quantum dot and placed in a magnetic field. The spin polarization becomes bistable in a magnetic field and the spin can point either parallel to the field or antiparallel to it. These two polarizations encode the classical binary bits 0 and 1. We showed that since the bits can be switched by simply flipping the electron's spin without physically moving the electron in space and causing a current, the energy dissipated during the bit flip operation could be made very small. In Part II we discuss the notion of using a single electron's spin as a quantum bit (or qubit) that represents information in quantum computers. Just as spin is superior to charge as a vehicle to host classical bit information in classical computers it turns out that spin is superior to charge to host quantum information as well. That is why spin-based quantum information processing is gradually becoming the staple of scalable solid state versions of quantum computers.