corpus_id stringlengths 7 12 | paper_id stringlengths 9 16 | title stringlengths 1 261 | abstract stringlengths 70 4.02k | source stringclasses 1
value | bibtex stringlengths 208 20.9k | citation_key stringlengths 6 100 |
|---|---|---|---|---|---|---|
arxiv-677401 | quant-ph/0703107 | Quantum Key Distribution with Classical Bob | <|reference_start|>Quantum Key Distribution with Classical Bob: Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a s... | arxiv | @article{boyer2007quantum,
title={Quantum Key Distribution with Classical Bob},
author={Michel Boyer, Dan Kenigsberg and Tal Mor},
journal={arXiv preprint arXiv:quant-ph/0703107},
year={2007},
doi={10.1103/PhysRevLett.99.140501},
archivePrefix={arXiv},
eprint={quant-ph/0703107},
primaryC... | boyer2007quantum |
arxiv-677402 | quant-ph/0703112 | Graphs, Quadratic Forms, and Quantum Codes | <|reference_start|>Graphs, Quadratic Forms, and Quantum Codes: 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 technique used in the proof establishes a new connection between... | arxiv | @article{grassl2007graphs,,
title={Graphs, Quadratic Forms, and Quantum Codes},
author={Markus Grassl, Andreas Klappenecker, Martin Roetteler},
journal={Proceedings 2002 IEEE International Symposium on Information
Theory (ISIT 2002), Lausanne, Switzerland, June/July 2002, p. 45},
year={2007},
doi=... | grassl2007graphs, |
arxiv-677403 | quant-ph/0703113 | Quantum Convolutional BCH Codes | <|reference_start|>Quantum Convolutional BCH Codes: Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to construct classical convolut... | arxiv | @article{aly2007quantum,
title={Quantum Convolutional BCH Codes},
author={Salah A. Aly, Markus Grassl, Andreas Klappenecker, Martin Roetteler,
Pradeep Kiran Sarvepalli},
journal={Proceedings 2007 Canadian Workshop on Information Theory (CWIT
2007), Edmonton, Canada, June 2007, pp. 180-183},
year={20... | aly2007quantum |
arxiv-677404 | quant-ph/0703141 | Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries | <|reference_start|>Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries: Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such bl... | arxiv | @article{barnum2007semidefinite,
title={Semidefinite programming characterization and spectral adversary method
for quantum complexity with noncommuting unitary queries},
author={Howard N. Barnum},
journal={arXiv preprint arXiv:quant-ph/0703141},
year={2007},
archivePrefix={arXiv},
eprint={qua... | barnum2007semidefinite |
arxiv-677405 | quant-ph/0703181 | Quantum Block and Convolutional Codes from Self-orthogonal Product Codes | <|reference_start|>Quantum Block and Convolutional Codes from Self-orthogonal Product Codes: We present a construction of self-orthogonal codes using product codes. From the resulting codes, one can construct both block quantum error-correcting codes and quantum convolutional codes. We show that from the examples of co... | arxiv | @article{grassl2007quantum,
title={Quantum Block and Convolutional Codes from Self-orthogonal Product Codes},
author={Markus Grassl, Martin Roetteler},
journal={Proceedings 2005 IEEE International Symposium on Information
Theory (ISIT 2005), Adelaide, Australia, September 2005, pp. 1018-1022},
year={2... | grassl2007quantum |
arxiv-677406 | quant-ph/0703182 | Constructions of Quantum Convolutional Codes | <|reference_start|>Constructions of Quantum Convolutional Codes: We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum convolutional code by app... | arxiv | @article{grassl2007constructions,
title={Constructions of Quantum Convolutional Codes},
author={Markus Grassl, Martin Roetteler},
journal={Proceedings 2007 IEEE International Symposium on Information
Theory (ISIT 2007), Nice, France, June 2007, pp. 816-820},
year={2007},
doi={10.1109/ISIT.2007.455... | grassl2007constructions |
arxiv-677407 | quant-ph/0703215 | Classical Interaction Cannot Replace a Quantum Message | <|reference_start|>Classical Interaction Cannot Replace a Quantum Message: We demonstrate a two-player communication problem that can be solved in the one-way quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communication in the classical interactive (bounded error) model.<|referenc... | arxiv | @article{gavinsky2007classical,
title={Classical Interaction Cannot Replace a Quantum Message},
author={Dmytro Gavinsky},
journal={arXiv preprint arXiv:quant-ph/0703215},
year={2007},
archivePrefix={arXiv},
eprint={quant-ph/0703215},
primaryClass={quant-ph cs.CC}
} | gavinsky2007classical |
arxiv-677408 | quant-ph/9603004 | Is Quantum Bit Commitment Really Possible? | <|reference_start|>Is Quantum Bit Commitment Really Possible?: We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen type of attack and delaying her measurement until she opens her commitment.<|reference_... | arxiv | @article{lo1996is,
title={Is Quantum Bit Commitment Really Possible?},
author={Hoi-Kwong Lo and H. F. Chau},
journal={Phys. Rev. Lett. 78, 3410 (1997)},
year={1996},
doi={10.1103/PhysRevLett.78.3410},
archivePrefix={arXiv},
eprint={quant-ph/9603004},
primaryClass={quant-ph cs.CR}
} | lo1996is |
arxiv-677409 | quant-ph/9604007 | A decision procedure for unitary linear quantum cellular automata | <|reference_start|>A decision procedure for unitary linear quantum cellular automata: Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evo... | arxiv | @article{durr1996a,
title={A decision procedure for unitary linear quantum cellular automata},
author={Christoph Durr (LRI), Miklos Santha (CNRS)},
journal={Proceeding of the 37th IEEE Symposium on Foundations of Computer
Science, 38--45, 1996},
year={1996},
archivePrefix={arXiv},
eprint={quan... | durr1996a |
arxiv-677410 | quant-ph/9607014 | A Quantum Algorithm for Finding the Minimum | <|reference_start|>A Quantum Algorithm for Finding the Minimum: We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.<|reference_end|> | arxiv | @article{durr1996a,
title={A Quantum Algorithm for Finding the Minimum},
author={Christoph Durr and Peter Hoyer},
journal={arXiv preprint arXiv:quant-ph/9607014},
year={1996},
archivePrefix={arXiv},
eprint={quant-ph/9607014},
primaryClass={quant-ph cs.DS}
} | durr1996a |
arxiv-677411 | quant-ph/9611031 | Insecurity of Quantum Secure Computations | <|reference_start|>Insecurity of Quantum Secure Computations: It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller machines from learning th... | arxiv | @article{lo1996insecurity,
title={Insecurity of Quantum Secure Computations},
author={Hoi-Kwong Lo (HP Labs, Bristol and University of Santa Barbara)},
journal={arXiv preprint arXiv:quant-ph/9611031},
year={1996},
doi={10.1103/PhysRevA.56.1154},
archivePrefix={arXiv},
eprint={quant-ph/961103... | lo1996insecurity |
arxiv-677412 | quant-ph/9703009 | Reversible Simulation of Irreversible Computation by Pebble Games | <|reference_start|>Reversible Simulation of Irreversible Computation by Pebble Games: Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little overhead in additional computation time, they use a large amount of additional memory... | arxiv | @article{li1997reversible,
title={Reversible Simulation of Irreversible Computation by Pebble Games},
author={Ming Li (University of Waterloo), John Tromp (CWI), Paul Vitanyi (CWI
and University of Amsterdam)},
journal={Physica D120 (1998) 168-176},
year={1997},
doi={10.1016/S0167-2789(98)00052-9}... | li1997reversible |
arxiv-677413 | quant-ph/9703022 | Reversibility and Adiabatic Computation: Trading Time and Space for Energy | <|reference_start|>Reversibility and Adiabatic Computation: Trading Time and Space for Energy: Future miniaturization and mobilization of computing devices requires energy parsimonious `adiabatic' computation. This is contingent on logical reversibility of computation. An example is the idea of quantum computations whi... | arxiv | @article{li1997reversibility,
title={Reversibility and Adiabatic Computation: Trading Time and Space for
Energy},
author={Ming Li (University of Waterloo), Paul Vitanyi (CWI and University of
Amsterdam)},
journal={Proc. Royal Society of London, Series A, 452(1996), 769-789},
year={1997},
doi={10... | li1997reversibility |
arxiv-677414 | quant-ph/9712040 | Computing Local Invariants of Qubit Systems | <|reference_start|>Computing Local Invariants of Qubit Systems: We investigate means to describe the non-local properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple qubits. We compute invarian... | arxiv | @article{grassl1997computing,
title={Computing Local Invariants of Qubit Systems},
author={Markus Grassl, Martin Roetteler, and Thomas Beth (Universitaet
Karlsruhe)},
journal={Phys.Rev.A58:1833-1839,1998},
year={1997},
doi={10.1103/PhysRevA.58.1833},
archivePrefix={arXiv},
eprint={quant-ph... | grassl1997computing |
arxiv-677415 | quant-ph/9802028 | Analogue Quantum Computers for Data Analysis | <|reference_start|>Analogue Quantum Computers for Data Analysis: Analogue computers use continuous properties of physical system for modeling. In the paper is described possibility of modeling by analogue quantum computers for some model of data analysis. It is analogue associative memory and a formal neural network. A... | arxiv | @article{vlasov1998analogue,
title={Analogue Quantum Computers for Data Analysis},
author={Alexander Yu. Vlasov (FCR/IRH, St.-Petersburg, Russia)},
journal={arXiv preprint arXiv:quant-ph/9802028},
year={1998},
number={QCY-VAY12-291297},
archivePrefix={arXiv},
eprint={quant-ph/9802028},
p... | vlasov1998analogue |
arxiv-677416 | quant-ph/9802049 | Quantum Lower Bounds by Polynomials | <|reference_start|>Quantum Lower Bounds by Polynomials: We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions (i.e. problems involvin... | arxiv | @article{beals1998quantum,
title={Quantum Lower Bounds by Polynomials},
author={Robert Beals (U of Arizona), Harry Buhrman (CWI), Richard Cleve (U of
Calgary), Michele Mosca (U of Oxford), Ronald de Wolf (CWI and U of
Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/9802049},
year={1998},
arc... | beals1998quantum |
arxiv-677417 | quant-ph/9802062 | 1-way quantum finite automata: strengths, weaknesses and generalizations | <|reference_start|>1-way quantum finite automata: strengths, weaknesses and generalizations: We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (over 0.98), then the power ... | arxiv | @article{ambainis19981-way,
title={1-way quantum finite automata: strengths, weaknesses and generalizations},
author={A. Ambainis, R. Freivalds},
journal={arXiv preprint arXiv:quant-ph/9802062},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9802062},
primaryClass={quant-ph cs.CC}
} | ambainis19981-way |
arxiv-677418 | quant-ph/9804043 | Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata | <|reference_start|>Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata: We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist t... | arxiv | @article{ambainis1998dense,
title={Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata},
author={Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani},
journal={arXiv preprint arXiv:quant-ph/9804043},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9804043},
primar... | ambainis1998dense |
arxiv-677419 | quant-ph/9804066 | The quantum query complexity of approximating the median and related statistics | <|reference_start|>The quantum query complexity of approximating the median and related statistics: Let X = (x_0,...,x_{n-1})$ be a sequence of n numbers. For \epsilon > 0, we say that x_i is an \epsilon-approximate median if the number of elements strictly less than x_i, and the number of elements strictly greater tha... | arxiv | @article{nayak1998the,
title={The quantum query complexity of approximating the median and related
statistics},
author={Ashwin Nayak, Felix Wu},
journal={arXiv preprint arXiv:quant-ph/9804066},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9804066},
primaryClass={quant-ph cs.CC}
} | nayak1998the |
arxiv-677420 | quant-ph/9805006 | Quantum Oracle Interrogation: Getting all information for almost half the price | <|reference_start|>Quantum Oracle Interrogation: Getting all information for almost half the price: Consider a quantum computer in combination with a binary oracle of domain size N. It is shown how N/2+sqrt(N) calls to the oracle are sufficient to guess the whole content of the oracle (being an N bit string) with proba... | arxiv | @article{van dam1998quantum,
title={Quantum Oracle Interrogation: Getting all information for almost half
the price},
author={Wim van Dam (U of Oxford, CWI)},
journal={Proceedings of the 39th Annual IEEE Symposium on Foundations of
Computer Science (FOCS), pages 362-367 (1998)},
year={1998},
doi... | van dam1998quantum |
arxiv-677421 | quant-ph/9806090 | Two Classical Queries versus One Quantum Query | <|reference_start|>Two Classical Queries versus One Quantum Query: 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 quantum computer that is allowed only one such query. It is... | arxiv | @article{van dam1998two,
title={Two Classical Queries versus One Quantum Query},
author={Wim van Dam (U of Oxford, CWI)},
journal={arXiv preprint arXiv:quant-ph/9806090},
year={1998},
number={CQC-2CQ:1QQ},
archivePrefix={arXiv},
eprint={quant-ph/9806090},
primaryClass={quant-ph cs.CC}
} | van dam1998two |
arxiv-677422 | quant-ph/9807064 | Fast Quantum Fourier Transforms for a Class of Non-abelian Groups | <|reference_start|>Fast Quantum Fourier Transforms for a Class of Non-abelian Groups: 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 algorithm makes it a good starting po... | arxiv | @article{pueschel1998fast,
title={Fast Quantum Fourier Transforms for a Class of Non-abelian Groups},
author={Markus Pueschel, Martin Roetteler, and Thomas Beth (Universitaet
Karlsruhe)},
journal={Proceedings 13th International Symposium on Applied Algebra,
Algebraic Algorithms and Error-Correcting Code... | pueschel1998fast |
arxiv-677423 | quant-ph/9809016 | An Introduction to Quantum Computing for Non-Physicists | <|reference_start|>An Introduction to Quantum Computing for Non-Physicists: Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation appeared j... | arxiv | @article{rieffel1998an,
title={An Introduction to Quantum Computing for Non-Physicists},
author={Eleanor G. Rieffel and Wolfgang Polak},
journal={ACM Comput.Surveys 32:300-335,2000},
year={1998},
number={FXPAL-TR-98-044},
archivePrefix={arXiv},
eprint={quant-ph/9809016},
primaryClass={qu... | rieffel1998an |
arxiv-677424 | quant-ph/9809081 | Concatenating Decoherence Free Subspaces with Quantum Error Correcting Codes | <|reference_start|>Concatenating Decoherence Free Subspaces with Quantum Error Correcting Codes: An operator sum representation is derived for a decoherence-free subspace (DFS) and used to (i) show that DFSs are the class of quantum error correcting codes (QECCs) with fixed, unitary recovery operators, and (ii) find ex... | arxiv | @article{lidar1998concatenating,
title={Concatenating Decoherence Free Subspaces with Quantum Error Correcting
Codes},
author={D.A. Lidar, D. Bacon and K.B. Whaley (UC Berkeley)},
journal={Phys.Rev.Lett. 82 (1999) 4556-4559},
year={1998},
doi={10.1103/PhysRevLett.82.4556},
archivePrefix={arXiv... | lidar1998concatenating |
arxiv-677425 | quant-ph/9810067 | Coin Tossing is Strictly Weaker Than Bit Commitment | <|reference_start|>Coin Tossing is Strictly Weaker Than Bit Commitment: We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites between which special relativity guarantees a time lapse in communication. We show that, under these assumptions, unconditi... | arxiv | @article{kent1998coin,
title={Coin Tossing is Strictly Weaker Than Bit Commitment},
author={Adrian Kent},
journal={Phys.Rev.Lett. 83 (1999) 5382-5384},
year={1998},
doi={10.1103/PhysRevLett.83.5382},
number={DAMTP-1998-123},
archivePrefix={arXiv},
eprint={quant-ph/9810067},
primaryCl... | kent1998coin |
arxiv-677426 | quant-ph/9810068 | Unconditionally Secure Bit Commitment | <|reference_start|>Unconditionally Secure Bit Commitment: We describe a new classical bit commitment protocol based on cryptographic constraints imposed by special relativity. The protocol is unconditionally secure against classical or quantum attacks. It evades the no-go results of Mayers, Lo and Chau by requiring fro... | arxiv | @article{kent1998unconditionally,
title={Unconditionally Secure Bit Commitment},
author={Adrian Kent},
journal={Phys.Rev.Lett. 83 (1999) 1447-1450},
year={1998},
doi={10.1103/PhysRevLett.83.1447},
number={DAMTP-1997-135},
archivePrefix={arXiv},
eprint={quant-ph/9810068},
primaryClass... | kent1998unconditionally |
arxiv-677427 | quant-ph/9811046 | Lower Bounds for Quantum Search and Derandomization | <|reference_start|>Lower Bounds for Quantum Search and Derandomization: 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=O(sqrt{N}) then the error is lower bounded by a constan... | arxiv | @article{buhrman1998lower,
title={Lower Bounds for Quantum Search and Derandomization},
author={Harry Buhrman (CWI) and Ronald de Wolf (CWI and U Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/9811046},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9811046},
primaryClass={quant-p... | buhrman1998lower |
arxiv-677428 | quant-ph/9811056 | A Quick Glance at Quantum Cryptography | <|reference_start|>A Quick Glance at Quantum Cryptography: The recent application of the principles of quantum mechanics to cryptography has led to a remarkable new dimension in secret communication. As a result of these new developments, it is now possible to construct cryptographic communication systems which detect ... | arxiv | @article{lomonaco1998a,
title={A Quick Glance at Quantum Cryptography},
author={Samuel J. Lomonaco},
journal={arXiv preprint arXiv:quant-ph/9811056},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9811056},
primaryClass={quant-ph cs.CR}
} | lomonaco1998a |
arxiv-677429 | quant-ph/9811080 | A note on quantum black-box complexity of almost all Boolean functions | <|reference_start|>A note on quantum black-box complexity of almost all Boolean functions: We show that, for almost all N-variable Boolean functions f, at least N/4-O(\sqrt{N} log N) queries are required to compute f in quantum black-box model with bounded error.<|reference_end|> | arxiv | @article{ambainis1998a,
title={A note on quantum black-box complexity of almost all Boolean functions},
author={Andris Ambainis},
journal={Inform.Proc.Lett. 71 (1999) 5-7},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9811080},
primaryClass={quant-ph cs.CC}
} | ambainis1998a |
arxiv-677430 | quant-ph/9812032 | NQP_C = co-C_=P | <|reference_start|>NQP_C = co-C_=P: Adleman, DeMarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. Fortnow and Rogers implicitly showed that, when the amplitudes are rational numbers, NQP is contained in the complement of C_{=}P. Fenner, Green, Homer, an... | arxiv | @article{yamakami1998nqp_{c},
title={NQP_{C} = co-C_{=}P},
author={Tomoyuki Yamakami and Andrew C. Yao},
journal={Inform.Proc.Lett. 71 (1999) 63-69},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9812032},
primaryClass={quant-ph cs.CC}
} | yamakami1998nqp_{c} |
arxiv-677431 | quant-ph/9812070 | Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups | <|reference_start|>Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups: We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.<|reference_end|> | arxiv | @article{roetteler1998polynomial-time,
title={Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of
non-abelian Groups},
author={Martin Roetteler, and Thomas Beth},
journal={arXiv preprint arXiv:quant-ph/9812070},
year={1998},
archivePrefix={arXiv},
eprint={quant-ph/9812070},
... | roetteler1998polynomial-time |
arxiv-677432 | quant-ph/9902053 | A better lower bound for quantum algorithms searching an ordered list | <|reference_start|>A better lower bound for quantum algorithms searching an ordered list: We show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can ach... | arxiv | @article{ambainis1999a,
title={A better lower bound for quantum algorithms searching an ordered list},
author={Andris Ambainis},
journal={arXiv preprint arXiv:quant-ph/9902053},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9902053},
primaryClass={quant-ph cs.CC cs.DS}
} | ambainis1999a |
arxiv-677433 | quant-ph/9903035 | Quantum Bounded Query Complexity | <|reference_start|>Quantum Bounded Query Complexity: We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of decision problems. Under traditio... | arxiv | @article{buhrman1999quantum,
title={Quantum Bounded Query Complexity},
author={Harry Buhrman (CWI) and Wim van Dam (CQC and CWI)},
journal={Proceedings of the 14th Annual IEEE Conference on Computational
Complexity, pp. 149-156 (1999)},
year={1999},
doi={10.1109/CCC.1999.766273},
archivePrefix... | buhrman1999quantum |
arxiv-677434 | quant-ph/9903042 | An Almost-Quadratic Lower Bound for Quantum Formula Size | <|reference_start|>An Almost-Quadratic Lower Bound for Quantum Formula Size: We show that Nechiporuk's method for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an n^2 / log^2 n lower bound for quantum formulas computing an explicit function. The only known previous explicit... | arxiv | @article{roychowdhury1999an,
title={An Almost-Quadratic Lower Bound for Quantum Formula Size},
author={Vwani P. Roychowdhury and Farrokh Vatan},
journal={arXiv preprint arXiv:quant-ph/9903042},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9903042},
primaryClass={quant-ph cs.CC}
} | roychowdhury1999an |
arxiv-677435 | quant-ph/9904050 | A Computer Scientist's View of Life, the Universe, and Everything | <|reference_start|>A Computer Scientist's View of Life, the Universe, and Everything: Is the universe computable? If so, it may be much cheaper in terms of information requirements to compute all computable universes instead of just ours. I apply basic concepts of Kolmogorov complexity theory to the set of possible uni... | arxiv | @article{schmidhuber1999a,
title={A Computer Scientist's View of Life, the Universe, and Everything},
author={Juergen Schmidhuber},
journal={In C. Freksa, ed., Foundations of Computer Science: Potential -
Theory - Cognition, Lecture Notes in Computer Science, pp. 201-208, Springer,
1997},
year={1999... | schmidhuber1999a |
arxiv-677436 | quant-ph/9904066 | Probabilities to accept languages by quantum finite automata | <|reference_start|>Probabilities to accept languages by quantum finite automata: We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the ... | arxiv | @article{ambainis1999probabilities,
title={Probabilities to accept languages by quantum finite automata},
author={Andris Ambainis, Richard Bonner, Rusins Freivalds, Arnolds Kikusts},
journal={arXiv preprint arXiv:quant-ph/9904066},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9904066},
... | ambainis1999probabilities |
arxiv-677437 | quant-ph/9904079 | Average-Case Quantum Query Complexity | <|reference_start|>Average-Case Quantum Query Complexity: 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. We show that for average-case complexity under the uniform distribution, ... | arxiv | @article{ambainis1999average-case,
title={Average-Case Quantum Query Complexity},
author={Andris Ambainis (UC Berkeley) and Ronald de Wolf (CWI and U of
Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/9904079},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9904079},
primaryClass... | ambainis1999average-case |
arxiv-677438 | quant-ph/9904091 | A simple proof of the unconditional security of quantum key distribution | <|reference_start|>A simple proof of the unconditional security of quantum key distribution: Quantum key distribution is the most well-known application of quantum cryptography. Previous proposed proofs of security of quantum key distribution contain various technical subtleties. Here, a conceptually simpler proof of s... | arxiv | @article{lo1999a,
title={A simple proof of the unconditional security of quantum key distribution},
author={Hoi-Kwong Lo (Hewlett-Packard Labs, Bristol)},
journal={J.Phys.A34:6957-6968,2001},
year={1999},
doi={10.1088/0305-4470/34/35/321},
archivePrefix={arXiv},
eprint={quant-ph/9904091},
... | lo1999a |
arxiv-677439 | quant-ph/9904093 | Optimal lower bounds for quantum automata and random access codes | <|reference_start|>Optimal lower bounds for quantum automata and random access codes: Consider the finite regular language L_n = {w0 : w \in {0,1}^*, |w| \le n}. It was shown by Ambainis, Nayak, Ta-Shma and Vazirani that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quant... | arxiv | @article{nayak1999optimal,
title={Optimal lower bounds for quantum automata and random access codes},
author={Ashwin Nayak},
journal={arXiv preprint arXiv:quant-ph/9904093},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9904093},
primaryClass={quant-ph cs.CC}
} | nayak1999optimal |
arxiv-677440 | quant-ph/9904108 | Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates | <|reference_start|>Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates: We consider the design of self-testers for quantum gates. A self-tester for the gates F_1,...,F_m is a classical procedure that, given any gates G_1,...,G_m, decides with high probability if each G_i is close to F_i. This decision ha... | arxiv | @article{van dam1999self-testing,
title={Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates},
author={Wim van Dam (1,2) and Frederic Magniez (3) and Michele Mosca (2,4) and
Miklos Santha (3,5) ((1) CWI Amsterdam (2) CQC Oxford (3) LRI Paris Sud (4) U
of Waterloo (5) CNRS)},
journal={Proc... | van dam1999self-testing |
arxiv-677441 | quant-ph/9905026 | Quantum finite multitape automata | <|reference_start|>Quantum finite multitape automata: Quantum finite automata were introduced by C.Moore, J.P. Crutchfield, and by A.Kondacs and J.Watrous. This notion is not a generalization of the deterministic finite automata. Moreover, it was proved that not all regular languages can be recognized by quantum finite... | arxiv | @article{ambainis1999quantum,
title={Quantum finite multitape automata},
author={Andris Ambainis, Richard Bonner, Rusins Freivalds, Marats Golovkins,
Marek Karpinski},
journal={arXiv preprint arXiv:quant-ph/9905026},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9905026},
primaryCla... | ambainis1999quantum |
arxiv-677442 | quant-ph/9905043 | Operation of universal gates in a DXD superconducting solid state quantum computer | <|reference_start|>Operation of universal gates in a DXD superconducting solid state quantum computer: We demonstrate that complete set of gates can be realized in a DXD superconducting solid state quantum computer (quamputer), thereby proving its universality.<|reference_end|> | arxiv | @article{blais1999operation,
title={Operation of universal gates in a DXD superconducting solid state
quantum computer},
author={Alexandre Blais and Alexandre M. Zagoskin},
journal={Physical Review A, v.61, 042308 (2000)},
year={1999},
doi={10.1103/PhysRevA.61.042308},
archivePrefix={arXiv},
... | blais1999operation |
arxiv-677443 | quant-ph/9906084 | A Foundation of Programming a Multi-Tape Quantum Turing machine | <|reference_start|>A Foundation of Programming a Multi-Tape Quantum Turing machine: The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multi-head Quantum Turing machines with multi final states that also allow tape heads to stay still.<|reference_end... | arxiv | @article{yamakami1999a,
title={A Foundation of Programming a Multi-Tape Quantum Turing machine},
author={Tomoyuki Yamakami},
journal={arXiv preprint arXiv:quant-ph/9906084},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9906084},
primaryClass={quant-ph cs.CC}
} | yamakami1999a |
arxiv-677444 | quant-ph/9906103 | Secure Classical Bit Commitment using Fixed Capacity Communication Channels | <|reference_start|>Secure Classical Bit Commitment using Fixed Capacity Communication Channels: If mutually mistrustful parties A and B control two or more appropriately located sites, special relativity can be used to guarantee that a pair of messages exchanged by A and B are independent. In earlier work, we used this... | arxiv | @article{kent1999secure,
title={Secure Classical Bit Commitment using Fixed Capacity Communication
Channels},
author={Adrian Kent (Centre for Quantum Computation, University of Cambridge)},
journal={J.Cryptolog. 18 (2005) 313-335},
year={1999},
number={DAMTP-1999-47},
archivePrefix={arXiv},
... | kent1999secure |
arxiv-677445 | quant-ph/9907009 | The importance of quantum decoherence in brain processes | <|reference_start|>The importance of quantum decoherence in brain processes: Based on a calculation of neural decoherence rates, we argue that that the degrees of freedom of the human brain that relate to cognitive processes should be thought of as a classical rather than quantum system, i.e., that there is nothing fun... | arxiv | @article{tegmark1999the,
title={The importance of quantum decoherence in brain processes},
author={Max Tegmark},
journal={Phys.Rev.E61:4194-4206,2000},
year={1999},
doi={10.1103/PhysRevE.61.4194},
archivePrefix={arXiv},
eprint={quant-ph/9907009},
primaryClass={quant-ph cond-mat.dis-nn cs... | tegmark1999the |
arxiv-677446 | quant-ph/9909012 | Analysis of Quantum Functions | <|reference_start|>Analysis of Quantum Functions: This paper initiates a systematic study of quantum functions, which are (partial) functions defined in terms of quantum mechanical computations. Of all quantum functions, we focus on resource-bounded quantum functions whose inputs are classical bit strings. We prove com... | arxiv | @article{yamakami1999analysis,
title={Analysis of Quantum Functions},
author={Tomoyuki Yamakami},
journal={International Journal of Foundations of Computer Science,
Vol.14(5), pp.815-852, October 2003.},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9909012},
primaryClass={quant-ph ... | yamakami1999analysis |
arxiv-677447 | quant-ph/9909094 | Quantum Computation and Quadratically Signed Weight Enumerators | <|reference_start|>Quantum Computation and Quadratically Signed Weight Enumerators: We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums ca... | arxiv | @article{knill1999quantum,
title={Quantum Computation and Quadratically Signed Weight Enumerators},
author={E. Knill, R. Laflamme},
journal={arXiv preprint arXiv:quant-ph/9909094},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9909094},
primaryClass={quant-ph cs.CC}
} | knill1999quantum |
arxiv-677448 | quant-ph/9910033 | Almost-Everywhere Superiority for Quantum Computing | <|reference_start|>Almost-Everywhere Superiority for Quantum Computing: Simon as extended by Brassard and H{\o}yer shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine infinitely often. The present paper shows that there are tasks on which polynomial-... | arxiv | @article{hemaspaandra1999almost-everywhere,
title={Almost-Everywhere Superiority for Quantum Computing},
author={Edith Hemaspaandra (RIT), Lane A. Hemaspaandra (University of
Rochester), Marius Zimand (Towson University)},
journal={arXiv preprint arXiv:quant-ph/9910033},
year={1999},
number={Revis... | hemaspaandra1999almost-everywhere |
arxiv-677449 | quant-ph/9910087 | Unconditionally Secure Commitment of a Certified Classical Bit is Impossible | <|reference_start|>Unconditionally Secure Commitment of a Certified Classical Bit is Impossible: In a secure bit commitment protocol involving only classical physics, A commits either a 0 or a 1 to B. If quantum information is used in the protocol, A may be able to commit a state of the form $\alpha \ket{0} + \beta \ke... | arxiv | @article{kent1999unconditionally,
title={Unconditionally Secure Commitment of a Certified Classical Bit is
Impossible},
author={Adrian Kent (DAMTP, University of Cambridge)},
journal={Phys. Rev. A 61, 042301 (2000)},
year={1999},
doi={10.1103/PhysRevA.61.042301},
number={DAMTP-1999-51},
ar... | kent1999unconditionally |
arxiv-677450 | quant-ph/9911043 | Cheat Sensitive Quantum Bit Commitment | <|reference_start|>Cheat Sensitive Quantum Bit Commitment: We define cheat sensitive cryptographic protocols between mistrustful parties as protocols which guarantee that, if either cheats, the other has some nonzero probability of detecting the cheating. We give an example of an unconditionally secure cheat sensitive ... | arxiv | @article{hardy1999cheat,
title={Cheat Sensitive Quantum Bit Commitment},
author={Lucien Hardy (The Perimeter Institute) and Adrian Kent (Centre for
Quantum Computation, University of Cambridge)},
journal={Phys. Rev. Lett. 92, 157901 (2004).},
year={1999},
doi={10.1103/PhysRevLett.92.157901},
a... | hardy1999cheat |
arxiv-677451 | quant-ph/9912100 | Quantum Computing, NP-complete Problems and Chaotic Dynamics | <|reference_start|>Quantum Computing, NP-complete Problems and Chaotic Dynamics: An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combin... | arxiv | @article{ohya1999quantum,
title={Quantum Computing, NP-complete Problems and Chaotic Dynamics},
author={Masanori Ohya and Igor V. Volovich},
journal={arXiv preprint arXiv:quant-ph/9912100},
year={1999},
archivePrefix={arXiv},
eprint={quant-ph/9912100},
primaryClass={quant-ph chao-dyn cond-ma... | ohya1999quantum |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.