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-677301 | quant-ph/0502009 | Quantum Information Theoretical Analysis of Various Constructions for Quantum Secret Sharing | <|reference_start|>Quantum Information Theoretical Analysis of Various Constructions for Quantum Secret Sharing: Recently, an information theoretical model for Quantum Secret Sharing (QSS) schemes was introduced. By using this model, we prove that pure state Quantum Threshold Schemes (QTS) can be constructed from quant... | arxiv | @article{rietjens2005quantum,
title={Quantum Information Theoretical Analysis of Various Constructions for
Quantum Secret Sharing},
author={Karin Rietjens, Berry Schoenmakers, Pim Tuyls},
journal={arXiv preprint arXiv:quant-ph/0502009},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0502... | rietjens2005quantum |
arxiv-677302 | quant-ph/0502031 | Mutually Unbiased Bases are Complex Projective 2-Designs | <|reference_start|>Mutually Unbiased Bases are Complex Projective 2-Designs: Mutually unbiased bases (MUBs) are a primitive used in quantum information processing to capture the principle of complementarity. While constructions of maximal sets of d+1 such bases are known for systems of prime power dimension d, it is un... | arxiv | @article{klappenecker2005mutually,
title={Mutually Unbiased Bases are Complex Projective 2-Designs},
author={Andreas Klappenecker (Texas A&M University) and Martin Roetteler (NEC
Laboratories America, Inc.)},
journal={Proceedings 2005 IEEE International Symposium on Information
Theory (ISIT 2005), Adela... | klappenecker2005mutually |
arxiv-677303 | quant-ph/0502072 | NP-complete Problems and Physical Reality | <|reference_start|>NP-complete Problems and Physical Reality: Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, relativ... | arxiv | @article{aaronson2005np-complete,
title={NP-complete Problems and Physical Reality},
author={Scott Aaronson},
journal={ACM SIGACT News, March 2005},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0502072},
primaryClass={quant-ph cs.CC gr-qc}
} | aaronson2005np-complete |
arxiv-677304 | quant-ph/0502101 | Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors | <|reference_start|>Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors: We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46--52 (2001)] under an error model where photon detectors have efficiency <100% but all ... | arxiv | @article{silva2005thresholds,
title={Thresholds for Linear Optics Quantum Computing with Photon Loss at the
Detectors},
author={Marcus Silva, Martin Roetteler, Christof Zalka},
journal={Phys. Rev. A 72, 032307 (2005)},
year={2005},
doi={10.1103/PhysRevA.72.032307},
archivePrefix={arXiv},
e... | silva2005thresholds |
arxiv-677305 | quant-ph/0502138 | New Tales of the Mean King | <|reference_start|>New Tales of the Mean King: The Mean King's problem asks to determine the outcome of a measurement that is randomly selected from a set of complementary observables. We review this problem and offer a combinatorial solution. More generally, we show that whenever an affine resolvable design exists, th... | arxiv | @article{klappenecker2005new,
title={New Tales of the Mean King},
author={Andreas Klappenecker (Texas A&M University) and Martin Roetteler (NEC
Laboratories America, Inc.)},
journal={arXiv preprint arXiv:quant-ph/0502138},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0502138},
prim... | klappenecker2005new |
arxiv-677306 | quant-ph/0502185 | Quantum Implementation of Parrondo's Paradox | <|reference_start|>Quantum Implementation of Parrondo's Paradox: We propose a quantum implementation of a capital-dependent Parrondo's paradox that uses $O(\log_2(n))$ qubits, where $n$ is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.<|re... | arxiv | @article{miszczak2005quantum,
title={Quantum Implementation of Parrondo's Paradox},
author={J. A. Miszczak, P. Gawron},
journal={Fluctuation and Noise Letters, Vol. 5, No. 4 (2005)},
year={2005},
doi={10.1142/S0219477505002902},
archivePrefix={arXiv},
eprint={quant-ph/0502185},
primaryCl... | miszczak2005quantum |
arxiv-677307 | quant-ph/0503027 | A Three-Stage Quantum Cryptography Protocol | <|reference_start|>A Three-Stage Quantum Cryptography Protocol: We present a three-stage quantum cryptographic protocol guaranteeing security in which each party uses its own secret key. Unlike the BB84 protocol, where the qubits are transmitted in only one direction and classical information exchanged thereafter, the ... | arxiv | @article{kak2005a,
title={A Three-Stage Quantum Cryptography Protocol},
author={Subhash Kak},
journal={Foundations of Physics Letters 19 (2006), 293-296.},
year={2005},
doi={10.1007/s10702-006-0520-9},
archivePrefix={arXiv},
eprint={quant-ph/0503027},
primaryClass={quant-ph cs.CR}
} | kak2005a |
arxiv-677308 | quant-ph/0503114 | On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group | <|reference_start|>On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group: The hidden subgroup problem (HSP) provides a unified framework to study problems of group-theoretical nature in quantum computing such as order finding and the discrete logarithm problem. While it is kn... | arxiv | @article{radhakrishnan2005on,
title={On the Power of Random Bases in Fourier Sampling: Hidden Subgroup
Problem in the Heisenberg Group},
author={Jaikumar Radhakrishnan, Martin Roetteler, and Pranab Sen},
journal={Proceedings 32nd International Conference on Automata, Languages,
and Programming (ICALP 20... | radhakrishnan2005on |
arxiv-677309 | quant-ph/0503139 | Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes | <|reference_start|>Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes: It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound onl... | arxiv | @article{crepeau2005approximate,
title={Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes},
author={Claude Crepeau and Daniel Gottesman and Adam Smith},
journal={Preliminary version in proceedings of "Advances in Cryptology --
EUROCRYPT 2005"},
year={2005},
archivePrefix={arXiv... | crepeau2005approximate |
arxiv-677310 | quant-ph/0503157 | Secure Communication Using Qubits | <|reference_start|>Secure Communication Using Qubits: A two-layer quantum protocol for secure transmission of data using qubits is presented. The protocol is an improvement over the BB84 QKD protocol. BB84, in conjunction with the one-time pad algorithm, has been shown to be unconditionally secure. However it suffers f... | arxiv | @article{hosseini-khayat2005secure,
title={Secure Communication Using Qubits},
author={Saied Hosseini-Khayat, Iman Marvian},
journal={The Sixth IEEE International Conference on Computer and
Information Technology, 2006. Seoul, South Korea},
year={2005},
doi={10.1109/CIT.2006.164},
archivePrefi... | hosseini-khayat2005secure |
arxiv-677311 | quant-ph/0503230 | Programmable Quantum Networks with Pure States | <|reference_start|>Programmable Quantum Networks with Pure States: Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i.e., a part of the memory is used for the program and a part for the data. It is likely, that analogues of such architecture are also desirable for the f... | arxiv | @article{vlasov2005programmable,
title={Programmable Quantum Networks with Pure States},
author={Alexander Yu. Vlasov},
journal={arXiv preprint arXiv:quant-ph/0503230},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0503230},
primaryClass={quant-ph cs.OH}
} | vlasov2005programmable |
arxiv-677312 | quant-ph/0503236 | On Self-Dual Quantum Codes, Graphs, and Boolean Functions | <|reference_start|>On Self-Dual Quantum Codes, Graphs, and Boolean Functions: A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes w... | arxiv | @article{danielsen2005on,
title={On Self-Dual Quantum Codes, Graphs, and Boolean Functions},
author={Lars Eirik Danielsen (University of Bergen)},
journal={arXiv preprint arXiv:quant-ph/0503236},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0503236},
primaryClass={quant-ph cs.IT math... | danielsen2005on |
arxiv-677313 | quant-ph/0503238 | Optimization of Partial Search | <|reference_start|>Optimization of Partial Search: Quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. A partial search algorit... | arxiv | @article{korepin2005optimization,
title={Optimization of Partial Search},
author={Vladimir Korepin},
journal={Journal of Physics A: Math. Gen. vol 38, pages L731-L738, 2005},
year={2005},
doi={10.1088/0305-4470/38/44/L02},
number={YITP-SB-05-08},
archivePrefix={arXiv},
eprint={quant-ph/0... | korepin2005optimization |
arxiv-677314 | quant-ph/0503239 | On Approximately Symmetric Informationally Complete Positive Operator-Valued Measures and Related Systems of Quantum States | <|reference_start|>On Approximately Symmetric Informationally Complete Positive Operator-Valued Measures and Related Systems of Quantum States: We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension $n$ consisting of $n^2$ operators of rank one which have an inner product c... | arxiv | @article{klappenecker2005on,
title={On Approximately Symmetric Informationally Complete Positive
Operator-Valued Measures and Related Systems of Quantum States},
author={Andreas Klappenecker, Martin Roetteler, Igor Shparlinski, Arne
Winterhof},
journal={Journal of Mathematical Physics, 46:082104, 2005},... | klappenecker2005on |
arxiv-677315 | quant-ph/0504007 | Probabilistic Model--Checking of Quantum Protocols | <|reference_start|>Probabilistic Model--Checking of Quantum Protocols: We establish fundamental and general techniques for formal verification of quantum protocols. Quantum protocols are novel communication schemes involving the use of quantum-mechanical phenomena for representation, storage and transmission of data. A... | arxiv | @article{gay2005probabilistic,
title={Probabilistic Model--Checking of Quantum Protocols},
author={Simon Gay, Rajagopal Nagarajan, Nikolaos Papanikolaou},
journal={arXiv preprint arXiv:quant-ph/0504007},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0504007},
primaryClass={quant-ph cs... | gay2005probabilistic |
arxiv-677316 | quant-ph/0504012 | Quantum search algorithms | <|reference_start|>Quantum search algorithms: We review some of quantum algorithms for search problems: Grover's search algorithm, its generalization to amplitude amplification, the applications of amplitude amplification to various problems and the recent quantum algorithms based on quantum walks.<|reference_end|> | arxiv | @article{ambainis2005quantum,
title={Quantum search algorithms},
author={Andris Ambainis},
journal={SIGACT News, 35 (2):22-35, 2004.},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0504012},
primaryClass={quant-ph cs.CC cs.DS}
} | ambainis2005quantum |
arxiv-677317 | quant-ph/0504021 | Numerical Simulations of a Possible Hypercomputational Quantum Algorithm | <|reference_start|>Numerical Simulations of a Possible Hypercomputational Quantum Algorithm: The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorit... | arxiv | @article{sicard2005numerical,
title={Numerical Simulations of a Possible Hypercomputational Quantum Algorithm},
author={Andr'es Sicard, Juan Ospina, Mario V'elez},
journal={In "Adaptive and Natural Computing Algorithms. Proc. of the
International Conference in Coimbra, Portugal". Bernardete Ribeiro et al.... | sicard2005numerical |
arxiv-677318 | quant-ph/0504207 | Applications of quantum message sealing | <|reference_start|>Applications of quantum message sealing: In 2003, Bechmann-Pasquinucci introduced the concept of quantum seals, a quantum analogue to wax seals used to close letters and envelopes. Since then, some improvements on the method have been found. We first review the current quantum sealing techniques, the... | arxiv | @article{worley2005applications,
title={Applications of quantum message sealing},
author={G Gordon Worley III},
journal={arXiv preprint arXiv:quant-ph/0504207},
year={2005},
doi={10.1117/12.598260},
archivePrefix={arXiv},
eprint={quant-ph/0504207},
primaryClass={quant-ph cs.CR}
} | worley2005applications |
arxiv-677319 | quant-ph/0505088 | A Note on Shared Randomness and Shared Entanglement in Communication | <|reference_start|>A Note on Shared Randomness and Shared Entanglement in Communication: We consider several models of 1-round classical and quantum communication, some of these models have not been defined before. We "almost separate" the models of simultaneous quantum message passing with shared entanglement and the ... | arxiv | @article{gavinsky2005a,
title={A Note on Shared Randomness and Shared Entanglement in Communication},
author={Dmytro Gavinsky (U Calgary)},
journal={arXiv preprint arXiv:quant-ph/0505088},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0505088},
primaryClass={quant-ph cs.CC}
} | gavinsky2005a |
arxiv-677320 | quant-ph/0505089 | Quantum key distribution with trusted quantum relay | <|reference_start|>Quantum key distribution with trusted quantum relay: A trusted quantum relay is introduced to enable quantum key distribution links to form the basic legs in a quantum key distribution network. The idea is based on the well-known intercept/resend eavesdropping. The same scheme can be used to make qua... | arxiv | @article{bechmann-pasquinucci2005quantum,
title={Quantum key distribution with trusted quantum relay},
author={H. Bechmann-Pasquinucci and A. Pasquinucci},
journal={arXiv preprint arXiv:quant-ph/0505089},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0505089},
primaryClass={quant-ph c... | bechmann-pasquinucci2005quantum |
arxiv-677321 | quant-ph/0505188 | Lower Bounds on Matrix Rigidity via a Quantum Argument | <|reference_start|>Lower Bounds on Matrix Rigidity via a Quantum Argument: The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as for ... | arxiv | @article{de wolf2005lower,
title={Lower Bounds on Matrix Rigidity via a Quantum Argument},
author={Ronald de Wolf (CWI Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/0505188},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0505188},
primaryClass={quant-ph cs.CC}
} | de wolf2005lower |
arxiv-677322 | quant-ph/0506080 | Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem | <|reference_start|>Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem: In classical information theory, entropy rate and Kolmogorov complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two noti... | arxiv | @article{benatti2005entropy,
title={Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem},
author={Fabio Benatti, Tyll Krueger, Markus Mueller, Rainer Siegmund-Schultze,
Arleta Szkola},
journal={Communications in Mathematical Physics, Vol. 265, No.2 / July
2006, 437-461},
year={2005... | benatti2005entropy |
arxiv-677323 | quant-ph/0506200 | Solving Satisfiability Problems by the Ground-State Quantum Computer | <|reference_start|>Solving Satisfiability Problems by the Ground-State Quantum Computer: A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cos... | arxiv | @article{mao2005solving,
title={Solving Satisfiability Problems by the Ground-State Quantum Computer},
author={Wenjin Mao},
journal={Phys. Rev. A 72, 052316 (2005)},
year={2005},
doi={10.1103/PhysRevA.72.052316},
archivePrefix={arXiv},
eprint={quant-ph/0506200},
primaryClass={quant-ph co... | mao2005solving |
arxiv-677324 | quant-ph/0506265 | Quantum Complexity of Testing Group Commutativity | <|reference_start|>Quantum Complexity of Testing Group Commutativity: We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We c... | arxiv | @article{magniez2005quantum,
title={Quantum Complexity of Testing Group Commutativity},
author={Frederic Magniez (CNRS-LRI) and Ashwin Nayak (U. Waterloo and
Perimeter Inst.)},
journal={arXiv preprint arXiv:quant-ph/0506265},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0506265},
p... | magniez2005quantum |
arxiv-677325 | quant-ph/0507155 | Theoretical Setting of Inner Reversible Quantum Measurements | <|reference_start|>Theoretical Setting of Inner Reversible Quantum Measurements: We show that any unitary transformation performed on the quantum state of a closed quantum system, describes an inner, reversible, generalized quantum measurement. We also show that under some specific conditions it is possible to perform ... | arxiv | @article{zizzi2005theoretical,
title={Theoretical Setting of Inner Reversible Quantum Measurements},
author={Paola Zizzi},
journal={Mod. Phys. Lett. A, Vol.21, No. 36 (2006) pp. 2717-2727},
year={2005},
doi={10.1142/S0217732306021827},
archivePrefix={arXiv},
eprint={quant-ph/0507155},
pr... | zizzi2005theoretical |
arxiv-677326 | quant-ph/0507231 | Algebras of Measurements: the logical structure of Quantum Mechanics | <|reference_start|>Algebras of Measurements: the logical structure of Quantum Mechanics: In Quantum Physics, a measurement is represented by a projection on some closed subspace of a Hilbert space. We study algebras of operators that abstract from the algebra of projections on closed subspaces of a Hilbert space. The p... | arxiv | @article{lehmann2005algebras,
title={Algebras of Measurements: the logical structure of Quantum Mechanics},
author={Daniel Lehmann, Kurt Engesser and Dov M. Gabbay},
journal={International Journal of Theoretical Physics, 45(4) April 2006,
pages 698-723},
year={2005},
doi={10.1007/s10773-006-9062-y... | lehmann2005algebras |
arxiv-677327 | quant-ph/0507234 | Grover's Quantum Search Algorithm and Diophantine Approximation | <|reference_start|>Grover's Quantum Search Algorithm and Diophantine Approximation: In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result ... | arxiv | @article{dolev2005grover's,
title={Grover's Quantum Search Algorithm and Diophantine Approximation},
author={Shahar Dolev, Itamar Pitowsky, and Boaz Tamir},
journal={Physical Review A 73 022308 (2006)},
year={2005},
doi={10.1103/PhysRevA.73.022308},
archivePrefix={arXiv},
eprint={quant-ph/05... | dolev2005grover's |
arxiv-677328 | quant-ph/0507270 | Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks | <|reference_start|>Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks: Two-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combin... | arxiv | @article{nishimura2005quantum,
title={Quantum Minimal One Way Information: Relative Hardness and Quantum
Advantage of Combinatorial Tasks},
author={Harumichi Nishimura and Tomoyuki Yamakami},
journal={arXiv preprint arXiv:quant-ph/0507270},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/... | nishimura2005quantum |
arxiv-677329 | quant-ph/0508070 | Nonbinary stabilizer codes over finite fields | <|reference_start|>Nonbinary stabilizer codes over finite fields: One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. In past years, many good quantum error-correcting codes had been derived as binary s... | arxiv | @article{ketkar2005nonbinary,
title={Nonbinary stabilizer codes over finite fields},
author={Avanti Ketkar, Andreas Klappenecker, Santosh Kumar, Pradeep Kiran
Sarvepalli},
journal={arXiv preprint arXiv:quant-ph/0508070},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0508070},
primar... | ketkar2005nonbinary |
arxiv-677330 | quant-ph/0508072 | Generic Security Proof of Quantum Key Exchange using Squeezed States | <|reference_start|>Generic Security Proof of Quantum Key Exchange using Squeezed States: Recently, a Quantum Key Exchange protocol that uses squeezed states was presented by Gottesman and Preskill. In this paper we give a generic security proof for this protocol. The method used for this generic security proof is based... | arxiv | @article{poels2005generic,
title={Generic Security Proof of Quantum Key Exchange using Squeezed States},
author={Karin Poels, Pim Tuyls, Berry Schoenmakers},
journal={arXiv preprint arXiv:quant-ph/0508072},
year={2005},
doi={10.1109/ISIT.2005.1523617},
archivePrefix={arXiv},
eprint={quant-ph... | poels2005generic |
arxiv-677331 | quant-ph/0508116 | A probabilistic branching bisimulation for quantum processes | <|reference_start|>A probabilistic branching bisimulation for quantum processes: 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 cooperate.Moreover, to model concurrent and distr... | arxiv | @article{lalire2005a,
title={A probabilistic branching bisimulation for quantum processes},
author={Marie Lalire},
journal={arXiv preprint arXiv:quant-ph/0508116},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0508116},
primaryClass={quant-ph cs.PL}
} | lalire2005a |
arxiv-677332 | quant-ph/0508149 | Variable Bias Coin Tossing | <|reference_start|>Variable Bias Coin Tossing: Alice is a charismatic quantum cryptographer who believes her parties are unmissable; Bob is a (relatively) glamorous string theorist who believes he is an indispensable guest. To prevent possibly traumatic collisions of self-perception and reality, their social code requi... | arxiv | @article{colbeck2005variable,
title={Variable Bias Coin Tossing},
author={Roger Colbeck and Adrian Kent (Centre for Quantum Computation, DAMTP,
University of Cambridge)},
journal={Phys. Rev. A 73, 032320 (2006)},
year={2005},
doi={10.1103/PhysRevA.73.032320},
archivePrefix={arXiv},
eprint=... | colbeck2005variable |
arxiv-677333 | quant-ph/0508200 | A new quantum lower bound method, with an application to strong direct product theorem for quantum search | <|reference_start|>A new quantum lower bound method, with an application to strong direct product theorem for quantum search: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem. Using th... | arxiv | @article{ambainis2005a,
title={A new quantum lower bound method, with an application to strong direct
product theorem for quantum search},
author={Andris Ambainis},
journal={arXiv preprint arXiv:quant-ph/0508200},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0508200},
primaryClass=... | ambainis2005a |
arxiv-677334 | quant-ph/0508201 | Entanglement in Interactive Proof Systems with Binary Answers | <|reference_start|>Entanglement in Interactive Proof Systems with Binary Answers: If two classical provers share an entangled state, the resulting interactive proof system is significantly weakened [quant-ph/0404076]. We show that for the case where the verifier computes the XOR of two binary answers, the resulting pro... | arxiv | @article{wehner2005entanglement,
title={Entanglement in Interactive Proof Systems with Binary Answers},
author={Stephanie Wehner (CWI, Amsterdam)},
journal={Proc. of 23rd STACS, 2006, LNCS 3884, pages 162-171.},
year={2005},
doi={10.1007/11672142_12},
archivePrefix={arXiv},
eprint={quant-ph/... | wehner2005entanglement |
arxiv-677335 | quant-ph/0508222 | Cryptography In the Bounded Quantum-Storage Model | <|reference_start|>Cryptography In the Bounded Quantum-Storage Model: We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivious transfer and bit commitment can be implemented in this model using protoc... | arxiv | @article{damgaard2005cryptography,
title={Cryptography In the Bounded Quantum-Storage Model},
author={Ivan Damgaard, Serge Fehr, Louis Salvail, Christian Schaffner},
journal={Proceedings of the 46th IEEE Symposium on Foundations of Computer
Science - FOCS 2005, pages 449-458},
year={2005},
archive... | damgaard2005cryptography |
arxiv-677336 | quant-ph/0510031 | Image compression and entanglement | <|reference_start|>Image compression and entanglement: The pixel values of an image can be casted into a real ket of a Hilbert space using an appropriate block structured addressing. The resulting state can then be rewritten in terms of its matrix product state representation in such a way that quantum entanglement cor... | arxiv | @article{latorre2005image,
title={Image compression and entanglement},
author={Jose I. Latorre},
journal={arXiv preprint arXiv:quant-ph/0510031},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0510031},
primaryClass={quant-ph cs.MM}
} | latorre2005image |
arxiv-677337 | quant-ph/0510230 | QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols | <|reference_start|>QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols: This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in su... | arxiv | @article{aaronson2005qma/qpoly,
title={QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols},
author={Scott Aaronson},
journal={arXiv preprint arXiv:quant-ph/0510230},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0510230},
primaryClass={quant-ph cs.CC}
} | aaronson2005qma/qpoly |
arxiv-677338 | quant-ph/0511013 | Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity | <|reference_start|>Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity: We consider the problem of bounded-error quantum state identification: given either state \alpha_0 or state \alpha_1, we are required to output `0', `1' or `?' ("don't know"), such that conditioned on ... | arxiv | @article{gavinsky2005bounded-error,
title={Bounded-Error Quantum State Identification and Exponential Separations
in Communication Complexity},
author={Dmytro Gavinsky, Julia Kempe, Oded Regev and Ronald de Wolf},
journal={arXiv preprint arXiv:quant-ph/0511013},
year={2005},
archivePrefix={arXiv},... | gavinsky2005bounded-error |
arxiv-677339 | quant-ph/0511016 | Convolutional and tail-biting quantum error-correcting codes | <|reference_start|>Convolutional and tail-biting quantum error-correcting codes: Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional... | arxiv | @article{forney,2005convolutional,
title={Convolutional and tail-biting quantum error-correcting codes},
author={G. David Forney, Jr., Markus Grassl, and Saikat Guha},
journal={IEEE Transactions on Information Theory, vol. 53, no. 3, March
2007, pp. 865-880},
year={2005},
doi={10.1109/TIT.2006.890... | forney,2005convolutional |
arxiv-677340 | quant-ph/0511025 | Quantum Weakly Nondeterministic Communication Complexity | <|reference_start|>Quantum Weakly Nondeterministic Communication Complexity: We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability one by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this mod... | arxiv | @article{gall2005quantum,
title={Quantum Weakly Nondeterministic Communication Complexity},
author={Francois Le Gall},
journal={Theoretical Computer Science, Vol. 486, pp. 43-49, 2013},
year={2005},
doi={10.1016/j.tcs.2012.12.015},
archivePrefix={arXiv},
eprint={quant-ph/0511025},
primar... | gall2005quantum |
arxiv-677341 | quant-ph/0511145 | Semantics and simulation of communication in quantum programming | <|reference_start|>Semantics and simulation of communication in quantum programming: We present the quantum programming language cQPL which is an extended version of QPL [P. Selinger, Math. Struct. in Comp. Sci. 14(4):527-586, 2004]. It is capable of quantum communication and it can be used to formulate all possible qu... | arxiv | @article{mauerer2005semantics,
title={Semantics and simulation of communication in quantum programming},
author={Wolfgang Mauerer},
journal={arXiv preprint arXiv:quant-ph/0511145},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0511145},
primaryClass={quant-ph cs.PL}
} | mauerer2005semantics |
arxiv-677342 | quant-ph/0511148 | Limitations of Quantum Coset States for Graph Isomorphism | <|reference_start|>Limitations of Quantum Coset States for Graph Isomorphism: It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resultin... | arxiv | @article{hallgren2005limitations,
title={Limitations of Quantum Coset States for Graph Isomorphism},
author={Sean Hallgren, Martin Roetteler, and Pranab Sen},
journal={J. ACM 57(6): 34 (2010)},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0511148},
primaryClass={quant-ph cs.ET}
} | hallgren2005limitations |
arxiv-677343 | quant-ph/0511172 | On Classical Teleportation and Classical Nonlocality | <|reference_start|>On Classical Teleportation and Classical Nonlocality: An interesting protocol for classical teleportation of an unknown classical state was recently suggested by Cohen, and by Gour and Meyer. In that protocol, Bob can sample from a probability distribution P that is given to Alice, even if Alice has ... | arxiv | @article{mor2005on,
title={On Classical Teleportation and Classical Nonlocality},
author={Tal Mor},
journal={Int. J. of Quantum Information 4, 161-172 (2006)},
year={2005},
doi={10.1063/1.2165638},
archivePrefix={arXiv},
eprint={quant-ph/0511172},
primaryClass={quant-ph cs.IT math.IT}
} | mor2005on |
arxiv-677344 | quant-ph/0511175 | A Proof of the Security of Quantum Key Distribution | <|reference_start|>A Proof of the Security of Quantum Key Distribution: We prove the security of theoretical quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of classical a... | arxiv | @article{biham2005a,
title={A Proof of the Security of Quantum Key Distribution},
author={Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor and Vwani
Roychowdhury},
journal={Journal of cryptology 19, 381-439 (2006)},
year={2005},
archivePrefix={arXiv},
eprint={quant-ph/0511175},
primaryCla... | biham2005a |
arxiv-677345 | quant-ph/0511200 | A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs | <|reference_start|>A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs: We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it ... | arxiv | @article{ambainis2005a,
title={A New Quantum Lower Bound Method, with Applications to Direct Product
Theorems and Time-Space Tradeoffs},
author={Andris Ambainis (U Waterloo), Robert Spalek (CWI), Ronald de Wolf
(CWI)},
journal={arXiv preprint arXiv:quant-ph/0511200},
year={2005},
archivePrefix={... | ambainis2005a |
arxiv-677346 | quant-ph/0511272 | Quantum Advantage without Entanglement | <|reference_start|>Quantum Advantage without Entanglement: We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm still has an advanta... | arxiv | @article{kenigsberg2005quantum,
title={Quantum Advantage without Entanglement},
author={Dan Kenigsberg, Tal Mor and Gil Ratsaby},
journal={Quantum Information and Computation 6(7), 606--615 (2006)},
year={2005},
doi={10.1117/12.617175},
archivePrefix={arXiv},
eprint={quant-ph/0511272},
p... | kenigsberg2005quantum |
arxiv-677347 | quant-ph/0512114 | A Categorical Quantum Logic | <|reference_start|>A Categorical Quantum Logic: We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with a... | arxiv | @article{abramsky2005a,
title={A Categorical Quantum Logic},
author={Samson Abramsky, Ross Duncan},
journal={arXiv preprint arXiv:quant-ph/0512114},
year={2005},
doi={10.1017/S0960129506005275},
archivePrefix={arXiv},
eprint={quant-ph/0512114},
primaryClass={quant-ph cs.LO}
} | abramsky2005a |
arxiv-677348 | quant-ph/0601115 | Phase-Remapping Attack in Practical Quantum Key Distribution Systems | <|reference_start|>Phase-Remapping Attack in Practical Quantum Key Distribution Systems: Quantum key distribution (QKD) can be used to generate secret keys between two distant parties. Even though QKD has been proven unconditionally secure against eavesdroppers with unlimited computation power, practical implementation... | arxiv | @article{fung2006phase-remapping,
title={Phase-Remapping Attack in Practical Quantum Key Distribution Systems},
author={Chi-Hang Fred Fung, Bing Qi, Kiyoshi Tamaki, and Hoi-Kwong Lo (Center
for Quantum Information and Quantum Control, University of Toronto, and NTT
Basic Research Laboratories, NTT Corporati... | fung2006phase-remapping |
arxiv-677349 | quant-ph/0602063 | Topological Quantum Error Correction with Optimal Encoding Rate | <|reference_start|>Topological Quantum Error Correction with Optimal Encoding Rate: We prove the existence of topological quantum error correcting codes with encoding rates $k/n$ asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of arbi... | arxiv | @article{bombin2006topological,
title={Topological Quantum Error Correction with Optimal Encoding Rate},
author={H. Bombin, M.A. Martin-Delgado},
journal={Phys.Rev.A73:062303,2006},
year={2006},
doi={10.1103/PhysRevA.73.062303},
archivePrefix={arXiv},
eprint={quant-ph/0602063},
primaryCl... | bombin2006topological |
arxiv-677350 | quant-ph/0602087 | A quantum secret ballot | <|reference_start|>A quantum secret ballot: The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity of the voter, explicitly marked on ... | arxiv | @article{dolev2006a,
title={A quantum secret ballot},
author={Shahar Dolev, Itamar Pitowsky, Boaz Tamir},
journal={arXiv preprint arXiv:quant-ph/0602087},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0602087},
primaryClass={quant-ph cs.CC}
} | dolev2006a |
arxiv-677351 | quant-ph/0602088 | Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding | <|reference_start|>Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding: Hardcore functions have been used as a technical tool to construct secure cryptographic systems; however, little is known on their quantum counterpart, called quantum hardcore functions. With a new insight into fundamental pr... | arxiv | @article{kawachi2006quantum,
title={Quantum Hardcore Functions by Complexity-Theoretical Quantum List
Decoding},
author={Akinori Kawachi and Tomoyuki Yamakami},
journal={(journal version) SIAM Journal on Computing, Vol.39, pp.2941-2969,
2010},
year={2006},
archivePrefix={arXiv},
eprint={quan... | kawachi2006quantum |
arxiv-677352 | quant-ph/0602114 | The quantum measurement problem and physical reality: a computation theoretic perspective | <|reference_start|>The quantum measurement problem and physical reality: a computation theoretic perspective: Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative ans... | arxiv | @article{srikanth2006the,
title={The quantum measurement problem and physical reality: a computation
theoretic perspective},
author={R. Srikanth},
journal={AIP Conference Proceedings 864, pp. 178-193 (2006)},
year={2006},
doi={10.1063/1.2400889},
archivePrefix={arXiv},
eprint={quant-ph/060... | srikanth2006the |
arxiv-677353 | quant-ph/0602129 | Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes | <|reference_start|>Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes: We present an algorithm to construct quantum circuits for encoding and inverse encoding of quantum convolutional codes. We show that any quantum convolutional code contains a subcode of finite index which has a non-catast... | arxiv | @article{grassl2006non-catastrophic,
title={Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional
Codes},
author={Markus Grassl and Martin Roetteler},
journal={Proceedings 2006 IEEE International Symposium on Information
Theory, pp. 1109-1113},
year={2006},
doi={10.1109/ISIT.2... | grassl2006non-catastrophic |
arxiv-677354 | quant-ph/0602156 | Quantum Predicative Programming | <|reference_start|>Quantum Predicative Programming: The subject of this work is quantum predicative programming -- the study of developing of programs intended for execution on a quantum computer. We look at programming in the context of formal methods of program development, or programming methodology. Our work is bas... | arxiv | @article{tafliovich2006quantum,
title={Quantum Predicative Programming},
author={Anya Tafliovich, E.C.R. Hehner},
journal={arXiv preprint arXiv:quant-ph/0602156},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0602156},
primaryClass={quant-ph cs.PL}
} | tafliovich2006quantum |
arxiv-677355 | quant-ph/0603031 | Channel capacities of classical and quantum list decoding | <|reference_start|>Channel capacities of classical and quantum list decoding: We focus on classical and quantum list decoding. The capacity of list decoding was obtained by Nishimura in the case when the number of list does not increase exponentially. However, the capacity of the exponential-list case is open even in t... | arxiv | @article{hayashi2006channel,
title={Channel capacities of classical and quantum list decoding},
author={Masahito Hayashi},
journal={arXiv preprint arXiv:quant-ph/0603031},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0603031},
primaryClass={quant-ph cs.IT math.IT}
} | hayashi2006channel |
arxiv-677356 | quant-ph/0603034 | New upper and lower bounds for randomized and quantum Local Search | <|reference_start|>New upper and lower bounds for randomized and quantum Local Search: Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexity theory and many other areas in theoretical computer... | arxiv | @article{zhang2006new,
title={New upper and lower bounds for randomized and quantum Local Search},
author={Shengyu Zhang},
journal={arXiv preprint arXiv:quant-ph/0603034},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0603034},
primaryClass={quant-ph cs.CC}
} | zhang2006new |
arxiv-677357 | quant-ph/0603098 | Quantum broadcast channels | <|reference_start|>Quantum broadcast channels: We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a classical input to give a genera... | arxiv | @article{yard2006quantum,
title={Quantum broadcast channels},
author={Jon Yard, Patrick Hayden, Igor Devetak},
journal={arXiv preprint arXiv:quant-ph/0603098},
year={2006},
doi={10.1109/TIT.2011.2165811},
archivePrefix={arXiv},
eprint={quant-ph/0603098},
primaryClass={quant-ph cs.IT math... | yard2006quantum |
arxiv-677358 | quant-ph/0603135 | Interaction in Quantum Communication | <|reference_start|>Interaction in Quantum Communication: In some scenarios there are ways of conveying information with many fewer, even exponentially fewer, qubits than possible classically. Moreover, some of these methods have a very simple structure--they involve only few message exchanges between the communicating ... | arxiv | @article{klauck2006interaction,
title={Interaction in Quantum Communication},
author={Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma and David Zuckerman},
journal={arXiv preprint arXiv:quant-ph/0603135},
year={2006},
doi={10.1109/TIT.2007.896888},
archivePrefix={arXiv},
eprint={quant-ph/0603135... | klauck2006interaction |
arxiv-677359 | quant-ph/0603173 | Strengths and Weaknesses of Quantum Fingerprinting | <|reference_start|>Strengths and Weaknesses of Quantum Fingerprinting: We study the power of quantum fingerprints in the simultaneous message passing (SMP) setting of communication complexity. Yao recently showed how to simulate, with exponential overhead, classical shared-randomness SMP protocols by means of quantum S... | arxiv | @article{gavinsky2006strengths,
title={Strengths and Weaknesses of Quantum Fingerprinting},
author={Dmytro Gavinsky, Julia Kempe, Ronald de Wolf},
journal={Proc. 21st CCC (Complexity), p. 288-295 (2006)},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0603173},
primaryClass={quant-ph c... | gavinsky2006strengths |
arxiv-677360 | quant-ph/0603199 | Computational complexity of the quantum separability problem | <|reference_start|>Computational complexity of the quantum separability problem: Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first ... | arxiv | @article{ioannou2006computational,
title={Computational complexity of the quantum separability problem},
author={Lawrence M. Ioannou},
journal={Quantum Information and Computation, Vol. 7, No. 4 (2007) 335-370},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0603199},
primaryClass={qua... | ioannou2006computational |
arxiv-677361 | quant-ph/0604013 | Beyond iid in Quantum Information Theory | <|reference_start|>Beyond iid in Quantum Information Theory: The information spectrum approach gives general formulae for optimal rates of codes in many areas of information theory. In this paper the quantum spectral divergence rates are defined and properties of the rates are derived. The entropic rates, conditional e... | arxiv | @article{bowen2006beyond,
title={Beyond i.i.d. in Quantum Information Theory},
author={Garry Bowen and Nilanjana Datta},
journal={arXiv preprint arXiv:quant-ph/0604013},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0604013},
primaryClass={quant-ph cs.IT math.IT}
} | bowen2006beyond |
arxiv-677362 | quant-ph/0604052 | On the Role of Shared Entanglement | <|reference_start|>On the Role of Shared Entanglement: Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of the former. In particular, there is no known "entanglement analogue" for the famous th... | arxiv | @article{gavinsky2006on,
title={On the Role of Shared Entanglement},
author={Dmytro Gavinsky},
journal={arXiv preprint arXiv:quant-ph/0604052},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0604052},
primaryClass={quant-ph cs.CC}
} | gavinsky2006on |
arxiv-677363 | quant-ph/0604056 | Quantum Versus Classical Proofs and Advice | <|reference_start|>Quantum Versus Classical Proofs and Advice: This paper studies whether quantum proofs are more powerful than classical proofs, or in complexity terms, whether QMA=QCMA. We prove three results about this question. First, we give a "quantum oracle separation" between QMA and QCMA. More concretely, we s... | arxiv | @article{aaronson2006quantum,
title={Quantum Versus Classical Proofs and Advice},
author={Scott Aaronson and Greg Kuperberg},
journal={Theory Comput. 3 (2007), 129-157},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0604056},
primaryClass={quant-ph cs.CC}
} | aaronson2006quantum |
arxiv-677364 | quant-ph/0604161 | Clifford Code Constructions of Operator Quantum Error Correcting Codes | <|reference_start|>Clifford Code Constructions of Operator Quantum Error Correcting Codes: Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of suc... | arxiv | @article{klappenecker2006clifford,
title={Clifford Code Constructions of Operator Quantum Error Correcting Codes},
author={Andreas Klappenecker and Pradeep Kiran Sarvepalli},
journal={arXiv preprint arXiv:quant-ph/0604161},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0604161},
prima... | klappenecker2006clifford |
arxiv-677365 | quant-ph/0605030 | Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity | <|reference_start|>Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity: We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QTM until the other QTM has halted and then halt itself with probability one. This extends work by Bernstein and Vazira... | arxiv | @article{mueller2006strongly,
title={Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov
Complexity},
author={Markus Mueller},
journal={IEEE Trans. Inf. Th., Vol. 54/2 pp. 763-780 (2008)},
year={2006},
doi={10.1109/TIT.2007.913263},
archivePrefix={arXiv},
eprint={quant-... | mueller2006strongly |
arxiv-677366 | quant-ph/0605041 | Invertible Quantum Operations and Perfect Encryption of Quantum States | <|reference_start|>Invertible Quantum Operations and Perfect Encryption of Quantum States: In this note, we characterize the form of an invertible quantum operation, i.e., a completely positive trace preserving linear transformation (a CPTP map) whose inverse is also a CPTP map. The precise form of such maps becomes im... | arxiv | @article{nayak2006invertible,
title={Invertible Quantum Operations and Perfect Encryption of Quantum States},
author={Ashwin Nayak (1), Pranab Sen (2) ((1) U. Waterloo & Perimeter, (2)
TIFR)},
journal={arXiv preprint arXiv:quant-ph/0605041},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph... | nayak2006invertible |
arxiv-677367 | quant-ph/0605096 | Quantum Information and Entropy | <|reference_start|>Quantum Information and Entropy: Thermodynamic entropy is not an entirely satisfactory measure of information of a quantum state. This entropy for an unknown pure state is zero, although repeated measurements on copies of such a pure state do communicate information. In view of this, we propose a new... | arxiv | @article{kak2006quantum,
title={Quantum Information and Entropy},
author={Subhash Kak},
journal={International Journal of Theoretical Physics, vol. 46, pp.
860-876, 2007.},
year={2006},
doi={10.1007/s10773-006-9245-6},
archivePrefix={arXiv},
eprint={quant-ph/0605096},
primaryClass={qua... | kak2006quantum |
arxiv-677368 | quant-ph/0605150 | Using quantum oblivious transfer to cheat sensitive quantum bit commitment | <|reference_start|>Using quantum oblivious transfer to cheat sensitive quantum bit commitment: It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independently by Aharonov et al. [STOC, 2000] and Hardy a... | arxiv | @article{jakoby2006using,
title={Using quantum oblivious transfer to cheat sensitive quantum bit
commitment},
author={Andreas Jakoby, Maciej Liskiewicz, and Aleksander Madry},
journal={arXiv preprint arXiv:quant-ph/0605150},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0605150},
pr... | jakoby2006using |
arxiv-677369 | quant-ph/0605181 | The BQP-hardness of approximating the Jones Polynomial | <|reference_start|>The BQP-hardness of approximating the Jones Polynomial: A celebrated important result due to Freedman, Larsen and Wang states that providing additive approximations of the Jones polynomial at the k'th root of unity, for constant k=5 and k>6, is BQP-hard. Together with the algorithmic results of Freed... | arxiv | @article{aharonov2006the,
title={The BQP-hardness of approximating the Jones Polynomial},
author={Dorit Aharonov and Itai Arad},
journal={New J. Phys. 13 (2011) 035019},
year={2006},
doi={10.1088/1367-2630/13/3/035019},
archivePrefix={arXiv},
eprint={quant-ph/0605181},
primaryClass={quan... | aharonov2006the |
arxiv-677370 | quant-ph/0605182 | Maximally Non-Local and Monogamous Quantum Correlations | <|reference_start|>Maximally Non-Local and Monogamous Quantum Correlations: We introduce a version of the chained Bell inequality for an arbitrary number of measurement outcomes, and use it to give a simple proof that the maximally entangled state of two d dimensional quantum systems has no local component. That is, if... | arxiv | @article{barrett2006maximally,
title={Maximally Non-Local and Monogamous Quantum Correlations},
author={Jonathan Barrett, Adrian Kent and Stefano Pironio},
journal={Phys. Rev. Lett. 97, 170409 (2006).},
year={2006},
doi={10.1103/PhysRevLett.97.170409},
archivePrefix={arXiv},
eprint={quant-ph... | barrett2006maximally |
arxiv-677371 | quant-ph/0605219 | Classical simulators of quantum computers and no-go theorems | <|reference_start|>Classical simulators of quantum computers and no-go theorems: It is discussed, why classical simulators of quantum computers escape from some no-go claims like Kochen-Specker, Bell, or recent Conway-Kochen "Free Will" theorems.<|reference_end|> | arxiv | @article{vlasov2006classical,
title={Classical simulators of quantum computers and no-go theorems},
author={Alexander Yu. Vlasov},
journal={arXiv preprint arXiv:quant-ph/0605219},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0605219},
primaryClass={quant-ph cs.OH}
} | vlasov2006classical |
arxiv-677372 | quant-ph/0606049 | Full security of quantum key distribution from no-signaling constraints | <|reference_start|>Full security of quantum key distribution from no-signaling constraints: We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers, constrained only by the assumptio... | arxiv | @article{masanes2006full,
title={Full security of quantum key distribution from no-signaling constraints},
author={Ll. Masanes, R. Renner, M. Christandl, A. Winter, J. Barrett},
journal={IEEE Transactions on Information Theory, Volume 60, Issue 8, pages
4973-4986, year 2014},
year={2006},
doi={10.... | masanes2006full |
arxiv-677373 | quant-ph/0606066 | Exponential Separation of Quantum and Classical Online Space Complexity | <|reference_start|>Exponential Separation of Quantum and Classical Online Space Complexity: Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In thi... | arxiv | @article{gall2006exponential,
title={Exponential Separation of Quantum and Classical Online Space Complexity},
author={Francois Le Gall},
journal={Theory of Computing Systems 45(2): 188-202 (2009)},
year={2006},
doi={10.1007/s00224-007-9097-3},
archivePrefix={arXiv},
eprint={quant-ph/0606066... | gall2006exponential |
arxiv-677374 | quant-ph/0607111 | `Plausibilities of plausibilities': an approach through circumstances | <|reference_start|>`Plausibilities of plausibilities': an approach through circumstances: Probability-like parameters appearing in some statistical models, and their prior distributions, are reinterpreted through the notion of `circumstance', a term which stands for any piece of knowledge that is useful in assigning a ... | arxiv | @article{mana2006`plausibilities,
title={`Plausibilities of plausibilities': an approach through circumstances},
author={P. G. L. Porta Mana, A. M{aa}nsson, G. Bj"ork},
journal={arXiv preprint arXiv:quant-ph/0607111},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0607111},
primaryClas... | mana2006`plausibilities |
arxiv-677375 | quant-ph/0607173 | The one-way communication complexity of the Boolean Hidden Matching Problem | <|reference_start|>The one-way communication complexity of the Boolean Hidden Matching Problem: We give a tight lower bound of Omega(\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(\log ... | arxiv | @article{kerenidis2006the,
title={The one-way communication complexity of the Boolean Hidden Matching
Problem},
author={Iordanis Kerenidis, Ran Raz},
journal={arXiv preprint arXiv:quant-ph/0607173},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0607173},
primaryClass={quant-ph cs.CC... | kerenidis2006the |
arxiv-677376 | quant-ph/0607174 | Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function | <|reference_start|>Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function: We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar res... | arxiv | @article{gavinsky2006exponential,
title={Exponential Separation of Quantum and Classical One-Way Communication
Complexity for a Boolean Function},
author={Dmytro Gavinsky, Julia Kempe, Ronald de Wolf},
journal={arXiv preprint arXiv:quant-ph/0607174},
year={2006},
archivePrefix={arXiv},
eprint=... | gavinsky2006exponential |
arxiv-677377 | quant-ph/0608026 | Search via Quantum Walk | <|reference_start|>Search via Quantum Walk: We propose a new method for designing quantum search algorithms for finding a "marked" element in the state space of a classical Markov chain. The algorithm is based on a quantum walk \'a la Szegedy (2004) that is defined in terms of the Markov chain. The main new idea is to ... | arxiv | @article{magniez2006search,
title={Search via Quantum Walk},
author={Fr'ed'eric Magniez, Ashwin Nayak, J'er'emie Roland and Miklos
Santha},
journal={SIAM Journal on Computing, 40(1):142-164, 2011},
year={2006},
doi={10.1137/090745854},
archivePrefix={arXiv},
eprint={quant-ph/0608026},
... | magniez2006search |
arxiv-677378 | quant-ph/0609028 | Secure Controlled Teleportation | <|reference_start|>Secure Controlled Teleportation: Several protocols for controlled teleportation were suggested by Yang, Chu, and Han [PRA 70, 022329 (2004)]. In these protocols, Alice teleports qubits (in an unknown state) to Bob iff a controller allows it. We view this problem in the perspective of secure multi-par... | arxiv | @article{kenigsberg2006secure,
title={Secure Controlled Teleportation},
author={Dan Kenigsberg and Tal Mor},
journal={arXiv preprint arXiv:quant-ph/0609028},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0609028},
primaryClass={quant-ph cs.CR}
} | kenigsberg2006secure |
arxiv-677379 | quant-ph/0609117 | Quantum Pattern Retrieval by Qubit Networks with Hebb Interactions | <|reference_start|>Quantum Pattern Retrieval by Qubit Networks with Hebb Interactions: Qubit networks with long-range interactions inspired by the Hebb rule can be used as quantum associative memories. Starting from a uniform superposition, the unitary evolution generated by these interactions drives the network throug... | arxiv | @article{diamantini2006quantum,
title={Quantum Pattern Retrieval by Qubit Networks with Hebb Interactions},
author={M.Cristina Diamantini and Carlo A. Trugenberger},
journal={arXiv preprint arXiv:quant-ph/0609117},
year={2006},
doi={10.1103/PhysRevLett.97.130503},
archivePrefix={arXiv},
epri... | diamantini2006quantum |
arxiv-677380 | quant-ph/0609138 | On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism | <|reference_start|>On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism: It is known that any quantum algorithm for Graph Isomorphism that works within the framework of the hidden subgroup problem (HSP) must perform highly entangled measurements across Omega(n log n) coset states. One of the only kno... | arxiv | @article{moore2006on,
title={On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism},
author={Cristopher Moore and Alexander Russell},
journal={arXiv preprint arXiv:quant-ph/0609138},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0609138},
primaryClass={quant-ph cs.CC... | moore2006on |
arxiv-677381 | quant-ph/0609205 | Group Theoretical Formulation of Quantum Partial Search Algorithm | <|reference_start|>Group Theoretical Formulation of Quantum Partial Search Algorithm: Searching and sorting used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a b... | arxiv | @article{korepin2006group,
title={Group Theoretical Formulation of Quantum Partial Search Algorithm},
author={Vladimir E. Korepin and Brenno C. Vallilo},
journal={Prog. Theor. Phys. Vol. 116, No. 5 (2006), p. 783},
year={2006},
doi={10.1143/PTP.116.783},
number={YIPT-SB-06-41},
archivePrefix... | korepin2006group |
arxiv-677382 | quant-ph/0609229 | Ergodic Classical-Quantum Channels: Structure and Coding Theorems | <|reference_start|>Ergodic Classical-Quantum Channels: Structure and Coding Theorems: We consider ergodic causal classical-quantum channels (cq-channels) which additionally have a decaying input memory. In the first part we develop some structural properties of ergodic cq-channels and provide equivalent conditions for ... | arxiv | @article{bjelakovic2006ergodic,
title={Ergodic Classical-Quantum Channels: Structure and Coding Theorems},
author={Igor Bjelakovic, Holger Boche},
journal={IEEE Transactions on Information Theory Vol. 54, No. 2, pp.
723-742, February 2008},
year={2006},
doi={10.1109/TIT.2007.913232},
archivePr... | bjelakovic2006ergodic |
arxiv-677383 | quant-ph/0610153 | Subsystem Codes | <|reference_start|>Subsystem Codes: We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to ... | arxiv | @article{aly2006subsystem,
title={Subsystem Codes},
author={Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli},
journal={arXiv preprint arXiv:quant-ph/0610153},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0610153},
primaryClass={quant-ph cs.IT math.IT}
} | aly2006subsystem |
arxiv-677384 | quant-ph/0610200 | Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords | <|reference_start|>Quantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords: Given a classical error-correcting block code, the task of quantum list decoding is to produce from any quantumly corrupted codeword a short list containing all messages whose codewords exhib... | arxiv | @article{yamakami2006quantum,
title={Quantum List Decoding of Classical Block Codes of Polynomially Small
Rate from Quantumly Corrupted Codewords},
author={Tomoyuki Yamakami},
journal={Baltic Journal of Modern Computing, Vol. 4 (2016), No. 4, pp.
753-788},
year={2006},
doi={10.22364/bjmc.2016.4.... | yamakami2006quantum |
arxiv-677385 | quant-ph/0611021 | Merlin-Arthur Games and Stoquastic Complexity | <|reference_start|>Merlin-Arthur Games and Stoquastic Complexity: MA is a class of decision problems for which `yes'-instances have a proof that can be efficiently checked by a classical randomized algorithm. We prove that MA has a natural complete problem which we call the stoquastic k-SAT problem. This is a matrix-va... | arxiv | @article{bravyi2006merlin-arthur,
title={Merlin-Arthur Games and Stoquastic Complexity},
author={Sergey Bravyi, Arvid J. Bessen, and Barbara M. Terhal},
journal={arXiv preprint arXiv:quant-ph/0611021},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0611021},
primaryClass={quant-ph cs.C... | bravyi2006merlin-arthur |
arxiv-677386 | quant-ph/0611033 | Approximate Randomization of Quantum States With Fewer Bits of Key | <|reference_start|>Approximate Randomization of Quantum States With Fewer Bits of Key: Randomization of quantum states is the quantum analogue of the classical one-time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/epsilon^2) Pauli operators to map any d-dimension... | arxiv | @article{dickinson2006approximate,
title={Approximate Randomization of Quantum States With Fewer Bits of Key},
author={Paul A. Dickinson (1) and Ashwin Nayak (1,2) ((1) C&O and IQC, U.
Waterloo, (2) Perimeter Institute)},
journal={arXiv preprint arXiv:quant-ph/0611033},
year={2006},
doi={10.1063/1... | dickinson2006approximate |
arxiv-677387 | quant-ph/0611167 | Continuous Variable Quantum Cryptography using Two-Way Quantum Communication | <|reference_start|>Continuous Variable Quantum Cryptography using Two-Way Quantum Communication: Quantum cryptography has been recently extended to continuous variable systems, e.g., the bosonic modes of the electromagnetic field. In particular, several cryptographic protocols have been proposed and experimentally impl... | arxiv | @article{pirandola2006continuous,
title={Continuous Variable Quantum Cryptography using Two-Way Quantum
Communication},
author={Stefano Pirandola, Stefano Mancini, Seth Lloyd, and Samuel L.
Braunstein},
journal={Nature Physics 4, 726 - 730 (2008)},
year={2006},
doi={10.1038/nphys1018},
archi... | pirandola2006continuous |
arxiv-677388 | quant-ph/0611234 | Toward a general theory of quantum games | <|reference_start|>Toward a general theory of quantum games: We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus on a representation... | arxiv | @article{gutoski2006toward,
title={Toward a general theory of quantum games},
author={Gus Gutoski and John Watrous},
journal={Proceedings of STOC 2007, pages 565-574},
year={2006},
doi={10.1145/1250790.1250873},
archivePrefix={arXiv},
eprint={quant-ph/0611234},
primaryClass={quant-ph cs.... | gutoski2006toward |
arxiv-677389 | quant-ph/0612014 | A Tight High-Order Entropic Quantum Uncertainty Relation With Applications | <|reference_start|>A Tight High-Order Entropic Quantum Uncertainty Relation With Applications: We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantu... | arxiv | @article{damgaard2006a,
title={A Tight High-Order Entropic Quantum Uncertainty Relation With
Applications},
author={Ivan B. Damgaard, Serge Fehr, Renato Renner, Louis Salvail, Christian
Schaffner},
journal={full version of CRYPTO 2007, LNCS 4622},
year={2006},
archivePrefix={arXiv},
eprint={... | damgaard2006a |
arxiv-677390 | quant-ph/0612052 | Deciding whether a quantum state has secret correlations is an NP-complete problem | <|reference_start|>Deciding whether a quantum state has secret correlations is an NP-complete problem: From the NP-hardness of the quantum separability problem and the relation between bipartite entanglement and the secret key correlations, it is shown that the problem deciding whether a given quantum state has secret ... | arxiv | @article{lee2006deciding,
title={Deciding whether a quantum state has secret correlations is an
NP-complete problem},
author={Jae-Weon Lee, DoYong Kwon, Jaewan Kim},
journal={arXiv preprint arXiv:quant-ph/0612052},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0612052},
primaryClass... | lee2006deciding |
arxiv-677391 | quant-ph/0612107 | How a Clebsch-Gordan Transform Helps to Solve the Heisenberg Hidden Subgroup Problem | <|reference_start|>How a Clebsch-Gordan Transform Helps to Solve the Heisenberg Hidden Subgroup Problem: It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within... | arxiv | @article{bacon2006how,
title={How a Clebsch-Gordan Transform Helps to Solve the Heisenberg Hidden
Subgroup Problem},
author={Dave Bacon},
journal={arXiv preprint arXiv:quant-ph/0612107},
year={2006},
archivePrefix={arXiv},
eprint={quant-ph/0612107},
primaryClass={quant-ph cs.CC}
} | bacon2006how |
arxiv-677392 | quant-ph/0612155 | A father protocol for quantum broadcast channels | <|reference_start|>A father protocol for quantum broadcast channels: A new protocol for quantum broadcast channels based on the fully quantum Slepian-Wolf protocol is presented. The protocol yields an achievable rate region for entanglement-assisted transmission of quantum information through a quantum broadcast channe... | arxiv | @article{dupuis2006a,
title={A father protocol for quantum broadcast channels},
author={Fr'ed'eric Dupuis, Patrick Hayden, Ke Li},
journal={IEEE Transactions on Information Theory 56(6)2946-2956, 2010},
year={2006},
doi={10.1109/TIT.2010.2046217},
archivePrefix={arXiv},
eprint={quant-ph/0612... | dupuis2006a |
arxiv-677393 | quant-ph/0612199 | Lineal: A linear-algebraic Lambda-calculus | <|reference_start|>Lineal: A linear-algebraic Lambda-calculus: We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus with the possibi... | arxiv | @article{arrighi2006lineal:,
title={Lineal: A linear-algebraic Lambda-calculus},
author={Pablo Arrighi, Gilles Dowek},
journal={Logical Methods in Computer Science, Volume 13, Issue 1 (March 17,
2017) lmcs:3203},
year={2006},
doi={10.23638/LMCS-13(1:8)2017},
archivePrefix={arXiv},
eprint={... | arrighi2006lineal: |
arxiv-677394 | quant-ph/0701020 | Quantum Quasi-Cyclic LDPC Codes | <|reference_start|>Quantum Quasi-Cyclic LDPC Codes: In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our proposed codes have lots of... | arxiv | @article{hagiwara2007quantum,
title={Quantum Quasi-Cyclic LDPC Codes},
author={Manabu Hagiwara, Hideki Imai},
journal={arXiv preprint arXiv:quant-ph/0701020},
year={2007},
doi={10.1109/ISIT.2007.4557323},
archivePrefix={arXiv},
eprint={quant-ph/0701020},
primaryClass={quant-ph cs.IT math... | hagiwara2007quantum |
arxiv-677395 | quant-ph/0701037 | Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes | <|reference_start|>Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes: Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on dire... | arxiv | @article{aly2007quantum,
title={Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller
Codes},
author={Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli},
journal={arXiv preprint arXiv:quant-ph/0701037},
year={2007},
archivePrefix={arXiv},
eprint={quant-ph/0701037},
... | aly2007quantum |
arxiv-677396 | quant-ph/0701113 | A presentation of Quantum Logic based on an "and then" connective | <|reference_start|>A presentation of Quantum Logic based on an "and then" connective: When a physicist performs a quantic measurement, new information about the system at hand is gathered. This paper studies the logical properties of how this new information is combined with previous information. It presents Quantum Lo... | arxiv | @article{lehmann2007a,
title={A presentation of Quantum Logic based on an "and then" connective},
author={Daniel Lehmann},
journal={Journal of Logic and Computation 18 (1): 59-76 Feb. 2008},
year={2007},
doi={10.1093/logcom/exm054},
number={Short version in Leibniz Center, School of Engineering,... | lehmann2007a |
arxiv-677397 | quant-ph/0701168 | Using quantum key distribution for cryptographic purposes: a survey | <|reference_start|>Using quantum key distribution for cryptographic purposes: a survey: The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. As a key establishment primitive, QKD however does no... | arxiv | @article{alléaume2007using,
title={Using quantum key distribution for cryptographic purposes: a survey},
author={Romain All'eaume, Cyril Branciard, Jan Bouda, Thierry Debuisschert,
Mehrdad Dianati, Nicolas Gisin, Mark Godfrey, Philippe Grangier, Thomas
Langer, Norbert Lutkenhaus, Christian Monyk, Philippe P... | alléaume2007using |
arxiv-677398 | quant-ph/0701171 | Turning the Liar paradox into a metatheorem of Basic logic | <|reference_start|>Turning the Liar paradox into a metatheorem of Basic logic: We show that self-reference can be formalized in Basic logic by means of the new connective @, called "entanglement". In fact, the property of non-idempotence of the connective @ is a metatheorem, which states that a self-entangled sentence ... | arxiv | @article{zizzi2007turning,
title={Turning the Liar paradox into a metatheorem of Basic logic},
author={Paola A. Zizzi},
journal={arXiv preprint arXiv:quant-ph/0701171},
year={2007},
archivePrefix={arXiv},
eprint={quant-ph/0701171},
primaryClass={quant-ph cs.LO math.LO}
} | zizzi2007turning |
arxiv-677399 | quant-ph/0702005 | A decoupling approach to the quantum capacity | <|reference_start|>A decoupling approach to the quantum capacity: We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a t... | arxiv | @article{hayden2007a,
title={A decoupling approach to the quantum capacity},
author={Patrick Hayden, Michal Horodecki, Andreas Winter and Jon Yard},
journal={Open Syst. Inf. Dyn. 15 (2008) 7-19},
year={2007},
doi={10.1142/S1230161208000043},
archivePrefix={arXiv},
eprint={quant-ph/0702005},
... | hayden2007a |
arxiv-677400 | quant-ph/0702072 | Markovian Entanglement Networks | <|reference_start|>Markovian Entanglement Networks: Graphical models of probabilistic dependencies have been extensively investigated in the context of classical uncertainty. However, in some domains (most notably, in computational physics and quantum computing) the nature of the relevant uncertainty is non-classical, ... | arxiv | @article{la mura2007markovian,
title={Markovian Entanglement Networks},
author={Pierfrancesco La Mura and Lukasz Swiatczak},
journal={arXiv preprint arXiv:quant-ph/0702072},
year={2007},
number={HHL-77},
archivePrefix={arXiv},
eprint={quant-ph/0702072},
primaryClass={quant-ph cs.AI}
} | la mura2007markovian |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.