This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
Quantum Algorithms - Chakraborty, Bera (2002)(Correct)
this paper, we have in looked into some theoritical problems and tried to see how quantum algorithms performs in those
cases. We have shown that collision-finding as well as element-distinctness probl... / INDIA . Introduction to Quantum Computation The basic unit of br The basic unit of storage in a quantum computer is the qubit. A qubit is
Size of finite probabilistic and quantum automata - Bonner, Freivalds, Rasscevskis (2002)(Correct)
Rabin[Rab63] proved that if arbitrary language is accepted
by some probabilistic automaton with an isolated cutpoint then there exists
some deterministic automaton that accepts this language. He showe... / practical experiments in quantum computing can be viewed as building br Finite Automata. In Quantum Computation and Learning. Proceedings
Computational Intelligence - Craenen, Eiben (2002)(Correct)
this paper) formulating it this way:
Note that Eberhart et al. identify computational intelligence and adaptation unknown B.C. Craenen
bcraenen@cs.vu.nl
Faculty of Exact Sciences
Vrije Universit... /
The Future of Mathematical Software - Kortenkamp (2002)(Correct)
This article gives my very personal view of the development of (mathematical)
software in the past and in the future. It is based both on my
experiences as a user and as an author of math software [1]... /
On Quantum Computation Theory - van Dam (2002)(Correct)
The content of the Chapters 3 through 7 of this Ph.D. thesis corresponds with the following articles written by the author. unknown ILLC Dissertation Series 2002-04
For further information about ILLC... /
Quantum Software - Francik (2002)(Correct)
this paper we will try to look
at the problem as a new branch of informatics. The object of our interests is quantum software:
information processing analyzed apart from its physical realization unkno... /
Modeling the operation of Margolus quantum cellular automaton using.. - Parviainen (2002)(Correct)
OF THE
MASTER'S THESIS
Author: Elina Parviainen
Name of the Thesis:
Name in Finnish:
Date: May 6, 2002 Pages: iv+64
Department: Computer Science
and Engineering
Chair: T-119
Supervisor: P... / of Petri nets for modeling of quantum computers. One possible modeling br beginning the basic concepts of quantum computation are given and the target
Data Security - Jones (2001)(Correct)
etwork security. Mandatory reading for aspiring system managers.
Antonia J. Jones:18 December 2001
2
W. Stallings. Cryptography and Network Security: Principles and Practice. Prentice
Hall. 1998. I... / Jones December Quantum computing br if it has been done . Quantum computing does not become a reality.
Quantum Information Theory - an Invitation - Werner (2001)(Correct)
Quantum Theory of Information. Recall the arguments in Section 2, where the possibility of translating between di#erent carriers of (classical) information was taken as the justification for looking a... / . QuantumComputation . br Quantum Information and Quantum Computers have received a lot of
Testing Hypergraph Coloring - Czumaj, Sohler (2001)(Correct)
In this paper we initiate the study of testing properties of hypergraphs. The goal of
property testing is to distinguish between the case whether a given object has a certain
property or is "far awa... /
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2001)(Correct)
A language L has a property tester if there exists a probabilistic algorithm that given an input
x only asks a small number of bits of x and distinguishes the cases as to whether x is in L and x has
... / have seen many examples where quantum computation gives us an advantage br may naturally ask whether using quantum computation may lead to better
Toward an architecture for quantum programming - Bettelli, Calarco, Serafini (2001)(Correct)
It is becoming increasingly clear that, if a useful device for quantum computation will
ever be built, it will be embodied by a classical computing machine with control over a
truly quantum subsystem,... / that if a useful device for quantum computation will ever be built it br a mixture of classical and quantum computation. This paper
Quantum Haar Wavelet Transforms and Their Applications - Gosal, Lawton (2001)(Correct)
this paper, we construct quantum
algorithms for Haar wavelet transforms and show its application in analyzing
the multi-scale structure of the dynamical system by the Logistic Map (x
#
#x(1
-
x)),... / th century they are quantum computation quantum cryptography br science and technology. Quantum Computation not only fascinates
Finding Solutions to NP Problems: Philosophical Differences Between.. - Greenwood (2001)(Correct)
This paper uses instances of SAT, 3SAT and
TSP to describe how evolutionary search (running on a
classical computer) differs from quantum search (running
on a quantum computer) for solving NP problems... / quantum search running on a quantum computer for solving NP problems. br This new approach is called quantum computing and it relies on the
Graphs, Quadratic Forms, and Quantum Codes (Extended Abstract) - Grassl, Klappenecker, Rötteler (2001)(Correct)
We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The techniq... / Systeme IAKS Arbeitsgruppe Quantum Computing Prof. Th. Beth Fakultat br appear in The Mathematics of Quantum Computation R. Brylinski and G.
A class of special matrices and quantum entanglement - Fei, Li-Jost (2001)(Correct)
We present a kind of construction for a class of special matrices with
at most two different eigenvalues, in terms of some interesting multiplicators
which are very useful in calculating eigenvalue po... / information processing and quantum computing especially in the br coding decoherence in quantum computers and the evaluation of
Multi-party Quantum Computation - Smith (2001)(Correct)
We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no as... /
One Complexity Theorist's View of Quantum Computing - Fortnow (2000)(Correct)
The complexity of quantum computation remains poorly understood. While physicists attempt to nd ways to create quantum computers, we still do not have much evidence one way or the other as to how usef... / Complexity Theorist's View of Quantum Computing Lance Fortnow NEC br Abstract The complexity of quantum computation remains poorly
Characterization of Non-Deterministic Quantum Query and Quantum.. - de Wolf (2000)(Correct)
It is known that the classical and quantum query complexities of a total Boolean function f
are polynomially related to the degree of its representing polynomial, but the optimal exponents
in these ... / complexity. Keywords Quantum computing query complexity br where Alice and Bob have a quantum computer and can exchange qubits.
Computational Complexity for Physicists - Mertens (2000)(Correct)
These lecture notes are an informal introduction to the theory of
computational complexity and its links to quantum computing and statistical mechanics.
1 Introduction
1.1 Motivation
Compared to... / complexity and its links to quantum computing and statistical mechanics. br given at the DPG school on Quantum Computing Bad Honnef Oct. -
Average-Case Quantum Query Complexity - Ambainis, de Wolf (2000)(Correct)
We compare classical and quantum query complexities of total Boolean functions. It is known
that for worst-case complexity, the gap between quantum and classical can be at most polynomial
[BBC
+
98]... / complexity. Keywords Quantum computing. Computational complexity. br Introduction The field of quantum computation studies the power of
Quantum Games And Quantum Algorithms - Meyer (2000)(Correct)
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize t... / volume April Quantum Computation and Quantum Information br at the Special Session on Quantum Computation and Information at the
Quantum Lower Bounds by Quantum Arguments - Ambainis (2000)(Correct)
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a
classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum
adve... / into the limitations of quantum computing. For example the unordered br of solving these problems on a quantum computer. For two related problems -
Reflections on Quantum Computing - Calude, Dinneen, Svozil (2000)(Correct)
In this rather speculative note three problems pertaining to the power and limits of quantum computing are posed and partially answered: a) when are quantum speedups possible?, b) is fixed-point compu... / Series Reflections on Quantum Computing Cristian S. Calude br Science Reflections on Quantum Computing C. S. Calude M.
Correlation And Coherence IN QUANTUM-DOT CELLULAR AUTOMATA - Toth (2000)(Correct)
by Gza Tth In this thesis we investigate the role of correlation and coherence in two possible realizations of Quantum-dot Cellular Automata (QCA): realizations as a semiconductor multi-quantum-dot st... / to investigate possibility of quantum computing with QCA. Using the br coherence vector formalism Quantum computing with Quantum-dot Cellular
Quantum Algorithms for Element Distinctness - Buhrman, Dürr, Heiligman.. (2000)(Correct)
We present several applications of quantum amplitude amplification to finding claws
and collisions in ordered or unordered functions. Our algorithms generalize those of
Brassard, Hyer, and Tapp, and... / problems. Keywords Quantum computing element distinctness query br In the last decade quantum computing has become a prominent and
Lecture Notes on Quantum Statistics - Gill (2000)(Correct)
law of large numbers, and the aim was to compute expectated values and correlations. Thus quantum physics provided exact predictions of non-random, aggregate properties. Statistical questions might ha... / speculation on such topics as quantum computing quantum cryptography and br role of up' and down'In quantum computation the word qubit is used
Normal Subgroup Reconstruction and Quantum Computation Using Group.. - Hallgren, Russell, al. (2000)(Correct)
The Hidden Subgroup Problem is the foundation of many quantum algorithms. An efficient solution is known for the problem over Abelian groups and this was used in Simon's algorithm and Shor's Factoring... / Subgroup Reconstruction and Quantum Computation Using Group br Inc. . Robert Beals. Quantum computation of Fourier transforms
Methods Of Quantum Error Correction - Grassl (2000)(Correct)
Owing to the high sensitivity of quantum mechanical systems to
even small perturbations, means of error protection are essential
for any computation or communication process based on quantum
mechanics... / Grassl Arbeitsgruppe Quantum Computing Prof. Thomas Beth Institut br communication purposes. On a quantum computer large integers could be
Linking Classical and Quantum Key Agreement: Is There "Bound.. - Gisin (2000)(Correct)
After carrying out a protocol for quantum key agreement
over a noisy quantum channel, the parties Alice and Bob must process
the raw key in order to end up with identical keys about which the
adv... / hardware engineering e.g.quantum computing Information-theoretic
Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, Tapp (2000)(Correct)
Consider a Boolean function : X ! f0; 1g that partitions set
X between its good and bad elements, where x is good if (x) = 1
and bad otherwise. Consider also a quantum algorithm A such that
Aj0i ... / was done while at Centre for Quantum Computation Clarendon Laboratory br of settings. Keywords Quantum computation. Searching. Counting.
An octonion model for physics - Kainen (2000)(Correct)
The division algebra of highest possible dimension over the reals is taken as a model for various physical and mathematical phenomena mostly related to the Four Color Conjecture. A geometric form of a... / formulation suggested by quantum computing and quantum algebra. In br is capable of carrying out a quantum computation it can always make such
Quantum Algorithms for Finding Claws, Collisions and Triangles - Buhrman, Dürr, Høyer.. (2000)(Correct)
We present several applications of quantum amplitude amplification
to finding claws and collisions in ordered or unordered functions.
Our algorithms generalize those of Brassard, Hyer, and Tapp, and
i... / In the last decade quantum computing has become one of the most br Realizing the promise of quantum computers requires two things
Beyond Bits: The Future of Quantum Information Processing - Steane, Rieffel (2000)(Correct)
tory of computing, the bit has remained the basic computational unit of information. Quantum mechanics enables the encoding of information in quantum bits (qubits). Unlike a classical bit, which can s... / Quantum Information Theory. Quantum Computing Throughout The History Of br values at once. Quantum computers can perform computations
Quantum Computing and Communication Complexity - Buhrman (2000)(Correct)
Quantum computing combines the framework of quantum mechanics
with that of computer science. In this paper we give a short introduction
to quantum computing and survey the results in the area of qua... / Quantum Computing and Communication br and Computer Science Quantum Computing and Advanced Systems
Quantum Factor Graphs - Parker (2000)(Correct)
The natural Hilbert Space of quantum particles can implement maximumlikelihood
(ML) decoding of classical information. The 'Quantum Product Algorithm' (QPA) is
computed on a Factor Graph, where func... / Computation Sequence Design Quantum Computation and Coding Theory. br Keywords Factor Graphs Quantum Computation Quantum Algorithms Sum
On quantum and probabilistic communication: Las Vegas and one-way.. - Klauck (2000)(Correct)
We investigate the power of quantum communication protocols compared to classical probabilistic protocols. In our first result we describe a total Boolean function that has a quantum Las Vegas protoco... / investigation of the power of quantum computation has attracted much br have been rede ned as quantum computing systems e.g. quantum nite
Prequential Quantum Dynamics - Laskey (2000)(Correct)
Importation of methods from statistical
physics into machine learning has led to rapid
advances in methods for efficient learning of
good representations for complex problems.
This paper examines ... / artificial intelligence and quantum computing are explored. An explicitly br be dominant in the field of quantum computing. Another is the pilot wave
A Graph-Theoretic Model for Time - Kainen (2000)(Correct)
Time is ordinarily viewed as a path or cycle. Graph models are considered which are a maximal
extension of the old ones, subject to a topological constraint. It is shown that the new models have
enh... /
LOCNET: Localisation by Nonlinearity and Spatial Discreteness, and.. - MacKay (2000)(Correct)
Cavendish Laboratory, University of Cambridge, UK
J-A.Sepulchre, Institut Non-Lineaire de Nice-Sophia, Sophia Antipolis, FRANCE
D.Hennig, Fachbereich Physik, Freie Universitat, Berlin, GERMANY... / central to plans to realise quantum computing Nat and an understanding br the recent wave of interest in quantum computing the potential advantages
Simplified Proof of the Fourier Sampling Theorem - Hoyer (2000)(Correct)
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, A... / recent years the theory of quantum computing has been greatly developed br an excellent introduction to quantum computing see for example Any
Computing with Quanta - Impacts of Quantum Theory on Computation - Hirvensalo (2000)(Correct)
this article will appear in a special issue of unknown Computing with Quanta { Impacts
of Quantum Theory on
Computation
Mika Hirvensalo
Turku Centre for Computer Science
No 386, December 2000
C... / . Devices for Quantum Computation . Quantum Finite br . The Power of Quantum Computing . The Discrete
Scalable Entanglement of Trapped Ions - Monroe, Sackett, Kielpinski, King.. (2000)(Correct)
Entangled states are both a crucial component in quantum computers, and
of great interest in their own right, highlighting the inherent nonlocality of quantum
mechanics. As part of the drive towar... / are both a crucial component in quantum computers and of great interest in br larger entangled states for quantum computing we have engineered the
Grover's Search Algorithm and Quantum Lower Bounds - Vazirani (2000)(Correct)
4.35> y to ( 1 0 - )# 2 , the oracle acts as
U f :
-
-
-
2
1 0
) 1 (
2
1 0 ) (
x x
x f
.
Now suppose that there is a single value k such that f(k) = 1. If f is specified by a
bl... / Lecture Notes for CS - Quantum Computing Lecturer Umesh Vazirani br O N running time. Can a quantum computer search a needle in a
Quantum transport in magneto-optical double-potential wells - Deutsch (2000)(Correct)
We review the quantum transport of ultra-cold alkali atoms trapped in a one-dimensional optical lattice of double-potential wells, engineered through a combination of ac-Stark shifts and Zeeman inte... / processing such as quantum computing In one proposal br T ed Introduction to Quantum Computation and Information
Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous .. - Seifert (2000)(Correct)
While quantum computers might speed up in principle certain computations dramatically,
in pratice, though quantum computing technology is still in its infancy. Even we cannot clearly
envison at pres... / Germany Abstract. While quantum computers might speed up in principle br in pratice though quantum computing technology is still in its
Algorithms for Quantum Control Based on Decompositions of Lie Groups - Alessandro (2000)(Correct)
Algorithms for the control of quantum mechanical systems
are presented which are based on decompositions
of Lie groups. The derived control laws drive the state
of two and four level systems to any de... / Systems on Lie Groups Quantum Computing. Introduction The state br interest in scenarios like quantum computing where the state of the
Quantum Computing with Neutral Atoms in an Optical Lattice - Deutsch (2000)(Correct)
We present a proposal for quantum information processing with neutral atoms trapped in optical lattices as qubits. Initialization and coherent control of single qubits can be achieved with standard ... / of Forschritte der Physik Quantum Computing with Neutral Atoms in an br for scalable fault-tolerant quantum computation. I. The Tao of Quantum
Bayesian Reconstruction of Approximately Periodic Potentials for.. - Lemm, Uhlig, Weiguny (2000)(Correct)
The paper discusses the reconstruction of potentials for quantum systems at nite temperatures from observational data. A nonparametric approach is developed, based on the framework of Bayesian stati... / A similar problem appears in quantum computing when reading o the result br measuring the nal state of a quantum computer Inverse scattering
Quantum Computation for Physical Modeling - Yepez (2000)(Correct)
anics
(the continuity equation and the Navier-Stokes equation) are undergoing testing.
Unfortunately, the present day NMR technique is not likely to scale to
more than a dozen qubits per quantum compu... / Univerity - June Quantum Computation for Physical Modeling br of this task is to explore quantum computational models of dynamical
On Rounds in Quantum Communication - Klauck (2000)(Correct)
We investigate the power of interaction in two player quantum communication protocols. Our main result is a rounds-communication hierarchy for the pointer jumping function f k . We show that f k needs... /
Genetic Algorithms for Quantum Circuit Design --Evolving a Simpler.. - Taro Yabuki Yabuki (2000)(Correct)
We propose a method to apply genetic algorithms
to the quantum
circuitdesign.
We
show by experiments that without any deep
knowledge of the problem it is possible to
evolve a circuit for the quantum t... / quantum teleportation quantum computer quantum computing br quantum computer quantum computing quantumcircuit.
A Quantum Lattice-Gas Model for Computational Fluid Dynamics - Yepez (1999)(Correct)
Quantum-computing ideas are applied to the practical and ubiquitous
problem of fluid dynamics simulation. Hence, this paper addresses two
separate areas of physics: quantum mechanics and fluid dynamic... / August Abstract Quantum-computing ideas are applied to the br on August and at the Quantum Computing Colloquium MIT on
Solving Highly Constrained Search Problems with Quantum Computers - Hogg (1999)(Correct)
A previously developed quantum search algorithm for solving 1-SAT problems in a
single step is generalized to apply to a range of highly constrained k-SAT problems. We
identify a bound on the number o... / Search Problems with Quantum Computers Tad Hogg br . Introduction Quantum computers Benioff Bernstein
Automatic Creation of Human-Competitive Computer Programs by Means of .. - Koza, al. (1999)(Correct)
Genetic programming is an automatic method for creating a computer program to solve a problem. This paper
first reviews various instances where genetic programming has previously produced human compe... / These examples involve quantum computing the Robo Cup competition br . Genetic programming for quantum computers. In Koza John R.
Lattice-Gas Quantum Computing - Yepez (1999)(Correct)
past several years, have focused on aspects of question No.3
[12, 5, 13, 14]. Many experimental physicists have more recently considered
No.2, building prototype single-gate quantum computers as a fir... / Lattice-Gas Quantum Computing Grant No. br based on quantum mechanics quantum computing In
The search for a practical 'Ultimate Laptop': A Comparison of.. - Daley (1999)(Correct)
This paper will provide
a short introduction to these fields and electronic computing followed by a
point by point comparison and analysis. The goal here is not to determine
a single "best" model of c... / Electronic Biomolecular and Quantum Computing Mark Daley September br . . Quantum Computing .
On a DNA experiment for solving a certain NP-complete problem - Stoschek, Sturm, Hinze (1999)(Correct)
The publication of the Adleman experiment in 1994 gave the crucial impetus for many approaches to DNA computing as one possible form of future computing [Adl94]. There is worldwide discussion about ch... / to future computing quantum computing neural computing and DNA br of approaches to future computing quantum computing neural
Quantum Computation: Theory and Implementation - Boyden, III (1999)(Correct)
unknown Quantum Computation: Theory and Implementation
by
Edward Stuart Boyden III
Submitted to the Department of Physics
in Partial Fulfillment of the Requirements for the Degree of
Bachelor of Sc... / Quantum Computation Theory and br Ii. Models Of Quantum
Learning DNF Over The Uniform Distribution Using A Quantum Example.. - Bshouty, Jackson (1999)(Correct)
We generalize the notion of probably approximately correct (PAC) learning from an example oracle to a notion of e#cient learning on a quantum computer using a quantum example oracle. This quantum exam... / notion of e cient learning on a quantum computer using a quantum example br quantum example oracle quantum computing disjunctive normal form
Relations between Classical and Quantum Error-Correcting Codes - Grassl, Beth (1999)(Correct)
In this survey we describe relations between classical and
quantum error--correcting codes. After a brief introduction to both quantum
computation and classical linear error--correcting codes, we sh... / Dr. Th. Beth Arbeitsgruppe Quantum Computing Universitat Karlsruhe Am br a brief introduction to both quantum computation and classical linear
Molecular Scale Heat Engines and Scalable Quantum Computation - Schulman (1999)(Correct)
We describe a quantum mechanical heat engine. Like its
classical counterpart introduced by Carnot, this engine carries
out a reversible process in which an input of energy to
the system results in a s... / Scale Heat Engines and Scalable Quantum Computation Leonard J. Schulman br proposed for implementation of quantum computers begin with the quantum
Finding a Better-than-Classical Quantum AND/OR Algorithm using.. - Spector, al. (1999)(Correct)
This paper documents the discovery of a new, better-than-classical quantum algorithm for the depthtwo AND/OR tree problem. We describe the genetic programming system that was constructed specifically ... / for this work the quantum computer simulator that is used to br algorithm. Introduction Quantum computers use the dynamics of
Using Artificial Physics to Control Agents - Spears, Gordon (1999)(Correct)
We introduce a novel framework called "artificial
physics", which is used to provide distributed control
of large collections of agents. The agents react to artificial
forces that are motivated by nat... / based on nature such as quantum computing molecular computing and br N.and Chuang I. . Quantum computing with molecules. Sci. Amer.
The quantum query complexity of approximating the median and related.. - Nayak, Wu (1999)(Correct)
Let X = (x 0 ; : : : ; xn\Gamma1 ) be a sequence of n numbers. For ffl ? 0, we say that x i is an ffl-approximate
median if the number of elements strictly less than x i and the number of elements st... / is a formidable task and quantum computers are no exception to this. br such step in the field of quantum computation was taken by Bennett et
Quantum Reed-Solomon Codes - Grassl, Geiselmann, Beth (1999)(Correct)
We introduce a new class of quantum error--correcting codes
derived from (classical) Reed--Solomon codes over finite fields of characteristic
two. Quantum circuits for encoding and decoding based on... / Systeme Arbeitsgruppe Quantum Computing Universitat Karlsruhe Am br p n see Quantum computers are not only of theoretical
DNA computing: a new computational paradigm using molecules - Pisanti (1999)(Correct)
DNA computing appeared in the literature in 1994 when Leonard Adleman suggested to solve an NP-complete problem by using DNA molecules. Since one can store a large amount of molecules in a small volum... / computing which includes quantum computing and the more recent DNA
Quantum Information Research Supports Consciousness as Information - Doug Matzke Msee (1999)(Correct)
This paper describes the quantum gravity
research that is applicable to the idea that
consciousness is primarily an informational system.
By understanding quantum states as an information
system, the ... / and high temperatures. Quantum Computation In Peter Shor br could be useful to obtain quantum computation. A traditional bit can
Quantum Computation and Shor's Factoring Algorithm - de Wolf (1999)(Correct)
The field of quantum computation studies the power of computers that are based on quantummechanical
principles. We give a brief introduction to the model of quantum computation and
to its main success... / Quantum Computation and Shor's Factoring br Abstract The field of quantum computation studies the power of
Quantum Fourier Sampling Simplified - Hales, Hallgren (1999)(Correct)
We isolate and generalize a technique implicit in many
quantum algorithms, including Shor's algorithms for
factoring and discrete log. In particular, we show that
the distribution sampled after a Four... / of the fourier transform in quantum computing is nding a hidden subgroup br Bea Robert Beals. Quantum computation of Fourier transforms
Type-II Quantum Computers - Yepez (1999)(Correct)
This paper discusses a computing architecture that uses both classical
parallelism and quantum parallelism. We consider a large parallel array of
small quantum computers, connected together by class... / Revision . Type-II Quantum Computers Je rey Yepez Air br large parallel array of small quantum computers connected together by
Quantum Oracle Interrogation: Getting All Information for Almost Half .. - van Dam (1999)(Correct)
Consider a quantum computer in combination with a binary oracle of domain size N . It is shown how N=2 + p N calls to the oracle are sufficient to guess the whole content of the oracle (being an N bit... / Wim van Dam Centre for Quantum Computation University of Oxford br Oxford OX PU U.K. Quantum Computing and Advanced Systems
An Organic Database System - Kersten, Siebes (1999)(Correct)
The pervasive penetration of database technology may suggest that we have reached the end of the database
research era. The contrary is true. Emerging technology, in hardware, software, and connectiv... / seems tractable PRS Quantum computing uses the physics of light to
Almost-Everywhere Superiority for Quantum Computing - Hemaspaandra, Hemaspaandra, Zimand (1999)(Correct)
Simon [Sim97] as extended by Brassard and H yer [BH97] shows that there are
tasks on which quantum machines are exponentially faster than each classical machine
in nitely often. The present paper show... / Superiority for Quantum Computing Edith Hemaspaandra br the potential superiority of quantum computation over classical
Quantum Computing is a Two-Trick Pony - Marjanovic (1999)(Correct)
Two milestones in the brief history of quantum computation (QC) are Shor's algorithm
for prime factorization and Grover's algorithm for database search, which yield
exponential and square root compl... / Quantum Computing is a Two-Trick Pony br in the brief history of quantum computation QC are Shor's algorithm
Contract for: Shared-cost RTD - Programme (1999)(Correct)
Introduction to Computational Learning
Theory, MIT Press, 1995, with Michael Kearns).
He got his B.S. in computer science from M.I.T. in 1981, and his PhD from U.C. Berkeley in 1985
under the guidanc... / who has done seminal work in quantum computation computational br His Current Research involves Quantum computing quantum information
The Church-Turing Thesis - Sicard, Vélez (1999)(Correct)
this paper) and independently
of the matter of considering Church's and Turing's thesis as de
nitions
(in any philosophical sense), or as empirical or mathematics thesis, we think
that Church's thesi... /
Separable States Of N Quantum Bits - Schack, Caves (1999)(Correct)
The state of N two-level quantum systems (quantum bits or qubits) is called separable if it can be represented as a mixture of tensor product states, i.e., if it can be written as a probability distri... / nuclear magnetic resonance quantum computing. Introduction br states used in present-day NMR quantum computing In Sec. we
Cellular Gravity - Gruau, Tromp (1999)(Correct)
We consider the problem of establishing gravity in cellular automata. In particular, when cellular automata
states can be partitioned into empty, particle, and wall types, with the latter enclosing re... / out under research theme INS Quantum Computing and Advanced Systems
Classical model for bulk-ensemble NMR quantum computation - Schack, Caves (1999)(Correct)
We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quan... / model for bulk-ensemble NMR quantum computation Rudiger Schack br model for bulk-ensemble NMR quantum computation the quantum state of
Future resiliency: a possible new AES criterion - Johnson (1999)(Correct)
This
paper introduces the new term of "future resiliency" and proposes
that NIST strive to ensure that the initial culling of the fifteen initial
AES candidates to "about five" second round finalist c... / might be a breakthrough with quantum computers or similar wild ideas br likely that the growth of quantum computing capability will be a bit or
Quantum Computer Simulators - A Review Version 2.1 - Wallace (1999)(Correct)
This review offers the first available overview of progress in the field of quantum computer simulation. As research interest in quantum computation grows, together with the number of field researcher... / Quantum Computer Simulators -A Review br of progress in the field of quantum computer simulation. As research
Alternative Computational Models: A Comparison of Biomolecular and.. - Reif (1998)(Correct)
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotechnology techniques, e... / Comparison of Biomolecular and Quantum Computation John H. Reif br DNA operations. In contrast Quantum Computation QC is a type of
Quantum Computation - Aharonov (1998)(Correct)
In the last few years, theoretical study of quantum systems serving as computational
devices has achieved tremendous progress. We now have strong theoretical evidence
that quantum computers, if buil... / Dec Quantum Computation Dorit Aharonov br theoretical evidence that quantum computers if built might be used as
Cellular Automata and Artificial Life - Computation and Life in.. - Morita (1998)(Correct)
In this paper, we investigate and discuss the problem how the abilities of computing and self-reproduction can be realized in a "reversible" environment, especially in reversible cellular automata (RC... / and investigated. For example quantum computing DNA computing br principle and the universal quantum computer Proc. R. Soc. Lond. A
Quantum Computing - Shor (1998)(Correct)
The Church-Turing thesis says that a digital computer is a universal computational device; that is, it is able to simulate any physically realizable computational device. It has generally been belie... / Doc. Math. J. DMV Quantum Computing Peter W. Shor Abstract. br is taken into consideration. A quantum computer is a hypothetical machine
Symmetric Ciphers Based On Two-Dimensional Chaotic Maps - Fridrich (1998)(Correct)
this paper, methods are shown how to adapt invertible two-dimensional chaotic maps on a unknown International Journal of Bifurcation and Chaos, Vol. 8, No. 6 (1998) 1259--1284
World Scientific Publis... / the newly emerged field of quantum computing could theoretically make br crypt-analytic techniques and quantum computing threaten symmetric
Teleportation as a Quantum Computation - Brassard, Braunstein, Cleve (1998)(Correct)
Introduction
Among the many exciting new applications of quantum physics in the realm
of information processing, we are particularly fond of quantum cryptography,
quantum computing and quantum telepor... / Teleportation as a Quantum Computation Gilles Brassard br of primitive operations in quantum computation. Key words Quantum
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998)(Correct)
We present a simple and general simulation technique that transforms
any black-box quantum algorithm (a la Grover's database
search algorithm) to a quantum communication protocol for a related
problem... / Address CWI Quantum Computing and Advanced Systems br computations. . Black-box quantum computations All the upper bounds
Reversible Space Equals Deterministic Space - Lange, McKenzie, Tapp (1998)(Correct)
This paper describes the simulation of an S(n) space-bounded deterministic
Turing machine by a reversible Turing machine operating in space S(n). It
thus answers a question posed by Bennett in 1989 an... / was sparked by the prospect of quantum computers whose observationfree br interesting in the context of quantum computing for then space seems to be
Simulating the Effect of Decoherence and Inaccuracies on a Quantum.. - Obenland, Despain (1998)(Correct)
A Quantum Computer is a new type of computer which can
solve problems such as factoring and database search very efficiently.
The usefulness of a quantum computer is limited by the effect of two
dif... / and Inaccuracies on a Quantum Computer Kevin M. Obenland and br Institute Abstract. A Quantum Computer is a new type of computer
Quantum Information Theory - Barnum, III (1998)(Correct)
This dissertation investigates a theory of the manipulation of quantum states and their protection against noise. This theory shows similarities to classical information theory, and crucial difference... / of research in physics and quantum computation and information theory br Research Meetings on Quantum Computation at the Institute for
Quantum NP is Hard for PH - Fenner, Green, al. (1998)(Correct)
this paper we take a further step in this direction by proving that
testing for non-zero acceptance probability of a quantum machine is classically
an extremely hard problem. In fact, we prove that th... / that determining whether a quantum computation has a nonzero br value at the end of a quantum computation. Introduction This
Determining Acceptance Possibility for a Quantum Computation is Hard.. - Fenner (1998)(Correct)
It is shown that determining whether a quantum computation has a nonzero probability of accepting is at least as hard as the polynomialtime hierarchy. This hardness result also applies to determining ... / Acceptance Possibility for a Quantum Computation is Hard for PH br that determining whether a quantum computation has a nonzero
Quantum Computation of Fluid Dynamics - Yepez (1998)(Correct)
Presented is a quantum lattice gas for Navier-Stokes fluid dynamics
simulation. The quantum lattice-gas transport equation at the microscopic
scale is presented as a generalization of the classical la... / Quantum Computing and Quantum Communications br Berlin Quantum Computation of Fluid Dynamics
Lower Bounds for Quantum Search and Derandomization - Buhrman, de Wolf (1998)(Correct)
We prove lower bounds on the error probability of a quantum algorithm for searching through
an unordered list of N items, as a function of the number T of queries it makes. In particular,
if T 2 O(
p... / We apply this to show that a quantum computer cannot do much better than br of the RP-machine a quantum computer still needs at least ck
Simulating Quantum Mechanics on a Quantum Computer - Boghosian (1998)(Correct)
this paper we will discuss algorithms which are concrete realizations of these general arguments. There are three particular types of quantum theories which we would like to try to simulate on a quant... / Quantum Mechanics on a Quantum Computer Bruce M. Boghosian br quantum mechanical systems on quantum computers. A class of algorithms for
Tight Bounds on Quantum Searching - Boyer, Brassard, Høyer, Tapp (1998)(Correct)
We provide a tight analysis of Grover's algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algori... / of being optimal. Keywords Quantum computation. Searching. Lower bound. br an algorithm for the quantum computer that can solve this problem
Number-Conserving Reversible Cellular Automata and Their.. - Morita, Imai (1998)(Correct)
We introduce a new model of cellular automaton called a one-dimensional numberconserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a ... / investigated. Among others quantum computing DNA computing reversible
Quantum Associative Memory with Exponential Capacity - Ventura, Martinez (1998)(Correct)
This paper covers necessary high-level quantum mechanical ideas and introduces a simple quantum associative memory. Further, it provides discussion, empirical results and directions for future work. 1... / University Provo UT Quantum computation uses microscopic quantum br only n neurons. The field of quantum computation which applies ideas
Quantum Counting - Brassard, Høyer, Tapp (1998)(Correct)
We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic s... / process. Introduction Quantum computing is a field at the junction br correction and fault tolerant quantum computation. Although we are still
Ion Trap Quantum Gates, Decoherence and Error Correction - Knight, Murao, Plenio, Vedral (1998)(Correct)
We analyze the linear ion trap proposal for realizing a quantum computer.
We calculate the limits on Shor's factorization algorithm due to spontaneous
emission of the ions. A further contribution to d... / trap proposal for realizing a quantum computer. We calculate the limits on br of a large number by a quantum computer in polynomial time instead
On Initializing Quantum Registers and Quantum Gates - Kak (1998)(Correct)
The problem of initializing phase in a quantum computing system is considered. The initialization of phases is a problem when the system is initially present in an entangled state and also in the appl... / of initializing phase in a quantum computing system is considered. The br render the recently proposed quantum computing schemes ineffective for all
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum.. - Mosca, Ekert (1998)(Correct)
A quantum computer can efficiently find the order of an element
in a group, factors of composite integers, discrete logarithms, stabilisers
in Abelian groups, and hidden or unknown subgroups of Ab... / and Eigenvalue Estimation on a Quantum Computer Michele Mosca br OX LB U.K. Abstract. A quantum computer can efficiently find the
Quantum Entanglement and Communication Complexity - Buhrman, Cleve, Van Dam (1998)(Correct)
We consider a variation of the communication complexity scenario, where the parties are supplied with an extra resource: particles in an entangled quantum state. We note that "quantum nonlocality" c... / communication complexity quantum computing AMS subject br International Conference on Quantum Computing and Quantum Communications
Two Classical Queries versus One Quantum Query - van Dam (1998)(Correct)
In this note we study the power of so called query-limited computers.
We compare the strength of a classical computer that is allowed
to ask two questions to an np-oracle with the strength of a quan... / Wim van Dam Centre for Quantum Computation University of Oxford br University of Oxford Quantum Computing and Advanced Systems
Generalized Noiseless Quantum Codes Utilizing Quantum Enveloping.. - Micho Durdevich Hanna (1998)(Correct)
A generalization of the results of Rasetti and Zanardi concerning
avoiding errors in quantum computers by using states preserved by evolution
is presented. The concept of the dynamical symmetry is... / concerning avoiding errors in quantum computers by using states preserved br . Introduction Quantum computation is a new and quickly
The Los Alamos Trapped Ion Quantum Computer Experiment - Author Hughes James (1998)(Correct)
The development and theory of an experimenttoinvestigate quantum computation
with trapped calcium ions is described. The ion trap, laser and ion requirements are
determined, and the parameters require... / The Los Alamos Trapped Ion Quantum Computer Experiment Author s br The Los Alamos Trapped Ion Quantum Computer Experiment by R. J.
Efficient Quantum Transforms - Høyer (1997)(Correct)
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transfo... / requires the operation of quantum computers to be unitary and thus br wavelet transforms are given. Quantum computation of Fourier transforms
Asymptotic Redundancies For Universal Quantum Coding - Krattenthaler, Slater (1997)(Correct)
Clarke and Barron have recently shown that the Jeffreys' invariant
prior of Bayesian theory yields the common asymptotic (minimax and maximin)
redundancy of universal data compression in a parametri... / as a method for stabilizing quantum computations including quantum br Stabilisation of Quantum Computations by Symmetrisation Los
Complexity Limitations on Quantum Computation - Fortnow, Rogers (1997)(Correct)
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum ... / Complexity Limitations on Quantum Computation Lance Fortnow br of the complexity of quantum computation. We show several results
Models to Reduce the Complexity of Simulating a Quantum Computer - Obenland, Despain (1997)(Correct)
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum
algorithm which can factor large numbers in polynomial time. The usefulness of a quantum computer
is limi... / the Complexity of Simulating a Quantum Computer November Kevin M. br Abstract Recently Quantum Computation has generated a lot of
Cryptographically Resilient Functions - Zhang, Zheng (1997)(Correct)
This paper studies resilient functions which have applications in fault-tolerant distributed computing, quantum cryptographic key distribution and random sequence generation for stream ciphers. We pre... / in fault-tolerant distributed computing quantum cryptographic key
Unconditional Security Against Memory-Bounded Adversaries - Cachin, Maurer (1997)(Correct)
We propose a private-key cryptosystem and a protocol for key agreement by public discussion
that are unconditionally secure based on the sole assumption that an adversary's memory
capacity is limited.... / problems. Recent advances in quantum computing show that precisely these br could be solved efficiently if quantum computers could be built An
Reliable Quantum Computers - Preskill (1997)(Correct)
The new field of quantum error correction has developed spectacularly since its origin less
than two years ago. Encoded quantum information can be protected from errors that arise due
to uncontrolle... / quant-ph Reliable Quantum Computers John Preskill br Hence an arbitrarily long quantum computation can be performed
Towards Computers of Generation Omega - Non-Equilibrium.. - Koshelev, Kreinovich (1997)(Correct)
Nowadays, we are using mainly computer of fourth generation,
and we are designing fifth-generation computers. It
is reasonable to ask: what is the perspective? What will
the computers of generation om... / thermodynamics quantum computing acausal processes . br theoretical research into quantum computing with its exciting potential
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem - Brassard, Høyer (1997)(Correct)
We investigate the power of quantum computers when
they are required to return an answer that is guaranteed to
be correct after a time that is upper-bounded by a polynomial
in the worst case. We show ... / We investigate the power of quantum computers when they are required to br challenged by the theory of quantum computing. In particular Simon
Quantum complexity theory - Bernstein, Vazirani (1997)(Correct)
F4.039e+05> In this paper we study quantum computation from a complexity theoretic viewpoint.
Our first result is the existence of an e#cient universal quantum Turing machine in Deutsch's model
of a... / In this paper we study quantum computation from a complexity br theory. Key words. quantum computation quantum Turing machines
Reversibility in Optimally Scalable Computer Architectures - Frank, Knight, Margolus (1997)(Correct)
An important goal for computer science is to find practical, scalable models of computation that are as efficient as is permitted by the laws of physics. Physics implies fundamental constraints on t... / The recent studies of quantum computing e.g. brief review br to become available. As for quantum computers if large-scale coherence
Quantum analog of the MacWilliams identities in classical coding.. - Shor (1997)(Correct)
We derive a relationship between two different notions of fidelity (entanglement
fidelity and average fidelity) for a completely depolarizing quantum channel.
This relationship gives rise to a quantum... / correcting codes for quantum computers has revolutionized the br quantum information. Although quantum computing holds great promise it is
Quantum-Dot Devices And Quantum-Dot Cellular Automata - Porod (1997)(Correct)
this paper, we will describe some ideas of the Notre Dame NanoDevices Group on a possible future nanoelectronic computing technology based on cells of coupled quantum dots. unknown International Journ... / that our proposal is not a quantum computer in the sense of the quantum br computer in the sense of the quantum computing community as reviewed by
Why do quantum algorithms work? - The Deutsch-Josza problem - Koskela, Mettinen (1997)(Correct)
this paper) Then one can compute in one
sweep all possible values of wanted function f in quantum superposition. Finally
the value of the function is measured. Problem is that this way only one pair x... / Helsinki . . Quantum Computing University of Helsinki br have become the standard quantum computing model. Quantum computing
DTIC Information for AFOSR Task 2304CP Lattice-Gas Theory and.. - Yepez (1997)(Correct)
05>ifested sound waves, surprising fluid-like behavior given the model's simplicity and severe
spacetime discretization. The transport properties of discrete classical gases were explored
further in t... / parallel fine-grained quantum computing lattice-gas machines as a br been applied to fine-grain quantum computing Progress
Conjugated Operators in Quantum Algorithms - Høyer (1997)(Correct)
This paper addresses the question of understanding quantum algorithms
in terms of unitary operators. Many quantum algorithms can be expressed
as applications of operators formed by conjugating so-call... / generalizations of it. Quantum computation Here is an outline of br with the basic notions of quantum computing For any finite set X
The Revolution Yet to Happen - Bell (1997)(Correct)
By 2047, almost all information will be in cyberspace (1984) -- including all knowledge and creative works. All information about physical objects including humans, buildings, processes, and organizat... / years. It isn't based on quantum computing DNA breakthroughs or
Lattice Gas Superfluid - Jeffrey Yepez (1997)(Correct)
this paper is: (1) quantum superposition between qubit states
at remote sites is not necessary because of the locality of the quantum lattice gas
algorithm ; and (2) long coherence times between local... / Revised revised date A quantum computer with controlled br the point. Keywords quantum computing helium II superfluidity
Superdense Coding - Mettala (1997)(Correct)
Introduction
According to classical information theory you can send at most log 2 (N) bits of
information with an object that can be put into N distinguishable states. Two
bits of information can be ... / November - Quantum Computing Seminar at the Department br Andre Berthiaume Quantum Computation Adrioano Barenco and
Using the Quantum Computer to Break Elliptic Curve Cryptosystems - Eicher, Opoku (1997)(Correct)
This article gives an introduction to Elliptic Curve Cryptography and Quantum Computing. It
includes an analysis of Peter Shor's algorithm for the quantum computer breakdown of Discrete Log
Cryptosyst... / Using the Quantum Computer to Break Elliptic Curve br Curve Cryptography and Quantum Computing. It includes an analysis of
Teleportation - Seminar on Quantum Computation - Makela, Paunisalo (1997)(Correct)
Introduction Teleportation is the name given by science øction writers to the feat of making an object or person disintegrate in one place while a perfect replica appears somewhere else [1]. In TV-ser... / Teleportation Seminar on Quantum Computation Mikko M kel Petri br or even spaceships. In Quantum Computation teleportation device is
Bulk Spin-Resonance Quantum Computation - Gershenfeld, Chuang (1997)(Correct)
This article presents a new approach to quantum computing based on using bulk samples rather than isolated degrees of freedom. The problem, of course, is that such samples microscopically are in a the... / Bulk Spin-Resonance Quantum Computation Neil A. Gershenfeld br and Isaac L. Chuang Quantum computation remains an enormously
Lattice-Gas Dynamics, Volume I Viscous Fluids - Yepez (1996)(Correct)
Lattice-Gas Dynamics
Volume I
Viscous Fluids
The theory and computation of lattice gas dynamics for viscous fluid hydrodynamics
is presented. Theoretical analysis of these exactly conserved, discrete
... / may exist the possibility of a quantum computer Quantum lattice gases br some lattice based models for quantum computation. For example it is shown
Quantum Computing and Phase Transitions in Combinatorial Search - Hogg (1996)(Correct)
We introduce an algorithm for combinatorial search on quantum computers that is capable
of significantly concentrating amplitude into solutions for some NP search problems,
on average. This is done by... / published Quantum Computing and Phase Transitions in br for combinatorial search on quantum computers that is capable of
Quantum Computation Primitives - Frank (1996)(Correct)
This paper surveys the state of the field of quantum computation, with an emphasis on the recent
effort to devise simple quantum computational primitives upon which more complex quantum calculations
c... / Area Exam Paper Quantum Computation Primitives Michael P. br the state of the field of quantum computation with an emphasis on the
A decision procedure for well-formed linear quantum cellular automata - Durr, LêThanh, Santha (1996)(Correct)
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to defi... / this paper we introduce a new quantum computation model the linear quantum br an essential property for any quantum computing device since it enables us
Quantum Computing: A new Paradigm and it's Type Theory - Wehr (1996)(Correct)
To use quantum mechanical behavior for computing has been proposed by Feynman. Shor gave an algorithm for the quantum computer which raised a big stream of research. This was because Shor's algorithm ... / Quantum Computing A new Paradigm and it's br Shor gave an algorithm for the quantum computer which raised a big stream of