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-677201 | quant-ph/0210176 | Quantum Pattern Recognition | <|reference_start|>Quantum Pattern Recognition: I review and expand the model of quantum associative memory that I have recently proposed. In this model binary patterns of n bits are stored in the quantum superposition of the appropriate subset of the computational basis of n qbits. Information can be retrieved by perf... | arxiv | @article{trugenberger2002quantum,
title={Quantum Pattern Recognition},
author={Carlo A. Trugenberger},
journal={arXiv preprint arXiv:quant-ph/0210176},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0210176},
primaryClass={quant-ph cond-mat.dis-nn cs.IR nlin.AO q-bio.NC}
} | trugenberger2002quantum |
arxiv-677202 | quant-ph/0211014 | Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes | <|reference_start|>Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes: We present two methods for the construction of quantum circuits for quantum error-correcting codes (QECC). The underlying quantum systems are tensor products of subsystems (qudits) of equal dimension which is a prime power. For ... | arxiv | @article{grassl2002efficient,
title={Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes},
author={Markus Grassl (1,2), Martin Roetteler (1), and Thomas Beth (1),
(Universitaet Karlsruhe (1), The Mathematical Sciences Research Institute
(2))},
journal={International Journal of Founda... | grassl2002efficient |
arxiv-677203 | quant-ph/0211029 | Quantum Zero-Error Algorithms Cannot be Composed | <|reference_start|>Quantum Zero-Error Algorithms Cannot be Composed: We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed.... | arxiv | @article{buhrman2002quantum,
title={Quantum Zero-Error Algorithms Cannot be Composed},
author={Harry Buhrman and Ronald de Wolf (CWI, Amsterdam)},
journal={Information Processing Letters, 87(2):79-84, 2003},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0211029},
primaryClass={quant-p... | buhrman2002quantum |
arxiv-677204 | quant-ph/0211174 | Quantum Time-Space Tradeoffs for Sorting | <|reference_start|>Quantum Time-Space Tradeoffs for Sorting: We investigate the complexity of sorting in the model of sequential quantum circuits. While it is known that in general a quantum algorithm based on comparisons alone cannot outperform classical sorting algorithms by more than a constant factor in time comple... | arxiv | @article{klauck2002quantum,
title={Quantum Time-Space Tradeoffs for Sorting},
author={Hartmut Klauck},
journal={arXiv preprint arXiv:quant-ph/0211174},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0211174},
primaryClass={quant-ph cs.CC}
} | klauck2002quantum |
arxiv-677205 | quant-ph/0211179 | Comparing EQP and MOD_p^kP using Polynomial Degree Lower Bounds | <|reference_start|>Comparing EQP and MOD_p^kP using Polynomial Degree Lower Bounds: We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting classes MOD_{p^k}P. Our proof makes use of the degree of a representing polynomial over the finite field o... | arxiv | @article{de graaf2002comparing,
title={Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds},
author={M. de Graaf (CWI, Amsterdam) and P. Valiant (Stanford)},
journal={arXiv preprint arXiv:quant-ph/0211179},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0211179},
primaryC... | de graaf2002comparing |
arxiv-677206 | quant-ph/0211191 | An invitation to Quantum Game Theory | <|reference_start|>An invitation to Quantum Game Theory: Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper presents the history, basic ideas and recent development in quantum game theory. In this context, a new application... | arxiv | @article{piotrowski2002an,
title={An invitation to Quantum Game Theory},
author={E. W. Piotrowski, J. Sladkowski},
journal={Int.J.Theor.Phys. 42 (2003) 1089},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0211191},
primaryClass={quant-ph cond-mat cs.GT hep-th math-ph math.MP}
} | piotrowski2002an |
arxiv-677207 | quant-ph/0212043 | Large N Quantum Cryptography | <|reference_start|>Large N Quantum Cryptography: In quantum cryptography, the level of security attainable by a protocol which implements a particular task $N$ times bears no simple relation to the level of security attainable by a protocol implementing the task once. Useful partial security, and even near-perfect secu... | arxiv | @article{kent2002large,
title={Large N Quantum Cryptography},
author={Adrian Kent (Centre for Quantum Computation, University of Cambridge)},
journal={in "Quantum Communication, Measurement and Computing (QCMC'02)",
J. Shapiro and O. Hirota (eds), Rinton Press (2003)},
year={2002},
archivePrefix={... | kent2002large |
arxiv-677208 | quant-ph/0212071 | Upper bound by Kolmogorov complexity for the probability in computable POVM measurement | <|reference_start|>Upper bound by Kolmogorov complexity for the probability in computable POVM measurement: We apply algorithmic information theory to quantum mechanics in order to shed light on an algorithmic structure which inheres in quantum mechanics. There are two equivalent ways to define the (classical) Kolmog... | arxiv | @article{tadaki2002upper,
title={Upper bound by Kolmogorov complexity for the probability in computable
POVM measurement},
author={Kohtaro Tadaki},
journal={arXiv preprint arXiv:quant-ph/0212071},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0212071},
primaryClass={quant-ph cs.CC}
... | tadaki2002upper |
arxiv-677209 | quant-ph/0301075 | Selective pressures on genomes in molecular evolution | <|reference_start|>Selective pressures on genomes in molecular evolution: We describe the evolution of macromolecules as an information transmission process and apply tools from Shannon information theory to it. This allows us to isolate three independent, competing selective pressures that we term compression, transmi... | arxiv | @article{ofria2003selective,
title={Selective pressures on genomes in molecular evolution},
author={Charles Ofria (Michigan State University), Christoph Adami (JPL,
Caltech), Travis C. Collier (UCLA)},
journal={J. theor. Biol. 222 (2003) 477-483},
year={2003},
doi={10.1016/S0022-5193(03)00062-6},
... | ofria2003selective |
arxiv-677210 | quant-ph/0301078 | On the Monomiality of Nice Error Bases | <|reference_start|>On the Monomiality of Nice Error Bases: Unitary error bases generalize the Pauli matrices to higher dimensional systems. Two basic constructions of unitary error bases are known: An algebraic construction by Knill, which yields nice error bases, and a combinatorial construction by Werner, which yield... | arxiv | @article{klappenecker2003on,
title={On the Monomiality of Nice Error Bases},
author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
(University of Waterloo)},
journal={IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 1084
- 1089, 2005},
year={2003},
archivePrefix={arXi... | klappenecker2003on |
arxiv-677211 | quant-ph/0302079 | 3-Local Hamiltonian is QMA-complete | <|reference_start|>3-Local Hamiltonian is QMA-complete: It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by showing that 3-local Hamiltonian is already QMA-complete.<|reference_end|> | arxiv | @article{kempe20033-local,
title={3-Local Hamiltonian is QMA-complete},
author={Julia Kempe and Oded Regev},
journal={Quantum Computation and Information, Vol. 3(3), p. 258-64, 2003},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0302079},
primaryClass={quant-ph cs.CC}
} | kempe20033-local |
arxiv-677212 | quant-ph/0303081 | Quantum random walks - an introductory overview | <|reference_start|>Quantum random walks - an introductory overview: This article aims to provide an introductory survey on quantum random walks. Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to ... | arxiv | @article{kempe2003quantum,
title={Quantum random walks - an introductory overview},
author={Julia Kempe},
journal={Contemporary Physics, Vol. 44 (4), p.307-327, 2003},
year={2003},
doi={10.1080/00107151031000110776},
archivePrefix={arXiv},
eprint={quant-ph/0303081},
primaryClass={quant-p... | kempe2003quantum |
arxiv-677213 | quant-ph/0303091 | Comment on "Probabilistic Quantum Memories" | <|reference_start|>Comment on "Probabilistic Quantum Memories": This is a comment on two wrong Phys. Rev. Letters papers by C.A. Trugenberger. Trugenberger claimed that quantum registers could be used as exponentially large "associative" memories. We show that his scheme is no better than one where the quantum register... | arxiv | @article{brun2003comment,
title={Comment on "Probabilistic Quantum Memories"},
author={T.Brun, H.Klauck, A.Nayak, M.Roetteler, Ch.Zalka},
journal={Phys. Rev. Lett. 91 209801 (2003)},
year={2003},
doi={10.1103/PhysRevLett.91.209801},
archivePrefix={arXiv},
eprint={quant-ph/0303091},
prima... | brun2003comment |
arxiv-677214 | quant-ph/0304052 | Quantum Search on Bounded-Error Inputs | <|reference_start|>Quantum Search on Bounded-Error Inputs: Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O(sqrt{n}) repetitions of the base algorithms and with high probability finds the index of a 1-bit among ... | arxiv | @article{hoyer2003quantum,
title={Quantum Search on Bounded-Error Inputs},
author={Peter Hoyer (Calgary), Michele Mosca (Waterloo, Perimeter Institute),
Ronald de Wolf (CWI, Amsterdam)},
journal={30th Intl. Colloquium on Automata, Languages, and Programming
(ICALP), LNCS 2719, pp. 291-299, 2003},
ye... | hoyer2003quantum |
arxiv-677215 | quant-ph/0304112 | Multiparty Quantum Coin Flipping | <|reference_start|>Multiparty Quantum Coin Flipping: We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. (2) We discovered that quantum broadcast is essentially a co... | arxiv | @article{ambainis2003multiparty,
title={Multiparty Quantum Coin Flipping},
author={Andris Ambainis, Harry Buhrman, Yevgeniy Dodis and Hein Roehrig},
journal={arXiv preprint arXiv:quant-ph/0304112},
year={2003},
doi={10.1109/CCC.2004.1313848},
archivePrefix={arXiv},
eprint={quant-ph/0304112},... | ambainis2003multiparty |
arxiv-677216 | quant-ph/0304114 | Numerical simulations of a quantum algorithm for Hilbert's tenth problem | <|reference_start|>Numerical simulations of a quantum algorithm for Hilbert's tenth problem: We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiab... | arxiv | @article{kieu2003numerical,
title={Numerical simulations of a quantum algorithm for Hilbert's tenth problem},
author={Tien D Kieu},
journal={in Proceedings of SPIE Vol. 5105 Quantum Information and
Computation, edited by Eric Donkor, Andrew R. Pirich, Howard E. Brandt,
(SPIE, Bellingham, WA, 2003), pp. ... | kieu2003numerical |
arxiv-677217 | quant-ph/0304206 | Harmonic inversion helps to beat time-energy uncertainty relations | <|reference_start|>Harmonic inversion helps to beat time-energy uncertainty relations: It is impossible to obtain accurate frequencies from time signals of a very short duration. This is a common believe among contemporary physicists. Here I present a practical way of extracting energies to a high precision from very s... | arxiv | @article{karkuszewski2003harmonic,
title={Harmonic inversion helps to beat time-energy uncertainty relations},
author={Zbyszek P. Karkuszewski},
journal={arXiv preprint arXiv:quant-ph/0304206},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0304206},
primaryClass={quant-ph cs.NA}
} | karkuszewski2003harmonic |
arxiv-677218 | quant-ph/0305017 | Quantum computer: an appliance for playing market games | <|reference_start|>Quantum computer: an appliance for playing market games: Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The authors have recently proposed a quantum description of financial market in terms of quantum game theo... | arxiv | @article{piotrowski2003quantum,
title={Quantum computer: an appliance for playing market games},
author={Edward W. Piotrowski and Jan Sladkowski},
journal={arXiv preprint arXiv:quant-ph/0305017},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0305017},
primaryClass={quant-ph cond-mat c... | piotrowski2003quantum |
arxiv-677219 | quant-ph/0305028 | Polynomial degree vs quantum query complexity | <|reference_start|>Polynomial degree vs quantum query complexity: The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whe... | arxiv | @article{ambainis2003polynomial,
title={Polynomial degree vs. quantum query complexity},
author={Andris Ambainis},
journal={Journal of Computer and System Sciences, 72(2): 220-238, 2006},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0305028},
primaryClass={quant-ph cs.CC}
} | ambainis2003polynomial |
arxiv-677220 | quant-ph/0305100 | Polynomial time quantum computation with advice | <|reference_start|>Polynomial time quantum computation with advice: Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an unde... | arxiv | @article{nishimura2003polynomial,
title={Polynomial time quantum computation with advice},
author={Harumichi Nishimura and Tomoyuki Yamakami},
journal={Information Processing Letters 90 (2004) 195-204},
year={2003},
doi={10.1016/j.ipl.2004.02.005},
archivePrefix={arXiv},
eprint={quant-ph/030... | nishimura2003polynomial |
arxiv-677221 | quant-ph/0305179 | Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range | <|reference_start|>Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range: We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}... | arxiv | @article{ambainis2003polynomial,
title={Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and
Element Distinctness with Small Range},
author={Andris Ambainis},
journal={Theory of Computing, 1:37-46, 2005},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0305179},
pri... | ambainis2003polynomial |
arxiv-677222 | quant-ph/0306077 | Quantum Domain Theory - Definitions and Applications | <|reference_start|>Quantum Domain Theory - Definitions and Applications: Classically domain theory is a rigourous mathematical structure to describe denotational semantics for programming languages and to study the computability of partial functions. Recently, the application of domain theory has also been extended to ... | arxiv | @article{kashefi2003quantum,
title={Quantum Domain Theory - Definitions and Applications},
author={Elham Kashefi},
journal={arXiv preprint arXiv:quant-ph/0306077},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0306077},
primaryClass={quant-ph cs.PL}
} | kashefi2003quantum |
arxiv-677223 | quant-ph/0306118 | Unconditionally Secure Multipartite Quantum Key Distribution | <|reference_start|>Unconditionally Secure Multipartite Quantum Key Distribution: We consider the problem of secure key distribution among $n$ trustful agents: the goal is to distribute an identical random bit-string among the $n$ agents over a noisy channel such that eavesdroppers learn little about it. We study the ge... | arxiv | @article{singh2003unconditionally,
title={Unconditionally Secure Multipartite Quantum Key Distribution},
author={Sudhir Kumar Singh and R. Srikanth},
journal={arXiv preprint arXiv:quant-ph/0306118},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0306118},
primaryClass={quant-ph cs.CR}
... | singh2003unconditionally |
arxiv-677224 | quant-ph/0306158 | Information Processing beyond Quantum Computation | <|reference_start|>Information Processing beyond Quantum Computation: Recent developments in quantum computation have made it clear that there is a lot more to computation than the conventional Boolean algebra. Is quantum computation the most general framework for processing information? Having gathered the courage to ... | arxiv | @article{patel2003information,
title={Information Processing beyond Quantum Computation},
author={Apoorva Patel (CHEP and SERC, IISc, Bangalore)},
journal={arXiv preprint arXiv:quant-ph/0306158},
year={2003},
number={IISc-CTS-3/03},
archivePrefix={arXiv},
eprint={quant-ph/0306158},
prima... | patel2003information |
arxiv-677225 | quant-ph/0306161 | How to reuse a one-time pad and other notes on authentication, encryption and protection of quantum information | <|reference_start|>How to reuse a one-time pad and other notes on authentication, encryption and protection of quantum information: Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number... | arxiv | @article{oppenheim2003how,
title={How to reuse a one-time pad and other notes on authentication,
encryption and protection of quantum information},
author={Jonathan Oppenheim and Michal Horodecki},
journal={Phys. Rev. A 72, 042309 (2005)},
year={2003},
doi={10.1103/PhysRevA.72.042309},
archive... | oppenheim2003how |
arxiv-677226 | quant-ph/0306182 | Quantum Computing Without Entanglement | <|reference_start|>Quantum Computing Without Entanglement: It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability of the outcome after... | arxiv | @article{biham2003quantum,
title={Quantum Computing Without Entanglement},
author={Eli Biham, Gilles Brassard, Dan Kenigsberg and Tal Mor},
journal={Theoretical Computer Science, Volume 320, Issue 1, Pages 15 - 33,
June 2004.},
year={2003},
doi={10.1016/j.tcs.2004.03.041},
archivePrefix={arXiv... | biham2003quantum |
arxiv-677227 | quant-ph/0307017 | Quaternionic Computing | <|reference_start|>Quaternionic Computing: We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum computing: superposition and linearity of... | arxiv | @article{fernandez2003quaternionic,
title={Quaternionic Computing},
author={Jose M. Fernandez, William A. Schneeberger},
journal={arXiv preprint arXiv:quant-ph/0307017},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0307017},
primaryClass={quant-ph cs.CC}
} | fernandez2003quaternionic |
arxiv-677228 | quant-ph/0307076 | Quantum Symmetrically-Private Information Retrieval | <|reference_start|>Quantum Symmetrically-Private Information Retrieval: Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k>=1 servers, while satisfying various privacy constraints. We exhibit quantum k-server symmetrically-private information retrieval... | arxiv | @article{kerenidis2003quantum,
title={Quantum Symmetrically-Private Information Retrieval},
author={Iordanis Kerenidis (UC Berkeley) and Ronald de Wolf (CWI Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/0307076},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0307076},
primaryCla... | kerenidis2003quantum |
arxiv-677229 | quant-ph/0307149 | Lower Bounds for Local Search by Quantum Arguments | <|reference_start|>Lower Bounds for Local Search by Quantum Arguments: The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hypercube {0,1}^n, we show a lower bound of Omega(2^{n/4}/n) on the number... | arxiv | @article{aaronson2003lower,
title={Lower Bounds for Local Search by Quantum Arguments},
author={Scott Aaronson},
journal={arXiv preprint arXiv:quant-ph/0307149},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0307149},
primaryClass={quant-ph cs.CC}
} | aaronson2003lower |
arxiv-677230 | quant-ph/0307150 | A Lambda Calculus for Quantum Computation | <|reference_start|>A Lambda Calculus for Quantum Computation: The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine, and continues to be of enormous benefit in the ... | arxiv | @article{van tonder2003a,
title={A Lambda Calculus for Quantum Computation},
author={Andre van Tonder},
journal={SIAM J.Comput. 33 (2004) 1109-1135},
year={2003},
doi={10.1137/S0097539703432165},
number={BROWN-HET-1366},
archivePrefix={arXiv},
eprint={quant-ph/0307150},
primaryClass=... | van tonder2003a |
arxiv-677231 | quant-ph/0307170 | Quantum Stein's lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb | <|reference_start|>Quantum Stein's lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb: We derive the monotonicity of the quantum relative entropy by an elementary operational argument based on Stein's lemma in quantum hypothesis testing. For the latter we present an elementary and shor... | arxiv | @article{bjelakovic2003quantum,
title={Quantum Stein's lemma revisited, inequalities for quantum entropies, and
a concavity theorem of Lieb},
author={Igor Bjelakovic, Rainer Siegmund-Schultze},
journal={arXiv preprint arXiv:quant-ph/0307170},
year={2003},
archivePrefix={arXiv},
eprint={quant-p... | bjelakovic2003quantum |
arxiv-677232 | quant-ph/0307200 | Generalized Quantum Secret Sharing | <|reference_start|>Generalized Quantum Secret Sharing: We explore a generalization of quantum secret sharing (QSS) in which classical shares play a complementary role to quantum shares, exploring further consequences of an idea first studied by Nascimento, Mueller-Quade and Imai (Phys. Rev. {\bf A64} 042311 (2001)). We... | arxiv | @article{singh2003generalized,
title={Generalized Quantum Secret Sharing},
author={Sudhir Kumar Singh, R. Srikanth},
journal={Phys. Rev. A 71, 012328 (2005)},
year={2003},
doi={10.1103/PhysRevA.71.012328},
archivePrefix={arXiv},
eprint={quant-ph/0307200},
primaryClass={quant-ph cs.CR}
} | singh2003generalized |
arxiv-677233 | quant-ph/0308072 | Computational Complexity Measures of Multipartite Quantum Entanglement | <|reference_start|>Computational Complexity Measures of Multipartite Quantum Entanglement: We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. B... | arxiv | @article{yamakami2003computational,
title={Computational Complexity Measures of Multipartite Quantum Entanglement},
author={Tomoyuki Yamakami},
journal={Proc. 14th ISAAC. Springer's LNCS, Vol.2906, pp.117-128, 2003},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0308072},
primaryClass... | yamakami2003computational |
arxiv-677234 | quant-ph/0308125 | Quantum NP and a Quantum Hierarchy | <|reference_start|>Quantum NP and a Quantum Hierarchy: The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define "Quantum NP," the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill, Kitaev, and Watrous. From a... | arxiv | @article{yamakami2003quantum,
title={Quantum NP and a Quantum Hierarchy},
author={Tomoyuki Yamakami},
journal={arXiv preprint arXiv:quant-ph/0308125},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0308125},
primaryClass={quant-ph cs.CC}
} | yamakami2003quantum |
arxiv-677235 | quant-ph/0308158 | New Approachs to Quantum Computer Simulaton in a Classical Supercomputer | <|reference_start|>New Approachs to Quantum Computer Simulaton in a Classical Supercomputer: Classical simulation is important because it sets a benchmark for quantum computer performance. Classical simulation is currently the only way to exercise larger numbers of qubits. To achieve larger simulations, sparse matrix p... | arxiv | @article{burger2003new,
title={New Approachs to Quantum Computer Simulaton in a Classical Supercomputer},
author={John Robert Burger},
journal={arXiv preprint arXiv:quant-ph/0308158},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0308158},
primaryClass={quant-ph cs.CE}
} | burger2003new |
arxiv-677236 | quant-ph/0309018 | Treatment of sound on quantum computers | <|reference_start|>Treatment of sound on quantum computers: We study numerically how a sound signal stored in a quantum computer can be recognized and restored with a minimal number of measurements in presence of random quantum gate errors. A method developed uses elements of MP3 sound compression and allows to recover... | arxiv | @article{lee2003treatment,
title={Treatment of sound on quantum computers},
author={Jae Weon Lee, Alexei Chepelianskii and Dima Shepelyansky (CNRS,
Toulouse and ENS, Paris)},
journal={arXiv preprint arXiv:quant-ph/0309018},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0309018},
pri... | lee2003treatment |
arxiv-677237 | quant-ph/0309022 | Quantum Aspects of Semantic Analysis and Symbolic Artificial Intelligence | <|reference_start|>Quantum Aspects of Semantic Analysis and Symbolic Artificial Intelligence: Modern approaches to semanic analysis if reformulated as Hilbert-space problems reveal formal structures known from quantum mechanics. Similar situation is found in distributed representations of cognitive structures developed... | arxiv | @article{aerts2003quantum,
title={Quantum Aspects of Semantic Analysis and Symbolic Artificial
Intelligence},
author={Diederik Aerts and Marek Czachor},
journal={J. Phys. A: Math. Gen. 37 (2004) L123-L132},
year={2003},
doi={10.1088/0305-4470/37/12/L01},
archivePrefix={arXiv},
eprint={quan... | aerts2003quantum |
arxiv-677238 | quant-ph/0309033 | Correlated Equilibria of Classical Strategic Games with Quantum Signals | <|reference_start|>Correlated Equilibria of Classical Strategic Games with Quantum Signals: Correlated equilibria are sometimes more efficient than the Nash equilibria of a game without signals. We investigate whether the availability of quantum signals in the context of a classical strategic game may allow the players... | arxiv | @article{la mura2003correlated,
title={Correlated Equilibria of Classical Strategic Games with Quantum Signals},
author={Pierfrancesco La Mura},
journal={Int. J. Quantum Inform., 03, 183 (2005)},
year={2003},
doi={10.1142/S0219749905000724},
archivePrefix={arXiv},
eprint={quant-ph/0309033},
... | la mura2003correlated |
arxiv-677239 | quant-ph/0309120 | Constructions of Mutually Unbiased Bases | <|reference_start|>Constructions of Mutually Unbiased Bases: Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if |<b|b'>|^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of C^d cannot exceed ... | arxiv | @article{klappenecker2003constructions,
title={Constructions of Mutually Unbiased Bases},
author={Andreas Klappenecker (Texas A&M University) and Martin Roetteler
(University of Waterloo)},
journal={Proceedings of the 7th International Conference on Finite Fields
(Fq7), Toulouse, France, Springer LNCS, ... | klappenecker2003constructions |
arxiv-677240 | quant-ph/0309121 | Quantum Software Reusability | <|reference_start|>Quantum Software Reusability: The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature... | arxiv | @article{klappenecker2003quantum,
title={Quantum Software Reusability},
author={Andreas Klappenecker (Texas A&M University) and Martin Roetteler
(University of Waterloo)},
journal={International Journal on Foundations of Computer Science, 14(5),
pages 777-796, 2003},
year={2003},
archivePrefix={... | klappenecker2003quantum |
arxiv-677241 | quant-ph/0309220 | Robust Polynomials and Quantum Algorithms | <|reference_start|>Robust Polynomials and Quantum Algorithms: We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main results are * For eve... | arxiv | @article{buhrman2003robust,
title={Robust Polynomials and Quantum Algorithms},
author={Harry Buhrman (CWI and U of Amsterdam), Ilan Newman (Haifa U), Hein
Roehrig (CWI), and Ronald de Wolf (CWI)},
journal={arXiv preprint arXiv:quant-ph/0309220},
year={2003},
archivePrefix={arXiv},
eprint={quan... | buhrman2003robust |
arxiv-677242 | quant-ph/0310075 | Symmetric Informationally Complete Quantum Measurements | <|reference_start|>Symmetric Informationally Complete Quantum Measurements: We consider the existence in arbitrary finite dimensions d of a POVM comprised of d^2 rank-one operators all of whose operator inner products are equal. Such a set is called a ``symmetric, informationally complete'' POVM (SIC-POVM) and is equiv... | arxiv | @article{renes2003symmetric,
title={Symmetric Informationally Complete Quantum Measurements},
author={Joseph M. Renes, Robin Blume-Kohout, A. J. Scott, and Carlton M. Caves},
journal={J. Math. Phys. 45, 2171 (2004)},
year={2003},
doi={10.1063/1.1737053},
archivePrefix={arXiv},
eprint={quant-... | renes2003symmetric |
arxiv-677243 | quant-ph/0311001 | Quantum walk algorithm for element distinctness | <|reference_start|>Quantum walk algorithm for element distinctness: We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N^{2/3}) query quantum algorithm. This improve... | arxiv | @article{ambainis2003quantum,
title={Quantum walk algorithm for element distinctness},
author={Andris Ambainis},
journal={SIAM Journal on Computing, 37(1):210-239, 2007},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0311001},
primaryClass={quant-ph cs.DS}
} | ambainis2003quantum |
arxiv-677244 | quant-ph/0311039 | Multilinear Formulas and Skepticism of Quantum Computing | <|reference_start|>Multilinear Formulas and Skepticism of Quantum Computing: Several researchers, including Leonid Levin, Gerard 't Hooft, and Stephen Wolfram, have argued that quantum mechanics will break down before the factoring of large numbers becomes possible. If this is true, then there should be a natural set o... | arxiv | @article{aaronson2003multilinear,
title={Multilinear Formulas and Skepticism of Quantum Computing},
author={Scott Aaronson},
journal={arXiv preprint arXiv:quant-ph/0311039},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0311039},
primaryClass={quant-ph cs.CC}
} | aaronson2003multilinear |
arxiv-677245 | quant-ph/0311064 | Multipartite Bound Information exists and can be activated | <|reference_start|>Multipartite Bound Information exists and can be activated: We prove the conjectured existence of Bound Information, a classical analog of bound entanglement, in the multipartite scenario. We give examples of tripartite probability distributions from which it is impossible to extract any kind of secr... | arxiv | @article{acin2003multipartite,
title={Multipartite Bound Information exists and can be activated},
author={A. Acin, J. I. Cirac and Ll. Masanes},
journal={Phys. Rev. Lett. 92, 107903 (2004)},
year={2003},
doi={10.1103/PhysRevLett.92.107903},
archivePrefix={arXiv},
eprint={quant-ph/0311064},
... | acin2003multipartite |
arxiv-677246 | quant-ph/0312003 | An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation | <|reference_start|>An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation: This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number... | arxiv | @article{nishimura2003an,
title={An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on
Advised Quantum Computation},
author={Harumichi Nishimura and Tomoyuki Yamakami},
journal={Proceedings of the 29th International Symposium on Mathematical
Foundations of Computer Science (MFCS2004),... | nishimura2003an |
arxiv-677247 | quant-ph/0312044 | Partiality in physics | <|reference_start|>Partiality in physics: We revisit the standard axioms of domain theory with emphasis on their relation to the concept of partiality, explain how this idea arises naturally in probability theory and quantum mechanics, and then search for a mathematical setting capable of providing a satisfactory unifi... | arxiv | @article{coecke2003partiality,
title={Partiality in physics},
author={Bob Coecke and Keye Martin},
journal={arXiv preprint arXiv:quant-ph/0312044},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0312044},
primaryClass={quant-ph cs.LO math.PR}
} | coecke2003partiality |
arxiv-677248 | quant-ph/0312164 | On optimal quantum codes | <|reference_start|>On optimal quantum codes: We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary prime power. It is shown that codes... | arxiv | @article{grassl2003on,
title={On optimal quantum codes},
author={Markus Grassl (Universitaet Karlsruhe),, Thomas Beth (Universitaet
Karlsruhe), and Martin Roetteler (University of Waterloo)},
journal={International Journal of Quantum Information, Vol. 2, No. 1
(2004), pp. 55-64},
year={2003},
do... | grassl2003on |
arxiv-677249 | quant-ph/0312174 | Quantum Computation, Categorical Semantics and Linear Logic | <|reference_start|>Quantum Computation, Categorical Semantics and Linear Logic: This preprint has been withdrawn.<|reference_end|> | arxiv | @article{van tonder2003quantum,
title={Quantum Computation, Categorical Semantics and Linear Logic},
author={Andr'e van Tonder, Miquel Dorca},
journal={arXiv preprint arXiv:quant-ph/0312174},
year={2003},
archivePrefix={arXiv},
eprint={quant-ph/0312174},
primaryClass={quant-ph cs.LO hep-th}
... | van tonder2003quantum |
arxiv-677250 | quant-ph/0312228 | Remarks on Clifford codes | <|reference_start|>Remarks on Clifford codes: Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which is not already a stabilizer code. We derive a necessary and suffi... | arxiv | @article{klappenecker2003remarks,
title={Remarks on Clifford codes},
author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
(University of Waterloo)},
journal={Proceedings 2004 IEEE International Symposium on Information
Theory (ISIT 2004), Chicago, USA, pp. 354, 2004},
year={2003},
... | klappenecker2003remarks |
arxiv-677251 | quant-ph/0401041 | Quantum Watermarking by Frequency of Error when Observing Qubits in Dissimilar Bases | <|reference_start|>Quantum Watermarking by Frequency of Error when Observing Qubits in Dissimilar Bases: We present a so-called fuzzy watermarking scheme based on the relative frequency of error in observing qubits in a dissimilar basis from the one in which they were written. Then we discuss possible attacks on the sy... | arxiv | @article{worley2004quantum,
title={Quantum Watermarking by Frequency of Error when Observing Qubits in
Dissimilar Bases},
author={G Gordon Worley III},
journal={arXiv preprint arXiv:quant-ph/0401041},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0401041},
primaryClass={quant-ph cs.... | worley2004quantum |
arxiv-677252 | quant-ph/0402014 | The logic of entanglement | <|reference_start|>The logic of entanglement: We expose the information flow capabilities of pure bipartite entanglement as a theorem -- which embodies the exact statement on the `seemingly acausal flow of information' in protocols such as teleportation. We use this theorem to re-design and analyze known protocols (e.g... | arxiv | @article{coecke2004the,
title={The logic of entanglement},
author={Bob Coecke},
journal={arXiv preprint arXiv:quant-ph/0402014},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0402014},
primaryClass={quant-ph cs.LO math-ph math.CT math.MP}
} | coecke2004the |
arxiv-677253 | quant-ph/0402095 | Limitations of Quantum Advice and One-Way Communication | <|reference_start|>Limitations of Quantum Advice and One-Way Communication: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only limi... | arxiv | @article{aaronson2004limitations,
title={Limitations of Quantum Advice and One-Way Communication},
author={Scott Aaronson},
journal={Theory of Computing 1(1):1-28, 2005},
year={2004},
doi={10.4086/toc.2005.v001a001},
archivePrefix={arXiv},
eprint={quant-ph/0402095},
primaryClass={quant-p... | aaronson2004limitations |
arxiv-677254 | quant-ph/0402107 | Coins Make Quantum Walks Faster | <|reference_start|>Coins Make Quantum Walks Faster: We show how to search N items arranged on a $\sqrt{N}\times\sqrt{N}$ grid in time $O(\sqrt N \log N)$, using a discrete time quantum walk. This result for the first time exhibits a significant difference between discrete time and continuous time walks without coin deg... | arxiv | @article{ambainis2004coins,
title={Coins Make Quantum Walks Faster},
author={Andris Ambainis, Julia Kempe and Alexander Rivosh},
journal={Proc. 16th ACM-SIAM SODA, p. 1099-1108 (2005)},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0402107},
primaryClass={quant-ph cs.DS}
} | ambainis2004coins |
arxiv-677255 | quant-ph/0402123 | Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs | <|reference_start|>Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs: A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability will be exp... | arxiv | @article{klauck2004quantum,
title={Quantum and Classical Strong Direct Product Theorems and Optimal
Time-Space Tradeoffs},
author={Hartmut Klauck (U Calgary), Robert Spalek (CWI), Ronald de Wolf (CWI)},
journal={arXiv preprint arXiv:quant-ph/0402123},
year={2004},
archivePrefix={arXiv},
eprint... | klauck2004quantum |
arxiv-677256 | quant-ph/0402130 | A categorical semantics of quantum protocols | <|reference_start|>A categorical semantics of quantum protocols: We study quantum information and computation from a novel point of view. Our approach is based on recasting the standard axiomatic presentation of quantum mechanics, due to von Neumann, at a more abstract level, of compact closed categories with biproduct... | arxiv | @article{abramsky2004a,
title={A categorical semantics of quantum protocols},
author={Samson Abramsky and Bob Coecke},
journal={Proceedings of the 19th IEEE conference on Logic in Computer
Science (LiCS'04). IEEE Computer Science Press (2004)},
year={2004},
archivePrefix={arXiv},
eprint={quant... | abramsky2004a |
arxiv-677257 | quant-ph/0403056 | Quantum Identification of Boolean Oracles | <|reference_start|>Quantum Identification of Boolean Oracles: The oracle identification problem (OIP) is, given a set $S$ of $M$ Boolean oracles out of $2^{N}$ ones, to determine which oracle in $S$ is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to $S... | arxiv | @article{ambainis2004quantum,
title={Quantum Identification of Boolean Oracles},
author={Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda,
Raymond H. Putra and Shigeru Yamashita},
journal={arXiv preprint arXiv:quant-ph/0403056},
year={2004},
archivePrefix={arXiv},
eprint={quant-p... | ambainis2004quantum |
arxiv-677258 | quant-ph/0403069 | Computational Indistinguishability between Quantum States and Its Cryptographic Application | <|reference_start|>Computational Indistinguishability between Quantum States and Its Cryptographic Application: We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time ... | arxiv | @article{kawachi2004computational,
title={Computational Indistinguishability between Quantum States and Its
Cryptographic Application},
author={Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura and Tomoyuki
Yamakami},
journal={Journal of Cryptology 25(3): 528-555 (2012)},
year={2004},
doi={1... | kawachi2004computational |
arxiv-677259 | quant-ph/0403076 | Quantum key distribution using polarized coherent states | <|reference_start|>Quantum key distribution using polarized coherent states: We discuss a continuous variables method of quantum key distribution employing strongly polarized coherent states of light. The key encoding is performed using the variables known as Stokes parameters, rather than the field quadratures. Their ... | arxiv | @article{vidiella-barranco2004quantum,
title={Quantum key distribution using polarized coherent states},
author={A. Vidiella-Barranco and L.F.M. Borelli (Universidade Estadual de
Campinas, Brazil)},
journal={Int. J. Mod. Phys. B., 20, 1287 (2006)},
year={2004},
doi={10.1142/S0217979206033929},
... | vidiella-barranco2004quantum |
arxiv-677260 | quant-ph/0403120 | Quantum walks and their algorithmic applications | <|reference_start|>Quantum walks and their algorithmic applications: Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.<|reference_end|> | arxiv | @article{ambainis2004quantum,
title={Quantum walks and their algorithmic applications},
author={Andris Ambainis},
journal={International Journal of Quantum Information, 1:507-518, 2003.},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0403120},
primaryClass={quant-ph cs.DS}
} | ambainis2004quantum |
arxiv-677261 | quant-ph/0403140 | Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval | <|reference_start|>Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval: We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding n-bit strings over an l-bit alphabet, where the decoder only uses b bits of each queried po... | arxiv | @article{wehner2004improved,
title={Improved Lower Bounds for Locally Decodable Codes and Private
Information Retrieval},
author={Stephanie Wehner (CWI, Amsterdam), Ronald de Wolf (CWI, Amsterdam)},
journal={Proc. of 32nd ICALP, 2005, LNCS 3580, pages 1424-1436.},
year={2004},
doi={10.1007/1152346... | wehner2004improved |
arxiv-677262 | quant-ph/0404060 | A quantum Fourier transform algorithm | <|reference_start|>A quantum Fourier transform algorithm: Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bound... | arxiv | @article{lomont2004a,
title={A quantum Fourier transform algorithm},
author={Chris Lomont},
journal={arXiv preprint arXiv:quant-ph/0404060},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0404060},
primaryClass={quant-ph cs.DS}
} | lomont2004a |
arxiv-677263 | quant-ph/0404075 | Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption | <|reference_start|>Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption: A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a... | arxiv | @article{ambainis2004small,
title={Small Pseudo-Random Families of Matrices: Derandomizing Approximate
Quantum Encryption},
author={Andris Ambainis, Adam Smith},
journal={arXiv preprint arXiv:quant-ph/0404075},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0404075},
primaryClass={qu... | ambainis2004small |
arxiv-677264 | quant-ph/0405089 | Combinatorial Approaches in Quantum Information Theory | <|reference_start|>Combinatorial Approaches in Quantum Information Theory: We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite entanglem... | arxiv | @article{singh2004combinatorial,
title={Combinatorial Approaches in Quantum Information Theory},
author={Sudhir Kumar Singh},
journal={arXiv preprint arXiv:quant-ph/0405089},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0405089},
primaryClass={quant-ph cs.CR math.CO}
} | singh2004combinatorial |
arxiv-677265 | quant-ph/0405101 | No Signalling and Quantum Key Distribution | <|reference_start|>No Signalling and Quantum Key Distribution: Standard quantum key distribution protocols are provably secure against eavesdropping attacks, if quantum theory is correct. It is theoretically interesting to know if we need to assume the validity of quantum theory to prove the security of quantum key dis... | arxiv | @article{barrett2004no,
title={No Signalling and Quantum Key Distribution},
author={Jonathan Barrett (Universite Libre de Bruxelles), Lucien Hardy
(Perimeter Institute) and Adrian Kent (Centre for Quantum Computation, DAMTP,
University of Cambridge)},
journal={Phys. Rev. Lett. 95, 010503 (2005)},
ye... | barrett2004no |
arxiv-677266 | quant-ph/0406046 | The hidden subgroup problem and permutation group theory | <|reference_start|>The hidden subgroup problem and permutation group theory: We employ concepts and tools from the theory of finite permutation groups in order to analyse the Hidden Subgroup Problem via Quantum Fourier Sampling (QFS) for the symmetric group. We show that under very general conditions both the weak and ... | arxiv | @article{kempe2004the,
title={The hidden subgroup problem and permutation group theory},
author={Julia Kempe and Aner Shalev},
journal={Proc. 16th ACM-SIAM SODA, p. 1118-1125 (2005)},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0406046},
primaryClass={quant-ph cs.CC}
} | kempe2004the |
arxiv-677267 | quant-ph/0406119 | On Quantum Cellular Automata | <|reference_start|>On Quantum Cellular Automata: In recent work [quant-ph/0405174] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about qua... | arxiv | @article{vlasov2004on,
title={On Quantum Cellular Automata},
author={Alexander Yu. Vlasov},
journal={arXiv preprint arXiv:quant-ph/0406119},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0406119},
primaryClass={quant-ph cs.OH nlin.CG}
} | vlasov2004on |
arxiv-677268 | quant-ph/0406135 | A combinatorial approach for studying LOCC transformations of multipartite states | <|reference_start|>A combinatorial approach for studying LOCC transformations of multipartite states: We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity fea... | arxiv | @article{singh2004a,
title={A combinatorial approach for studying LOCC transformations of
multipartite states},
author={Sudhir Kumar Singh, Sudebkumar Prasant Pal, Somesh Kumar, R. Srikanth},
journal={arXiv preprint arXiv:quant-ph/0406135},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/... | singh2004a |
arxiv-677269 | quant-ph/0406137 | A possible hypercomputational quantum algorithm | <|reference_start|>A possible hypercomputational quantum algorithm: The term `hypermachine' denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We present a possible quantum algorithm for a classically non-computable dec... | arxiv | @article{sicard2004a,
title={A possible hypercomputational quantum algorithm},
author={Andr'es Sicard, Mario V'elez, Juan Ospina},
journal={In E. J. Donkor, A. R. Pirich, and H. E. Brandt, editors, "Quantum
Information and Computation III", volume 5815 of Proc. of SPIE. SPIE,
Bellingham, WA, 2005. p. 21... | sicard2004a |
arxiv-677270 | quant-ph/0406180 | The Complexity of the Local Hamiltonian Problem | <|reference_start|>The Complexity of the Local Hamiltonian Problem: The k-local Hamiltonian problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NP-complete for k<=2. It was known that the problem is QMA-complete for any k <= 3. On ... | arxiv | @article{kempe2004the,
title={The Complexity of the Local Hamiltonian Problem},
author={Julia Kempe, Alexei Kitaev and Oded Regev},
journal={SIAM Journal of Computing, Vol. 35(5), p. 1070-1097 (2006),
conference version in Proc. 24th FSTTCS, p. 372-383 (2004)},
year={2004},
archivePrefix={arXiv},
... | kempe2004the |
arxiv-677271 | quant-ph/0406196 | Improved Simulation of Stabilizer Circuits | <|reference_start|>Improved Simulation of Stabilizer Circuits: The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. Fi... | arxiv | @article{aaronson2004improved,
title={Improved Simulation of Stabilizer Circuits},
author={Scott Aaronson and Daniel Gottesman},
journal={Phys. Rev. A 70, 052328 (2004) (14 pages)},
year={2004},
doi={10.1103/PhysRevA.70.052328},
archivePrefix={arXiv},
eprint={quant-ph/0406196},
primaryCl... | aaronson2004improved |
arxiv-677272 | quant-ph/0406211 | Numerical simulations of mixed states quantum computation | <|reference_start|>Numerical simulations of mixed states quantum computation: We describe quantum-octave package of functions useful for simulations of quantum algorithms and protocols. Presented package allows to perform simulations with mixed states. We present numerical implementation of important quantum mechanical... | arxiv | @article{gawron2004numerical,
title={Numerical simulations of mixed states quantum computation},
author={P. Gawron, J. A. Miszczak},
journal={Int. J. Quant. Inf, Vol. 3, No. 1 (March 2005)},
year={2004},
doi={10.1142/S0219749905000748},
archivePrefix={arXiv},
eprint={quant-ph/0406211},
p... | gawron2004numerical |
arxiv-677273 | quant-ph/0407005 | A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics | <|reference_start|>A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics: Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperat... | arxiv | @article{lalire2004a,
title={A Process Algebraic Approach to Concurrent and Distributed Quantum
Computation: Operational Semantics},
author={Marie Lalire, Philippe Jorrand},
journal={arXiv preprint arXiv:quant-ph/0407005},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0407005},
prim... | lalire2004a |
arxiv-677274 | quant-ph/0407008 | Classically-Controlled Quantum Computation | <|reference_start|>Classically-Controlled Quantum Computation: Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM) with a quantum tape for acting on quantum data, and a classical transition f... | arxiv | @article{perdrix2004classically-controlled,
title={Classically-Controlled Quantum Computation},
author={Simon Perdrix, Philippe Jorrand},
journal={Math. Struct. in Comp. Science, 16:601-620, 2006},
year={2004},
doi={10.1017/S096012950600538X},
archivePrefix={arXiv},
eprint={quant-ph/0407008}... | perdrix2004classically-controlled |
arxiv-677275 | quant-ph/0407023 | An extension of Chaitin's halting probability \Omega to a measurement operator in an infinite dimensional quantum system | <|reference_start|>An extension of Chaitin's halting probability \Omega to a measurement operator in an infinite dimensional quantum system: This paper proposes an extension of Chaitin's halting probability \Omega to a measurement operator in an infinite dimensional quantum system. Chaitin's \Omega is defined as the pr... | arxiv | @article{tadaki2004an,
title={An extension of Chaitin's halting probability \Omega to a measurement
operator in an infinite dimensional quantum system},
author={Kohtaro Tadaki},
journal={Mathematical Logic Quarterly, Vol.52, 419-438 (2006)},
year={2004},
doi={10.1002/malq.200410061},
archivePr... | tadaki2004an |
arxiv-677276 | quant-ph/0407054 | Implementation of group-covariant POVMs by orthogonal measurements | <|reference_start|>Implementation of group-covariant POVMs by orthogonal measurements: We consider group-covariant positive operator valued measures (POVMs) on a finite dimensional quantum system. Following Neumark's theorem a POVM can be implemented by an orthogonal measurement on a larger system. Accordingly, our goa... | arxiv | @article{decker2004implementation,
title={Implementation of group-covariant POVMs by orthogonal measurements},
author={Thomas Decker, Dominik Janzing, Martin Roetteler},
journal={Journal of Mathematical Physics, 46:012104, 2005},
year={2004},
doi={10.1063/1.1827924},
archivePrefix={arXiv},
e... | decker2004implementation |
arxiv-677277 | quant-ph/0407200 | Assisted Quantum Secret Sharing | <|reference_start|>Assisted Quantum Secret Sharing: A restriction on quantum secret sharing (QSS) that comes from the no-cloning theorem is that any pair of authorized sets in an access structure should overlap. From the viewpoint of application, this places an unnatural constraint on secret sharing. We present a gener... | arxiv | @article{singh2004assisted,
title={Assisted Quantum Secret Sharing},
author={Sudhir Kumar Singh, R. Srikanth},
journal={arXiv preprint arXiv:quant-ph/0407200},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0407200},
primaryClass={quant-ph cs.CR math.CO}
} | singh2004assisted |
arxiv-677278 | quant-ph/0408068 | Logical Interpretation of a Reversible Measurement in Quantum Computing | <|reference_start|>Logical Interpretation of a Reversible Measurement in Quantum Computing: We give the logical description of a new kind of quantum measurement that is a reversible operation performed by an hypothetical insider observer, or, which is the same, a quantum measurement made in a quantum space background, ... | arxiv | @article{battilotti2004logical,
title={Logical Interpretation of a Reversible Measurement in Quantum Computing},
author={Giulia Battilotti and Paola Zizzi},
journal={arXiv preprint arXiv:quant-ph/0408068},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0408068},
primaryClass={quant-ph ... | battilotti2004logical |
arxiv-677279 | quant-ph/0408078 | Efficient Decoupling Schemes Based on Hamilton Cycles | <|reference_start|>Efficient Decoupling Schemes Based on Hamilton Cycles: Decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian is a well-studied problem. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed which use selective pu... | arxiv | @article{roetteler2004efficient,
title={Efficient Decoupling Schemes Based on Hamilton Cycles},
author={Martin Roetteler},
journal={Journal of Mathematical Physics, 49:042106, 2008},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0408078},
primaryClass={quant-ph cs.ET}
} | roetteler2004efficient |
arxiv-677280 | quant-ph/0408108 | Statistically Secure Quantum Oblivious Transfer | <|reference_start|>Statistically Secure Quantum Oblivious Transfer: This paper has been withdrawn.<|reference_end|> | arxiv | @article{chen2004statistically,
title={Statistically Secure Quantum Oblivious Transfer},
author={Zhide Chen, Tianming Bu, Hong Zhu},
journal={arXiv preprint arXiv:quant-ph/0408108},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0408108},
primaryClass={quant-ph cs.CR}
} | chen2004statistically |
arxiv-677281 | quant-ph/0409029 | Why Classical Certification is Impossible in a Quantum World | <|reference_start|>Why Classical Certification is Impossible in a Quantum World: We give a simple proof that it is impossible to guarantee the classicality of inputs into any mistrustful quantum cryptographic protocol. The argument illuminates the impossibility of unconditionally secure quantum implementations of essen... | arxiv | @article{kent2004why,
title={Why Classical Certification is Impossible in a Quantum World},
author={Adrian Kent (Centre for Quantum Information and Foundations, DAMTP,
University of Cambridge and Perimeter Institute)},
journal={Quantum Information Processing, 11 (2), 493-499 (2012)},
year={2004},
... | kent2004why |
arxiv-677282 | quant-ph/0409125 | Simulatable security for quantum protocols | <|reference_start|>Simulatable security for quantum protocols: The notion of simulatable security (reactive simulatability, universal composability) is a powerful tool for allowing the modular design of cryptographic protocols (composition of protocols) and showing the security of a given protocol embedded in a larger ... | arxiv | @article{unruh2004simulatable,
title={Simulatable security for quantum protocols},
author={Dominique Unruh},
journal={arXiv preprint arXiv:quant-ph/0409125},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0409125},
primaryClass={quant-ph cs.CR}
} | unruh2004simulatable |
arxiv-677283 | quant-ph/0409135 | Equivalence of Decoupling Schemes and Orthogonal Arrays | <|reference_start|>Equivalence of Decoupling Schemes and Orthogonal Arrays: We consider the problem of switching off unwanted interactions in a given multi-partite Hamiltonian. This is known to be an important primitive in quantum information processing and several schemes have been presented in the literature to achie... | arxiv | @article{roetteler2004equivalence,
title={Equivalence of Decoupling Schemes and Orthogonal Arrays},
author={Martin Roetteler, Pawel Wocjan},
journal={IEEE Transactions on Information Theory 52(9): 4171-4181 (2006)},
year={2004},
doi={10.1109/TIT.2006.880059},
archivePrefix={arXiv},
eprint={q... | roetteler2004equivalence |
arxiv-677284 | quant-ph/0409201 | Quantum Anonymous Transmissions | <|reference_start|>Quantum Anonymous Transmissions: We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for sending and receiving classical bits anonymously, which is completely traceless: it suc... | arxiv | @article{christandl2004quantum,
title={Quantum Anonymous Transmissions},
author={Matthias Christandl (CQC Cambridge), Stephanie Wehner (CWI, Amsterdam)},
journal={Proc. of 11th ASIACRYPT, 2005, LNCS 3788, pages 217-235.},
year={2004},
doi={10.1007/11593447_12},
archivePrefix={arXiv},
eprint=... | christandl2004quantum |
arxiv-677285 | quant-ph/0410017 | Quantum seals | <|reference_start|>Quantum seals: A quantum seal is a way of encoding a message into quantum states, so that anybody may read the message with little error, while authorized verifiers can detect that the seal has been broken. We present a simple extension to the Bechmann-Pasquinucci majority-voting scheme that is imper... | arxiv | @article{singh2004quantum,
title={Quantum seals},
author={Sudhir Kumar Singh, R. Srikanth},
journal={Physica Scripta, 71, 433 (2005)},
year={2004},
doi={10.1238/Physica.Regular.071a00433},
number={SinSrik2004QI03QSeals},
archivePrefix={arXiv},
eprint={quant-ph/0410017},
primaryClass=... | singh2004quantum |
arxiv-677286 | quant-ph/0410040 | An Application of Quantum Finite Automata to Interactive Proof Systems | <|reference_start|>An Application of Quantum Finite Automata to Interactive Proof Systems: Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space. This paper seeks their direct application to inte... | arxiv | @article{nishimura2004an,
title={An Application of Quantum Finite Automata to Interactive Proof Systems},
author={Harumichi Nishimura and Tomoyuki Yamakami},
journal={Journal of Computer and System Sciences, Vol.75, pp.255-269, 2009},
year={2004},
doi={10.1016/j.jcss.2008.12.001},
archivePrefix=... | nishimura2004an |
arxiv-677287 | quant-ph/0411051 | Quantum Communication Cannot Simulate a Public Coin | <|reference_start|>Quantum Communication Cannot Simulate a Public Coin: We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large class of efficient classical public-coin protocols can be turned into e... | arxiv | @article{gavinsky2004quantum,
title={Quantum Communication Cannot Simulate a Public Coin},
author={Dmytro Gavinsky (U Calgary), Julia Kempe (LRI Paris), Ronald de Wolf
(CWI Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/0411051},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/041105... | gavinsky2004quantum |
arxiv-677288 | quant-ph/0411140 | Improved Bounds on Quantum Learning Algorithms | <|reference_start|>Improved Bounds on Quantum Learning Algorithms: In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al. conjectured that for any class C of Boolean functions, the number of quantum black-box ... | arxiv | @article{atici2004improved,
title={Improved Bounds on Quantum Learning Algorithms},
author={Alp Atici, Rocco A. Servedio},
journal={Quantum Information Processing, Vol. 4, No. 5, 355 - 386 (2005)},
year={2004},
doi={10.1007/s11128-005-0001-2},
archivePrefix={arXiv},
eprint={quant-ph/0411140}... | atici2004improved |
arxiv-677289 | quant-ph/0412033 | Efficient Quantum Algorithms for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups | <|reference_start|>Efficient Quantum Algorithms for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups: In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups $\mathbb{Z}_{p^r}\rtimes\mathbb{Z}_q$, for p and q prime. We first present a classificatio... | arxiv | @article{inui2004efficient,
title={Efficient Quantum Algorithms for the Hidden Subgroup Problem over a
Class of Semi-direct Product Groups},
author={Yoshifumi Inui and Francois Le Gall},
journal={Quantum Information and Computation, Vol. 7, No. 5&6 (2007),
559-570},
year={2004},
doi={10.26421/QI... | inui2004efficient |
arxiv-677290 | quant-ph/0412088 | Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds | <|reference_start|>Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds: We derive lower bounds for tradeoffs between the communication C and space S for communicating circuits. The first such bound applies to quantum circuits. If for any function f with image Z the multicolor discrepancy of the co... | arxiv | @article{klauck2004quantum,
title={Quantum and Classical Communication-Space Tradeoffs from Rectangle
Bounds},
author={Hartmut Klauck},
journal={arXiv preprint arXiv:quant-ph/0412088},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0412088},
primaryClass={quant-ph cs.CC}
} | klauck2004quantum |
arxiv-677291 | quant-ph/0412143 | Limits on Efficient Computation in the Physical World | <|reference_start|>Limits on Efficient Computation in the Physical World: More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in... | arxiv | @article{aaronson2004limits,
title={Limits on Efficient Computation in the Physical World},
author={Scott Aaronson},
journal={arXiv preprint arXiv:quant-ph/0412143},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0412143},
primaryClass={quant-ph cs.CC}
} | aaronson2004limits |
arxiv-677292 | quant-ph/0412187 | Quantum Computing, Postselection, and Probabilistic Polynomial-Time | <|reference_start|>Quantum Computing, Postselection, and Probabilistic Polynomial-Time: I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabili... | arxiv | @article{aaronson2004quantum,
title={Quantum Computing, Postselection, and Probabilistic Polynomial-Time},
author={Scott Aaronson},
journal={arXiv preprint arXiv:quant-ph/0412187},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0412187},
primaryClass={quant-ph cs.CC}
} | aaronson2004quantum |
arxiv-677293 | quant-ph/0412199 | The internal logic of Bell's states | <|reference_start|>The internal logic of Bell's states: We investigate the internal logic of a quantum computer with two qubits, in the two particular cases of non-entanglement (separable states) and maximal entanglement (Bell's states). To this aim, we consider an internal (reversible) measurement which preserves the ... | arxiv | @article{battilotti2004the,
title={The internal logic of Bell's states},
author={Giulia Battilotti and Paola Zizzi},
journal={arXiv preprint arXiv:quant-ph/0412199},
year={2004},
archivePrefix={arXiv},
eprint={quant-ph/0412199},
primaryClass={quant-ph cs.LO gr-qc hep-th math.LO}
} | battilotti2004the |
arxiv-677294 | quant-ph/0501056 | The Symmetric Group Defies Strong Fourier Sampling: Part I | <|reference_start|>The Symmetric Group Defies Strong Fourier Sampling: Part I: We resolve the question of whether Fourier sampling can efficiently solve the hidden subgroup problem. Specifically, we show that the hidden subgroup problem over the symmetric group cannot be efficiently solved by strong Fourier sampling, e... | arxiv | @article{moore2005the,
title={The Symmetric Group Defies Strong Fourier Sampling: Part I},
author={Cristopher Moore, Alexander Russell, and Leonard J. Schulman},
journal={arXiv preprint arXiv:quant-ph/0501056},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0501056},
primaryClass={quan... | moore2005the |
arxiv-677295 | quant-ph/0501060 | A quantum lower bound for the query complexity of Simon's problem | <|reference_start|>A quantum lower bound for the query complexity of Simon's problem: Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We study Simon's p... | arxiv | @article{koiran2005a,
title={A quantum lower bound for the query complexity of Simon's problem},
author={Pascal Koiran, Vincent Nesme, Natacha Portier},
journal={arXiv preprint arXiv:quant-ph/0501060},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0501060},
primaryClass={quant-ph cs.C... | koiran2005a |
arxiv-677296 | quant-ph/0501066 | The Symmetric Group Defies Strong Fourier Sampling: Part II | <|reference_start|>The Symmetric Group Defies Strong Fourier Sampling: Part II: Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by strong Fourier sampling, even if one may perform an arbitrary P... | arxiv | @article{moore2005the,
title={The Symmetric Group Defies Strong Fourier Sampling: Part II},
author={Cristopher Moore and Alexander Russell},
journal={arXiv preprint arXiv:quant-ph/0501066},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0501066},
primaryClass={quant-ph cs.CC}
} | moore2005the |
arxiv-677297 | quant-ph/0501099 | Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes | <|reference_start|>Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes: Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum convolutional codes are constructed from classical self-orthogonal $\F_4$-linear and $\F_2$-linear convolutional codes, respectively. These quantum c... | arxiv | @article{forney,2005simple,
title={Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting
Codes},
author={G. David Forney, Jr. and Saikat Guha},
journal={arXiv preprint arXiv:quant-ph/0501099},
year={2005},
doi={10.1109/ISIT.2005.1523495},
archivePrefix={arXiv},
eprint={qua... | forney,2005simple |
arxiv-677298 | quant-ph/0501126 | Primitive Quantum BCH Codes over Finite Fields | <|reference_start|>Primitive Quantum BCH Codes over Finite Fields: An attractive feature of BCH codes is that one can infer valuable information from their design parameters (length, size of the finite field, and designed distance), such as bounds on the minimum distance and dimension of the code. In this paper, it is ... | arxiv | @article{aly2005primitive,
title={Primitive Quantum BCH Codes over Finite Fields},
author={Salah Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli (Texas A&M
University)},
journal={arXiv preprint arXiv:quant-ph/0501126},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0501126},
prim... | aly2005primitive |
arxiv-677299 | quant-ph/0501151 | Structuring quantum effects: superoperators as arrows | <|reference_start|>Structuring quantum effects: superoperators as arrows: We show that the model of quantum computation based on density matrices and superoperators can be decomposed in a pure classical (functional) part and an effectful part modeling probabilities and measurement. The effectful part can be modeled usi... | arxiv | @article{vizzotto2005structuring,
title={Structuring quantum effects: superoperators as arrows},
author={J. K. Vizzotto, T. Altenkirch and A. Sabry},
journal={arXiv preprint arXiv:quant-ph/0501151},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0501151},
primaryClass={quant-ph cs.PL}
... | vizzotto2005structuring |
arxiv-677300 | quant-ph/0501152 | A generalized skew information and uncertainty relation | <|reference_start|>A generalized skew information and uncertainty relation: A generalized skew information is defined and a generalized uncertainty relation is established with the help of a trace inequality which was recently proven by J.I.Fujii. In addition, we prove the trace inequality conjectured by S.Luo and Z.Zh... | arxiv | @article{yanagi2005a,
title={A generalized skew information and uncertainty relation},
author={Kenjiro Yanagi, Shigeru Furuichi and Ken Kuriyama},
journal={IEEE Trans. on Information Theory,Vol.51(2005),pp.4401-4404},
year={2005},
doi={10.1103/PhysRevA.72.022302},
archivePrefix={arXiv},
epri... | yanagi2005a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.