Advanced search
1 file | 112.87 KB

Almost-classical quantum computers

Michiel Boes (UGent) , Alexis De Vos (UGent) and Jan De Beule (UGent)
Author
Organization
Abstract
By means of a subgroup of the 2 X 2 unitary matrices, i.e. a subgroup Q of U(2), acting on a single qubit, we create a group X, acting on w qubits. If Q equals the group of order 2 consisting of the follower and the inverter, we recover S_{2^w}, i.e. the permutation matrices describing a classical reversible computer acting on w bits. If Q is another group of two 2 X 2 matrices, then a new kind of computing appears.
Keywords
reversible computer, group theory, quantum computer

Downloads

  • revised paper6.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 112.87 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Boes, Michiel, Alexis De Vos, and Jan De Beule. 2010. “Almost-classical Quantum Computers.” In Boolean Problems, 9th International Workshop, Proceedings, ed. Bernd Steinbach, 51–56. Freiberg, Germany: Freiberg University of Mining and Technology.
APA
Boes, Michiel, De Vos, A., & De Beule, J. (2010). Almost-classical quantum computers. In Bernd Steinbach (Ed.), Boolean Problems, 9th International workshop, Proceedings (pp. 51–56). Presented at the 9th International workshop on Boolean Problems, Freiberg, Germany: Freiberg University of Mining and Technology.
Vancouver
1.
Boes M, De Vos A, De Beule J. Almost-classical quantum computers. In: Steinbach B, editor. Boolean Problems, 9th International workshop, Proceedings. Freiberg, Germany: Freiberg University of Mining and Technology; 2010. p. 51–6.
MLA
Boes, Michiel, Alexis De Vos, and Jan De Beule. “Almost-classical Quantum Computers.” Boolean Problems, 9th International Workshop, Proceedings. Ed. Bernd Steinbach. Freiberg, Germany: Freiberg University of Mining and Technology, 2010. 51–56. Print.
@inproceedings{1044933,
  abstract     = {By means of a subgroup of the 2 X 2 unitary matrices, i.e. a subgroup Q of U(2), acting on a single qubit, we create a group X, acting on w qubits. If Q equals the group of order 2 consisting of the follower and the inverter, we recover S\_\{2\^{ }w\}, i.e. the permutation matrices describing a classical reversible computer acting on w bits. If  Q is another group of two 2 X 2 matrices, then a new kind of computing appears.},
  author       = {Boes, Michiel and De Vos, Alexis and De Beule, Jan},
  booktitle    = {Boolean Problems, 9th International workshop, Proceedings},
  editor       = {Steinbach, Bernd},
  keyword      = {reversible computer,group theory,quantum computer},
  language     = {eng},
  location     = {Freiberg, Germany},
  pages        = {51--56},
  publisher    = {Freiberg University of Mining and Technology},
  title        = {Almost-classical quantum computers},
  year         = {2010},
}