Results 1  10
of
15
A Rosetta stone for quantum mechanics with an introduction to quantum computation
, 2002
"... Abstract. The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading ..."
Abstract

Cited by 21 (11 self)
 Add to MetaCart
Abstract. The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading
Quantum entanglement
, 2007
"... Contents All our former experience with application of quantum theory seems to say: what is predicted by quantum formalism must occur in laboratory. But the essence of quantum formalism — entanglement, recognized by Einstein, Podolsky, Rosen and Schrödinger — waited over 70 years to enter to laborat ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Contents All our former experience with application of quantum theory seems to say: what is predicted by quantum formalism must occur in laboratory. But the essence of quantum formalism — entanglement, recognized by Einstein, Podolsky, Rosen and Schrödinger — waited over 70 years to enter to laboratories as a new resource as real as energy.
Quantum hidden subgroup algorithms on free groups, (in preparation
"... Abstract. One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the DeutschJozsa, Simon, Shor algorithms, and many more. In thi ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Abstract. One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the DeutschJozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor’s quantum factoring algorithm into its basic primitives, then to generalize these primitives, and finally to show how to reassemble them into new QHS algorithms. Taking an ”alphabetic building blocks approach, ” we use these primitives to form an ”algorithmic toolkit ” for the creation of new quantum algorithms, such as wandering Shor algorithms, continuous Shor algorithms, the quantum circle algorithm, the dual Shor algorithm, a QHS algorithm for Feynman integrals, free QHS algorithms, and more. Toward the end of this paper, we show how Grover’s algorithm is most surprisingly “almost ” a QHS algorithm, and how this result suggests the possibility of an even more complete ”algorithmic tookit ” beyond the QHS algorithms. Contents
Quantum Programming Languages: An Introductory Overview
, 2006
"... The present article gives an introductory overview of the novel field of quantum programming languages (QPLs) from a pragmatic perspective. First, after a short summary of basic notations of quantum mechanics, some of the goals and design issues are surveyed, which motivate the research in this area ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The present article gives an introductory overview of the novel field of quantum programming languages (QPLs) from a pragmatic perspective. First, after a short summary of basic notations of quantum mechanics, some of the goals and design issues are surveyed, which motivate the research in this area. Then, several of the approaches are described in more detail. The article concludes with a brief survey of current research activities and a tabular summary of a selection of QPLs, which have been published so far.
Quantum Information from GravitonMatter Gas ⋆
"... Abstract. We present basics of conceptually newtype way for explaining of the origin, evolution and current physical properties of our Universe from the gravitonmatter gas viewpoint. Quantization method for the Friedmann–Lemaître Universe based on the canonical Hamilton equations of motion is prop ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present basics of conceptually newtype way for explaining of the origin, evolution and current physical properties of our Universe from the gravitonmatter gas viewpoint. Quantization method for the Friedmann–Lemaître Universe based on the canonical Hamilton equations of motion is proposed and quantum information theory way to physics of the Universe is showed. The current contribution from the gravitonmatter gas temperature in quintessence approximation is discussed.
Covariant Mappings for the Description of Measurement, Dissipation and Decoherence in Quantum Mechanics
, 707
"... Summary. The general formalism of quantum mechanics for the description of statistical experiments is briefly reviewed, introducing in particular position and momentum observables as POVM characterized by their covariance properties with respect to the isochronous Galilei group. Mappings describing ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Summary. The general formalism of quantum mechanics for the description of statistical experiments is briefly reviewed, introducing in particular position and momentum observables as POVM characterized by their covariance properties with respect to the isochronous Galilei group. Mappings describing state transformations both as a consequence of measurement and of dynamical evolution for a closed or open system are considered with respect to the general constraints they have to obey and their covariance properties with respect to symmetry groups. In particular different master equations are analyzed in view of the related symmetry group, recalling the general structure of mappings covariant under the same group. This is done for damped harmonic oscillator, twolevel system and quantum Brownian motion. Special attention is devoted to the general structure of translationcovariant master equations. Within this framework a recently obtained quantum counterpart of the classical linear Boltzmann equation is considered, as well as a general theoretical framework for the description of different decoherence experiments, pointing to a connection between different possible behaviours in the description of decoherence and the characteristic functions of classical Lévy processes. 1
AND GEOMETRIC INVARIANT THEORY
, 2002
"... 1. Coherent states 1.1. Glauber’s coherent states 1.2. Dynamic group and general coherent states ..."
Abstract
 Add to MetaCart
1. Coherent states 1.1. Glauber’s coherent states 1.2. Dynamic group and general coherent states
and
, 2003
"... The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct effi ..."
Abstract
 Add to MetaCart
The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.
Received... Revised...
, 2003
"... Communicated by... The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allow ..."
Abstract
 Add to MetaCart
Communicated by... The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.
unknown title
, 2006
"... A sufficient and necessary condition for superdense coding of quantum states ..."
Abstract
 Add to MetaCart
A sufficient and necessary condition for superdense coding of quantum states