Results 1  10
of
24
A functional quantum programming language
 In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
, 2005
"... This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are inte ..."
Abstract

Cited by 46 (12 self)
 Add to MetaCart
This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive operational semantics of irreversible quantum computations, realisable as quantum circuits. The quantum circuit model is also given a formal categorical definition via the category FQC. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings, which may lead to the collapse of the quantum wavefunction, explicit. Strict programs are free from measurement, and hence preserve superpositions and entanglement. A denotational semantics of QML programs is presented, which maps QML terms
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
Open problems in computer virology
 Journal in Computer Virology
, 2006
"... Abstract. In this article, we briefly review some of the most important open problems in computer virology, in three different areas: theoretical computer virology, virus propagation modeling and antiviral techniques. For each area, we briefly describe the open problems, we review the state of the a ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract. In this article, we briefly review some of the most important open problems in computer virology, in three different areas: theoretical computer virology, virus propagation modeling and antiviral techniques. For each area, we briefly describe the open problems, we review the state of the art, and propose promising research directions. 1
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
Molecular information technology
 CR. REV. SOL. STATE
, 2005
"... Molecular materials are endowed with unique properties of unrivaled potential for high density integration of computing systems. Present applications of molecules range from organic semiconductor materials for lowcost circuits to genetically modified proteins for commercial imaging equipment. To f ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Molecular materials are endowed with unique properties of unrivaled potential for high density integration of computing systems. Present applications of molecules range from organic semiconductor materials for lowcost circuits to genetically modified proteins for commercial imaging equipment. To fully realize the potential of molecules in computation, information processing concepts that relinquish narrow prescriptive control over elementary structures and functions are needed, and selforganizing architectures have to be developed. Investigations into qualitatively new concepts of information processing are underway in the areas of reactiondiffusion computing, selfassembly computing, and conformationbased computing. Molecular computing is best considered not as competitor for conventional computing, but as an opportunity for new applications. Microrobotics and bioimmersive computing are among the domains likely to benefit from advances in molecular computing. Progress will depend on both novel computing concepts and
Information theory, evolutionary computation, and Dembski’s “complex specified information”’, Synthese 128(2): 237–270
, 2011
"... Intelligent design advocate William Dembski has introduced a measure of information called “complex specified information”, or CSI. He claims that CSI is a reliable marker of design by intelligent agents. He puts forth a “Law of Conservation of Information” which states that chance and natural laws ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Intelligent design advocate William Dembski has introduced a measure of information called “complex specified information”, or CSI. He claims that CSI is a reliable marker of design by intelligent agents. He puts forth a “Law of Conservation of Information” which states that chance and natural laws are incapable of generating CSI. In particular, CSI cannot be generated by evolutionary computation. Dembski asserts that CSI is present in intelligent causes and in the flagellum of Escherichia coli, and concludes that neither have natural explanations. In this paper we examine Dembski’s claims, point out significant errors in his reasoning, and conclude that there is no reason to accept his assertions. 1
QML: Quantum data and control
, 2005
"... We introduce the language QML, a functional language for quantum computations on finite types. QML introduces quantum data and control structures, and integrates reversible and irreversible quantum computation. QML is based on strict linear logic, hence weakenings, which may lead to decoherence, hav ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We introduce the language QML, a functional language for quantum computations on finite types. QML introduces quantum data and control structures, and integrates reversible and irreversible quantum computation. QML is based on strict linear logic, hence weakenings, which may lead to decoherence, have to be explicit. We present an operational semantics of QML programs using quantum circuits, and a denotational semantics using superoperators.
Genetic algorithm based synthesis of multioutput ternary functions using quantum cascade of generalized ternary gates
 of Generalized Ternary Gates, special issue of International Journal on MultipleValued Logic and Soft Computing, Tatjana Kalganova
, 1923
"... AbstractTernary quantum circuits have recently been introduced to help reduce the size of multivalued logic for multilevel quantum computing systems. However, synthesizing these quantum circuits is not easy. In this paper we describe a new genetic algorithm based synthesizer for ternary quantum ci ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
AbstractTernary quantum circuits have recently been introduced to help reduce the size of multivalued logic for multilevel quantum computing systems. However, synthesizing these quantum circuits is not easy. In this paper we describe a new genetic algorithm based synthesizer for ternary quantum circuits. Our results show some of the synthesized circuits use fewer gates than previously published methods. I.
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.
Coping with decoherence: Parallelizing the Quantum Fourier Transform
 In 19th International Conference on Parallel and Distributed Computing Systems
, 2006
"... Rankvarying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of the order of execution of each step [2]. This paper identi es practical instances of this computational paradi ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Rankvarying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of the order of execution of each step [2]. This paper identi es practical instances of this computational paradigm in the procedures for computing the quantum Fourier transform and its inverse. It is shown herein that under the constraints imposed by quantum decoherence, only a parallel approach can guarantee a reliable solution or, alternatively, improve scalability. 1