Sciweavers

587 search results - page 13 / 118
» Quantum computation and quantum information
Sort
View
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 4 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ENGL
2008
170views more  ENGL 2008»
13 years 11 months ago
Design of Reversible/Quantum Ternary Comparator Circuits
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...
Mozammel H. A. Khan
UC
2009
Springer
14 years 5 months ago
Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
Frédéric Prost, Chaouki Zerrari
CPHYSICS
2006
85views more  CPHYSICS 2006»
13 years 11 months ago
Simulation of n-qubit quantum systems. II. Separability and entanglement
Studies on the entanglement of n-qubit quantum systems have attracted a lot of interest during recent years. Despite the central role of entanglement in quantum information theory...
T. Radtke, S. Fritzsche
QCQC
1998
Springer
121views Communications» more  QCQC 1998»
14 years 3 months ago
What Information Theory Can Tell Us About Quantum Reality
Abstract. An investigation of Einstein's "physical" reality and the concept of quantum reality in terms of information theory suggests a solution to quantum paradoxe...
Christoph Adami, Nicolas J. Cerf