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.
122 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
119 A fast quantum mechanical algorithm for database search - Grover (1996)(Correct)
ed Problem Let a system
have N = 2
n
states which are labelled S 1 ,S 2 ,...S N . These
2
n
states are represented as n bit strings. Let there be a
unique state, say S n , that satisfies the cond... / - . This paper applies quantum computing to a mundane problem in br states. A basic operation in quantum computing is that of a fair coin
78 Elementary gates for quantum computation - Barenco, Bennett, Cleve, Di.. (1995)(Correct)
We show that a set of gates that consists of all one-bit quantum gates (U(2))
and the two-bit exclusive-or gate (that maps Boolean values (x; y) to (x; x \Phi y))
is universal in the sense that all u... / Elementary gates for quantum computation Adriano Barenco br many proposed constructions of quantum computational networks. We derive
56 Strengths and weaknesses of quantum computing - Bennett, Bernstein, Brassard.. (1996)(Correct)
Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic compu... / Strengths and weaknesses of quantum computing Charles H. Bennett IBM br of attention has focused on quantum computation following a sequence of
44 Tight Bounds on Quantum Searching - Boyer, Brassard, Høyer, Tapp (1998)(Correct)
this paper we assume for simplicity that each evaluation of F takes unit time. Grover [1] has discovered an algorithm for the quantum computer that can solve this problem in expected time in O( unknow... / of being optimal. Key words Quantum computation. Searching. Lower bound. br an algorithm for the quantum computer that can solve this problem
40 Quantum theory, the Church-Turing principle and the universal quantum .. - Deutsch (1985)(Correct)
It is argued that underlying the Church-Turing hypothesis there is an implicit
physical assertion. Here, this assertion is presented explicitly as a physical principle:
`every finitely realizable ph... / Principle And The Universal Quantum Computer David Deutsch br theory and the universal quantum computer' are compatible with the
37 Quantum Computation - Berthiaume (1997)(Correct)
Historically, Turing machines have been the paradigm by which we defined computability and efficiency. This is based on Church's thesis that everything effectively computable can also be computed on a... / page Printer Opaque this Quantum Computation Because nature isn't br Deu when he introduced his quantum computer and later on quantum gate
34 Two-bit gates are universal for quantum computation - Di Vincenzo (1995)(Correct)
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The b... / Two-bit gates are universal for quantum computation David P. DiVincenzo br or nuclear spins. A gearbox quantum computer proposed here based on
32 The Quantum Challenge to Structural Complexity Theory - Berthiaume, Brassard (1992)(Correct)
This is a non-technical survey paper of recent quantum-mechanical discoveries that challenge generally accepted complexity-theoretic versions of the Church--Turing thesis. In particular, building on p... / apparatus. Deutsch's Quantum Computer In a bold paper published br put forth in the quantum computer see also Even
27 Oracle Quantum Computing - Berthiaume, Brassard (1994)(Correct)
Building on work of Deutsch and Jozsa, we construct oracles relative to which
(1) there is a decision problem that can be solved with certainty in worst-case polynomial
time on the quantum computer, y... / Oracle Quantum Computing Andr'e Berthiaume y br polynomial time on the quantum computer yet it cannot be solved
25 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
25 Quantum Lower Bounds by Polynomials - Beals, Buhrman, Cleve, Mosca, de Wolf(Correct)
Devices]: Models of
Computation; F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity
General Terms: Theory, Algorithms, Performance
Additional Key Words and Phrases: Quantum co... / was aliated with the Centre for Quantum Computation Oxford UK when this br Key Words and Phrases Quantum computing query complexity black-box
22 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
20 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
18 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
16 GENETIC PROGRAMMING - Building Artificial Nervous Systems with.. - de Garis (1990)(Correct)
Contents 1. Introduction 2. Neural Networks 3. The Genetic Algorithm 4. GenNets 5. Genetic Programming (GP) 6. Example 1 : "Pointer" 7. Example 2 : "Walker" 8. Example 3 : "LIZZY" 9. Discussion & Futu... / Nanotechnology and Quantum Computing. WSI is already with us. It br copies of themselves. Quantum computing promises to use subatomic
14 Nuclear magnetic resonance spectroscopy: an experimentally accessible .. - Cory (1996)(Correct)
this paper will describe how basic quantum logic gates can be implemented via NMR spectroscopy, and present experimental results to validate our claims. After submitting the revised version of this ab... / accessible paradigm for quantum computing David G. Cory y br Introduction The theory of quantum computing is advancing at a rate
14 Semiclassical Fourier Transform for Quantum Computation - Griffiths (1996)(Correct)
Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out ... / Fourier Transform for Quantum Computation Robert B. Griffiths br and discrete logarithms on a quantum computer employ Fourier transforms
12 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
10 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
10 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 -
9 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
9 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
8 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
8 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
7 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
7 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
7 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
6 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
6 Approximate Quantum Fourier Transform and Decoherence - Barenco, Ekert, Suominen, Törmä (1996)(Correct)
We discuss the advantages of using the approximate quantum Fourier transform
(AQFT) in algorithms which involve periodicity estimations. We analyse
quantum networks performing AQFT in the presence of ... / operations performed by a quantum computer on quantum registers. br became standard in the lore of quantum computation. More detailed
6 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.
6 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
5 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
5 Chu Spaces: Automata with quantum aspects - Pratt (1994)(Correct)
Chu spaces are a recently developed model of concurrent
computation extending automata theory to express
branching time and true concurrency. They
exhibit in a primitive form the quantum mechanical
ph... / devices and of algorithms to quantum computing by indicating how to br below on applications to quantum computing. For physics Chu spaces
4 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
4 Concatenated Quantum Codes - Knill, Laflamme (1996)(Correct)
One of the main problems for the future of practical quantum computing
is to stabilize the computation against unwanted interactions
with the environment and imperfections in the applied operations. E... / for the future of practical quantum computing is to stabilize the br Introduction Practical quantum computing and communication QCC
4 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
4 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
4 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
3 On Nonlinear Resilient Functions - Zhang, Zheng (1996)(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... / fault-tolerant distributed computing quantum cryptographic key
3 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
3 Progress towards quantum computation - Bennett (1995)(Correct)
Bel- Yorktown Heights, New York, NY 10598, USA; bennetc/divince@watson.ibm.com. l's inequalities, quantum cellular automata, and the "many-worlds" interpretation, have moved on to include some concret... / Progress towards quantum computation Charles H. Bennett and br vast and distinctive powers a quantum computer would have if one could ever
3 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
3 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
3 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
2 Conventions for Quantum Pseudocode - Knill (1996)(Correct)
A few conventions for thinking about and writing quantum pseudocode
are proposed. The conventions can be used for presenting any
quantum algorithm down to the lowest level and are consistent with
a qu... / machine QRAM model for quantum computing. In principle a formal br clear that practical quantum computing will take place on a
2 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
2 Quantum-inspired Neural Networks - Menneer, Narayanan (1995)(Correct)
Quantum computing (physically-based computation founded on
quantum-theoretic concepts) is gaining prominence because of recent
claims for its massively increased computational efficiency, its
potentia... / December .Abstract Quantum computing physically-based br Introduction Interest in quantum computing QC physically based
2 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
2 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
2 Extended Quantum XOR Gate in Terms of Two-Spin Interactions - Mozyrsky, Privman, Hotaling (1996)(Correct)
Considerations of feasibility of quantum computing lead to the study
of multispin quantum gates in which the input and output two-state
systems (spins) are not identical. We provide a general discussi... / of feasibility of quantum computing lead to the study of br In order to answer whether quantum computation is feasible and useful
2 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
2 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
2 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
2 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.
2 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
2 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
2 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... /
1 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
1 Emerging Opportunities for Theoretical Computer Science - Alfred Aho (1996)(Correct)
The principles underlying this report can be summarized as follows:
1. A strong theoretical foundation is vital to computer science.
2. Theory can be enriched by practice.
3. Practice can be enriched ... / logics of knowledge and quantum computing. Theoretical computer
1 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
1 On the Speed of Quantum Computation - Gramss (1994)(Correct)
Feynman and Margolus have shown that a closed, locally interacting quantum
system is capable of performing deterministic computation. Feynman's
system computes in a serial way. Margolus was able to ex... / On the Speed of Quantum Computation Tino Gramss Caltech br a new kind of speed limit for quantum computation is established. An upper
1 Quantum-inspired genetic algorithms - Narayanan, Moore (1995)(Correct)
A novel evolutionary computing method --- quantum inspired genetic algorithms --- is introduced, where concepts and principles of quantum mechanics are used to inform and inspire more efficient evolut... / is used by Shor in his quantum computing method for extracting prime br RSA- in a few seconds if a quantum computer could be built that ran as
1 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
1 Brain Building - The Genetic Programming of Artificial Nervous.. - de Garis (1991)(Correct)
This article introduces the concept of Genetic Programming (GP), which is the application of the Genetic Algorithm to the creation of functional systems which are too complex in their dynamics to be... / Nanotechnology and Quantum Computing. WSI is already with us. It br copies of themselves. Quantum computing promises to use subatomic
1 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
1 Wavelets and Wavelet Packets on Quantum Computers - Klappenecker(Correct)
We show how periodized wavelet packet transforms and periodized wavelet transforms can be implemented
on a quantum computer. Surprisingly, we find that the implementation of wavelet packet
transforms ... / and Wavelet Packets on Quantum Computers Andreas Klappenecker br can be implemented on a quantum computer. Surprisingly we find that
1 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.
1 Reversible Arithmetic Coding for Quantum Data Compression - Chuang, Modha(Correct)
We study the problem of compressing a block of symbols (a block quantum state) emitted by a memoryless quantum Bernoulli source. We present a simple-to-implement quantum algorithm for projecting, with... / elegant example of reversible quantum computation. Keywords quantum br computation. Keywords quantum computation quantum information
1 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
1 The quantum-jump approach to dissipative dynamics in quantum optics - Plenio, Knight(Correct)
This article reviews the various quantum-jump approaches developed over the past few years. We focus on the theoretical description of basic dynamics and on simple instructive examples rather than the... / G. Spontaneous emission in quantum computing VI. Conclusions br G. Spontaneous emission in quantum computing As a last application of
1 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
1 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
1 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
1 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
1 Asymptotic Redundancies for Universal Quantum Coding - Krattenthaler, Slater(Correct)
Clarke and Barron have recently shown that
the Je reys' invariant prior of Bayesian theory yields the
common asymptotic (minimax and maximin) redundancy
of universal data compression in a parametric s... / fact that the basic unit of quantum computing the quantum bit or br carry the basic units of quantum computing the quantum bits. If we
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... /
1 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
1 Simulating Quantum Chaos with Quantum Computers - Ken Umeno (1996)(Correct)
We study the effect of quantum non-integrability in quantum computation.
A quantum Hamiltonian H =
1
2 (p
2
x + p
2
y + x
2
y
2
) whose classical
counterpart is known to be non-integrable is ... / Simulating Quantum Chaos with Quantum Computers Ken Umeno br of quantum non-integrability in quantum computation. A quantum Hamiltonian
1 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 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
Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985)(Correct)
Quantum Computation (QC) is a type of computation where unitary and measurement
operations are executed on linear superpositions of basis states. This paper provides
a brief introduction to QC, partic... / University z Abstract Quantum Computation QC is a type of br bijective as required for quantum computations. Given a bijective
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
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
Programme and Abstracts - Breuer(Correct)
s Edited by: Heinz--Peter Breuer and Francesco Petruccione Preface In recent years much interest has been paid to the study of the dynamics of open quantum systems. Both new experimental techniques as... / mechanics as e.g.in quantum computing quantum cryptography br space ffl quantum optics quantum computing quantum cryptography
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
Quantum Computing Hamiltonian cycles. - Rudolph(Correct)
An algorithm for quantum computing Hamiltonian cycles of simple,
cubic, bipartite graphs is discussed. It is shown that it is possible to
evolve a quantum computer into an entanglement of states which... / Quantum Computing Hamiltonian cycles. br Abstract An algorithm for quantum computing Hamiltonian cycles of
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
Scale Decoherence In Inhomogeneous Potentials - Meyer(Correct)
Finite precision measurement factors the Hilbert space of a quantum system into a tensor product H coarse\Omega H fine . This is mathematically equivalent to the partition into system and environment ... / this work is the prospect of quantum computing Not only does the br physical realization of Boolean quantum computers Even these relatively
Assumptions for Fault Tolerant Quantum Computing - Knill, Laflamme (1996)(Correct)
Assumptions useful for fault tolerant quantum computing are stated
and briefly discussed. We focus on assumptions related to properties
of the computational system. The strongest form of the assumptio... / for Fault Tolerant Quantum Computing LANL report LAUR- - br useful for fault tolerant quantum computing are stated and briefly
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
"Quantum Entanglement" Does Not Happen! - Thompson(Correct)
As from about 1970, certain experiments have been interpreted by orthodox
quantum theorists as showing that the predicted "non-local action" really
does happen. I have studied the evidence and found t... / Look at all the work in quantum computing and encryption they say br suffer there is no future in Quantum Computing as Quantum
On The Power of Exact Quantum Polynomial Time - Brassard, Høyer (1996)(Correct)
We investigate the power of quantum computers when they are required to return an answer that is guaranteed correct after a time that is upper-bounded by a polynomial in the worst case. In an oracle s... / We investigate the power of quantum computers when they are required to br challenged by the theory of quantum computing. In particular it was shown
Reversible Space Equals Deterministic Space (Extended Abstract) - Lange, McKenzie, Tapp(Correct)
This paper describes the simulation of an S(n) spacebounded
deterministic Turing machine by a reversible Turing
machine operating in space S(n). It thus answers a
question posed by Bennett in 1989 and... / was sparked by the prospect of quantum computers whose observation-free br interesting in the context of quantum computing for then space seems to
Quantum-Inspired Computing - Moore, Narayanan(Correct)
The paper identifies and demonstrates the feasibility of a novel computational paradigm
which is inspired by the principles of quantum mechanics and quantum computing. A brief
history of quantum compu... / of quantum mechanics and quantum computing. A brief history of quantum br computing. A brief history of quantum computing and basic exposition of
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
A hard problem: Disclosing how to break public key cryptosystems - Jøsang(Correct)
New results in cryptanalysis are constantly being presented
in the academic community, and this process poses no problems. Paradoxically,
the discovery of a method that would allow breaking for exam... / RSA obsolete and that only quantum computing has such a potential. This br may sound reassuring because quantum computing still is more a theoretical
Feasibility of a Quantum Computer Architecture - Obenland (1996)(Correct)
ent.
J.A. Wheeler and W.Z. Zurek eds. Princeton University Press.1983.
[Zure84] W.H. Zurek. "Reversibility and Stability of Information Processing Systems"
Phys. Rev. Lett. 53, 391. 1984.
Feasibil... / Feasibility of a Quantum Computer Architecture September br Time of Large Numbers on a Quantum Computer Phys. Rev. A. November
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
Asymptotics in Quantum Statistics - Gill(Correct)
This paper gives an introduction to this field in the most simple of settings, that of estimating
the state of a spin-half particle given n independent copies of the particle. We show
how in some case... / are random. The fields of quantum computing quantum communication and br random. The fields of quantum computing quantum communication and quantum
Quantum Computing - References - Knill(Correct)
nce and quantum error correction. Proceedings of the Royal Society of London A,
452:2551--2577, 1996.
[36] Q. A. Turchette, C. J. Hood, W. Lange, H. Mabuchi, and H. J. Kimble. Measurement of conditio... / J. Preskill. Reliable quantum computers. Proceedings of the Royal br I. D. Vagner and G. Kventsel. Quantum computation in quantum-hall systems.
Quantum Cryptographic Network based on Quantum Memories - Eli Biham(Correct)
Quantum correlations between two particles show non-classical properties
which can be used for providing secure transmission of information. We
present a quantum cryptographic system, in which users s... / assumptions may not hold for a quantum computer for example a quantum br computer for example a quantum computer should enable fast
Logical Universality and Self-Reproduction in Reversible Cellular.. - Morita, Imai (1996)(Correct)
A reversible cellular automaton (RCA) is a "backward deterministic
" CA in which every configuration of the cellular space has at
most one predecessor. Such reversible systems have a close connectio... / as a special type of a quantum computing system. One interesting br principle and the universal quantum computer Proc.R.Soc.Lond.A
From Nanotechnology to Nano-Planning - Czarn, MacNish(Correct)
This paper describes the novel area of nano-planning---the study of automated
planning in a eutactic environment. We begin by describing the
evolution of present technology towards nanotechnology and ... / will be subjected. . Quantum computing or quantum dots. An br problem lies in the field of quantum computing which uses the quantum
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
Quantum Cellular Automata - van Dam (1996)(Correct)
This thesis discusses the definition and power of quantum cellular automata. The main theorem states that there is a universal quantum cellular automata, which can efficiently simulate in parallel any... / first hand' introduction in quantum computing his knowledge of this field br go to the Torino workshop on Quantum Computing'During this workshop I
Quantum Turing Machines - Paajanen(Correct)
i is the transition function.
In a quantum Turing machine, the amplitude the transition function gives is a
complex number instead of a real number between 0 and 1 as in the probabilistic
2
Turing m... / Paajanen Seminar on Quantum Computing University of Helsinki br plausible that also in the quantum computing a similar model -a quantum
Security Implications of Quantum Technologies - Alves-Foss(Correct)
Quantum computing, first introduced in the early 70's, has taken on new life with the
development of efficient algorithms, experimental quantum communication systems and basic
quantum gates. This pape... / Abstract Quantum computing first introduced in the br quantum communication and quantum computing to the field of computer
Fast Signal Transforms for Quantum Computers - Rötteler, Püschel, Beth(Correct)
We present the discrete Fourier transform as a basic primitive in the treatment of controlled quantum systems. Based on the complexity model for quantum circuits the Fourier transform of size 2 n su... / Fast Signal Transforms for Quantum Computers Martin Rotteler br problems on which a putative quantum computer could outperform every
Quantum Computing And Shor's Factoring Algorithm - Manin(Correct)
Introduction Information processing (computing) is dynamical evolution of a highly organized physical system produced by technology (computer) or nature (brain). Initial state of this system is (deter... / Quantum Computing And Shor's Factoring br at least to . Theoretical quantum computing entered its modern stage in
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
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
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
Simulating Quantum Non-Integrable Systems With Quantum Computers - Ken Umeno(Correct)
this paper, I will give a somewhat negative answer
to this question in the case of quantum non-integrable unknown PhysComp96:
Extended abstract
Draft, 12 May 1996
umeno:
chaosken@giraffe.riken.go.jp... / non-integrable systems with quantum computers Ken Umeno The br Hamiltonian systems by quantum computers is presented here. This
Synthesis of Entangled States and Quantum Computing - Cirac, Gardiner, Pellizzari..(Correct)
Introduction One of the most intriguing features of Quantum Mechanics is the existence of entangled states. These are superposition states of composite systems, i.e. states which cannot be expressed a... / of Entangled States and Quantum Computing J.I. Cirac y S. br particles is the basis of quantum computing. Quantum
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 Learning - Chrisley (1995)(Correct)
The notion of quantum learning machines -- quantum computers that modify themselves
in order to improve their performance in some way -- is introduced. This is followed by a
discussion of the advantag... / of quantum learning machines -quantum computers that modify themselves in br of the advantages that quantum computers in general and a quantum
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
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.
William M. Spears and Diana F. Gordon - Navy Center(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.
Simulation of Quantum Computation on Intel-Based Architectures - Pritzker(Correct)
this paper is to introduce the concepts of quantum computing, a firm
understanding of the basic concepts of quantum theory is necessary in order to comprehend the
nature of quantum computers. A kind o... / Simulation of Quantum Computation on Intel-Based br . Quantum Computers . Inside the
Hamiltonian Theory of Symmetric Optical Network Transforms - Törmä, Stenholm, Jex (1995)(Correct)
We discuss the theory of extracting an interaction Hamiltonian
from a preassigned unitary transformation of quantum states. Such a
procedure is of significance in quantum computations and other optica... / procedure is of significance in quantum computations and other optical br information acquisition and quantum computations. This task is the
Information, Physics and Computation - Kak (1995)(Correct)
This paper presents several observations on the connections between information, physics and computation. In particular, the computing power of quantum computers is examined. Quantum theory is charact... / the computing power of quantum computers is examined. Quantum theory br argued that recently studied quantum computers which are based on local
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 Computing and Decoherence in Quantum Optical Systems - Cirac, Pellizzari, Poyatos, Zoller(Correct)
We present recent theoretical results in the context of quantum computing and error correction. In particular, a short review of the ion trap quantum computer is given. Moreover, we present a novel sc... / Quantum Computing and Decoherence in Quantum br results in the context of quantum computing and error correction. In
Parallel, Pipelined CORDICs for Reconfigurable Computing - Mencer, Morf(Correct)
Reconfigurable computing has shown impressive successes
with data intensive and latency tolerant applications. Pipelined
and parallel implementations of CORDICs can achieve
very high throughput for ro... / and unitary logic in quantum computing. Regular Arrays of CORDIC
Noncommutative analysis and quantum physics - I. States and ensembles - Neumaier(Correct)
In this sequence of papers, noncommutative analysis is used to give a consistent axiomatic approach to a uni ed conceptual foundation of classical and quantum physics. The present Part I de nes the ... / preparation of states quantum computing quantum logic quantum br on clarifying the options in quantum computing it might be a challenge
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 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 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
Quantum Topology and Quantum Computing - Kauffman(Correct)
This paper is a quick introduction to key relationships between the theories of knots,links, three-manifold invariants and the structure of quantum mechanics. In section 2 we review the basic ideas an... / Quantum Topology and Quantum Computing by Louis H. Kauffman br of quantum topology to quantum computing. This paper is intended as
Artificial Embryology - The Genetic Programming of an Artificial.. - de Garis (1992)(Correct)
This chapter introduces the concept of Genetic Programming (GP) and its
application to the "growth" of an artificial embryo. Genetic Programming (GP) is
the application of the Genetic Algorithm [5,6... / Nanotechnology and Quantum Computing. The feature which all these br number of components. Quantum Computing could even produce ten to
Information is Protophysical - Matzke (1996)(Correct)
Thought experiments led Einstein to discovering
that gravity and acceleration were identical,
which lead to his famous theory of relativity.
Thought experiments can also be used in critical
thinkin... / scientists are looking at quantum computing as a solution to providing br spacetime metrics obtained by quantum computing leverage. Most of the
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
CryptoBytes - Cryptographic Laboratories Research(Correct)
this article originallyappeared inDr. Dobb's Journal, unknown CryptoBytes
V O L U M E 1 , N U M B E R 1 --- S P R N G 1 9 9 5
CRYPTOGRAPHIC LABORATORIES
RESEARCH AND
CONSULTATION
R S A L A B O R A T... / against RSA. Right Wrong Quantum computing an emerging branch of br Peter Shor has discovered that quantum computers can factor an n-figure
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 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
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
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
Fast Quantum Fourier Transforms for a Class of non-abelian Groups - Püschel, Rötteler, Beth(Correct)
An algorithm is presented allowing the construction of fast
Fourier transforms for any solvable group on a classical computer. The
special structure of the recursion formula being the core of this a... / for solvable groups on a quantum computer. The inherent structure of br problems on which a putative quantum computer could outperform every
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 .
Bibliography - Athas Low-Power Vlsi(Correct)
at http://www.-
isi.edu/acmos/abstracts/99-04.VOLTA.html.
[2] W. Athas, N. Tzartzanis, L. Svensson, L. Peterson, H. Li, X. Jiang, P. Wang,
and W-C. Liu. AC-1: A clock-powered microprocessor. In Proc.... / Strengths and weaknesses of quantum computing. Preprint at br and Gilles Brassard. Oracle quantum computing. In Proceedings of the
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
DNA Splicing Systems based on Post Systems - Ferretti, Kobayashi, Yokomori(Correct)
DNA splicing systems (or simply splicing systems) are a new type of generative mechanisms for modeling DNA recombination behaviors, initiated by Tom Head's seminal paper ([8]). For this reason, spli... / interesting technologies are quantum computing and molecular DNA
Basic elements of quantum information technology - Spiller(Correct)
The marriage of quantum physics and information technology has the potential
to generate radically new information processing devices. Examples are
quantum cryptosystems, which provide guaranteed se... / secure communication and quantum computers which manipulate data br Chapter of Introduction to Quantum Computation and Information eds.
Active Agents, Intelligence and Quantum Computing - Kak(Correct)
This paper reviews evidence from neuroscience and quantum computing theory in support of the notion of autonomy in the workings of cognitive processes. Deficits in speech, vision, and motor abilities ... / Agents Intelligence and Quantum Computing Subhash Kak Department br evidence from neuroscience and quantum computing theory in support of the
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
Josephson Junction based Quantum Computing - Makhlin, Schön, Shnirman(Correct)
Among the physical realizations of the elements required for quantum computation
nano-scale electronic devices [15,2,12,10] are very promising. They can be easily
integrated into electronic circuits... / Josephson Junction based Quantum Computing Yuriy Makhlin br of the elements required for quantum computation nano-scale electronic
Noise, physics, and non-Turing computation - Bains, Johnson(Correct)
It has been proven that recurrent neural networks with
analog weights can solve problems that are insoluble
using Turing machines. However, the prevailing view
of those involved in computing research ... / a partial solution based on quantum computing but this construct-the br this construct-the universal quantum computer-is still not comprehensive
The evolution of arbitrary computational processes - Spector(Correct)
entially be evolved by GP. In the most frequently cited examples
this range is actually quite narrow. For example, in standard "symbolic regression"
problems, in which the goal is to evolve a program ... / processes. In particular quantum computers can perform certain br evolving programs to perform quantum computations. Problem
Research Report and Proposal - Mahajan (1996)(Correct)
This paper appears in FOCS 95 [19]. In fact our FOCS paper derandomizes all currently known Semidefinite Based Approximation Algorithms. There is perhaps a general theorem that captures a wide variety... / nature of EMS properties. Quantum Computing Over the past several br computer. A precise model of a quantum computer was first formulated by
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
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.
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
Supercomputer Suggests Supermind - Matzke(Correct)
This paper will discuss how specific
quantum properties are useful for making
computation systems more efficient. The similarity of
these properties to our mind and emotional
mechanisms add up to the ... / Recent discoveries in quantum computing and quantum cryptography br the similarities between quantum computing and consciousness such as
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
On Sets, Types, Fixed Points, and Checkerboards - Andrews, Bishop(Correct)
Most current research on automated theorem proving is concerned with proving
theorems of first-order logic. We discuss two examples which illustrate the
advantages of using higher-order logic in certa... / such as DNA computing quantum computing and optical circuitry are br technologies such as DNA computing quantum computing and optical