Sciweavers

4084 search results - page 15 / 817
» The Method of Quantum Clustering
Sort
View
FUIN
2008
107views more  FUIN 2008»
15 years 1 months ago
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
Kimmo Varpaaniemi, Leo Ojala
APVIS
2006
15 years 2 months ago
Method for drawing intersecting clustered graphs and its application to web ontology language
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
Hiroki Omote, Kozo Sugiyama
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 10 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
ISMVL
2003
IEEE
68views Hardware» more  ISMVL 2003»
15 years 6 months ago
Multi-Output Galois Field Sum of Products Synthesis with New Quantum Cascades
Galois Field Sum of Products (GFSOP) leads to efficient multi-valued reversible circuit synthesis using quantum gates. In this paper, we propose a new generalization of ternary To...
Mozammel H. A. Khan, Marek A. Perkowski, Pawel Ker...
SYNTHESE
2011
177views more  SYNTHESE 2011»
14 years 8 months ago
Quantum logic as a dynamic logic
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others1 , our an...
Alexandru Baltag, Sonja Smets