Universal sets of quantum information processing primitives and their optimal use

Authors:
J. Gruska
Affiliations:
-
Venue:
General Theory of Information Transfer and Combinatorics
Year:
2006

Citing 10
Cited 1

Quantum complexity theory

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Quantum Computability

SIAM Journal on Computing
Nonlocal Properties of Two-Qubit Gates and Mixed States, and the Optimization of Quantum Computations

Quantum Information Processing
Reversible logic circuit synthesis

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Classical and Quantum Computation

Classical and Quantum Computation
Fault-tolerant quantum computation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Quantum entanglement as a new information processing resource

New Generation Computing - Quantum computing
Transformation rules for CNOT-based quantum circuits and their applications

New Generation Computing - Quantum computing
An Explicit Universal Gate-Set for Exchange-Only Quantum Computation

Quantum Information Processing
An exact effective two-qubit gate in a chain of three spins

Quantum Information & Computation

Algebraic methods in quantum informatics

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers several concepts of universality in quantum information processing and deals with various (sometimes surprising) universal sets of quantum primitives as well as with their optimal use.