Ghent University Academic Bibliography

Advanced

The computational power of the square root of NOT

Steven Vandenbrande, Raphaël Van Laer UGent and Alexis De Vos UGent (2012) 10th International Workshop on Boolean Problems, Proceedings. p.257-262
abstract
The quantum gates called`square root of NOT' and `controlled square root of NOT' can be applied to synthesize circuits, many more than all classical reversible circuits, but also many less than all quantum circuits. The circuits form an infinite but discrete group, i.e. a group with a countable infinity of elements. They are represented by unitary matrices. Classifying these matrices by `level' allows a detailed quantification of the computational power of the circuits.
Please use this url to cite or link to this publication:
author
organization
year
type
conference
publication status
published
subject
keyword
reversible computing, square root of NOT, quantum computing
in
10th International Workshop on Boolean Problems, Proceedings
editor
Bernd Steinbach
pages
257 - 262
publisher
Bergakademie Freiberg
place of publication
Freiberg, Germany
conference name
10th International Workshop on Boolean Problems
conference location
Freiberg, Germany
conference start
2012-09-19
conference end
2012-09-21
ISBN
9783860124383
language
English
UGent publication?
yes
classification
C1
copyright statement
I have retained and own the full copyright for this publication
id
2997670
handle
http://hdl.handle.net/1854/LU-2997670
date created
2012-09-24 08:21:50
date last changed
2012-09-26 14:46:23
@inproceedings{2997670,
  abstract     = {The quantum gates called`square root of NOT' and `controlled square root of NOT' can be applied to synthesize circuits, many more than all classical reversible circuits, but also many less than all quantum circuits. The circuits form an infinite but discrete group, i.e. a group with a countable infinity of elements. They are represented by unitary matrices. Classifying these matrices by `level' allows a detailed quantification of the computational power of the circuits.},
  author       = {Vandenbrande, Steven and Van Laer, Rapha{\"e}l and De Vos, Alexis},
  booktitle    = {10th International Workshop on Boolean Problems, Proceedings},
  editor       = {Steinbach, Bernd},
  isbn         = {9783860124383},
  keyword      = {reversible computing,square root of NOT,quantum computing},
  language     = {eng},
  location     = {Freiberg, Germany},
  pages        = {257--262},
  publisher    = {Bergakademie Freiberg},
  title        = {The computational power of the square root of NOT},
  year         = {2012},
}

Chicago
Vandenbrande, Steven, Raphaël Van Laer, and Alexis De Vos. 2012. “The Computational Power of the Square Root of NOT.” In 10th International Workshop on Boolean Problems, Proceedings, ed. Bernd Steinbach, 257–262. Freiberg, Germany: Bergakademie Freiberg.
APA
Vandenbrande, S., Van Laer, R., & De Vos, A. (2012). The computational power of the square root of NOT. In Bernd Steinbach (Ed.), 10th International Workshop on Boolean Problems, Proceedings (pp. 257–262). Presented at the 10th International Workshop on Boolean Problems, Freiberg, Germany: Bergakademie Freiberg.
Vancouver
1.
Vandenbrande S, Van Laer R, De Vos A. The computational power of the square root of NOT. In: Steinbach B, editor. 10th International Workshop on Boolean Problems, Proceedings. Freiberg, Germany: Bergakademie Freiberg; 2012. p. 257–62.
MLA
Vandenbrande, Steven, Raphaël Van Laer, and Alexis De Vos. “The Computational Power of the Square Root of NOT.” 10th International Workshop on Boolean Problems, Proceedings. Ed. Bernd Steinbach. Freiberg, Germany: Bergakademie Freiberg, 2012. 257–262. Print.