All Stories

  1. Laws of Quantum Programming
  2. Borrowing Dirty Qubits in Quantum Programs
  3. An Expressive Assertion Language for Quantum Programs
  4. Efficient Formal Verification of Quantum Error Correcting Programs
  5. Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
  6. Verification of Recursively Defined Quantum Circuits
  7. Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
  8. Automatic Test Pattern Generation for Robust Quantum Circuit Testing
  9. Approximate Equivalence Checking of Noisy Quantum Circuits
  10. Projection-based runtime assertions for testing and debugging Quantum programs
  11. Decomposition of quantum Markov chains and its applications
  12. Algorithmic analysis of termination problems for quantum programs
  13. Differential Privacy in Quantum Computation
  14. Invariants of quantum programs: characterisations and generation
  15. Invariants of quantum programs: characterisations and generation
  16. Analysis of quantum programs
  17. Introduction
  18. Logic for quantum programs
  19. Preliminaries
  20. Prospects
  21. Quantum case statements
  22. Quantum recursion
  23. Syntax and semantics of quantum programs
  24. Optimal simulation of Deutsch gates and the Fredkin gate
  25. Model-Checking Linear-Time Properties of Quantum Systems
  26. Symbolic Bisimulation for Quantum Processes
  27. Debugging quantum processes using monitoring measurements
  28. Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose
  29. (Un)decidable Problems about Reachability of Quantum Systems
  30. Model checking quantum Markov chains
  31. Termination of nondeterministic quantum programs
  32. Verification of quantum programs
  33. Five two-qubit gates are necessary for implementing the Toffoli gate
  34. Quantum Information-Flow Security: Noninterference and Access Control
  35. Probabilistic automata for computing with words
  36. Removing measurements from quantum walks
  37. Reachability Analysis of Recursive Quantum Markov Chains
  38. Reachability Probabilities of Quantum Markov Chains
  39. Bisimulation for Quantum Processes
  40. Semantic Analysis of Component-aspect Dynamism for Connector-based Architecture Styles
  41. Approximating Markov processes through filtration
  42. Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States
  43. Quantum programming: From theories to implementations
  44. Reachability and Termination Analysis of Concurrent Quantum Programs
  45. Floyd--hoare logic for quantum programs
  46. Any 2 ⊗ n subspace is locally distinguishable
  47. A Flowchart Language for Quantum Programming
  48. Bisimulation for quantum processes
  49. Bisimulation for quantum processes
  50. Local unambiguous discrimination with remaining entanglement
  51. Reasoning about cardinal directions between extended objects
  52. Quantum loop programs
  53. Locally indistinguishable subspaces spanned by three-qubit unextendible product bases
  54. Optimal simulation of a perfect entangler
  55. Quantum computation, quantum theory and AI
  56. An ADL-Approach to Specifying and Analyzing Centralized-Mode Architectural Connection
  57. Foundations of Quantum Programming (Extended Abstract)
  58. Perfect Distinguishability of Quantum Operations
  59. An Algebraic Language for Distributed Quantum Computing
  60. An algebra of quantum processes
  61. Dealing with uncertainty and fuzziness in intelligent systems
  62. Distinguishability of Quantum States by Separable Operations
  63. Parameter Estimation of Quantum Channels
  64. Soft constraint abstraction based on semiring homomorphism
  65. Perfect many-to-one teleportation with stabilizer states
  66. Deterministic distributed dense coding with stabilizer states
  67. Local Distinguishability of Multipartite Unitary Operations
  68. Existence of universal entangler
  69. Retraction and Generalized Extension of Computing With Words
  70. Commutativity of quantum weakest preconditions
  71. Probabilistic bisimulations for quantum processes
  72. Proof rules for the correctness of quantum programs
  73. Probabilistic bisimulations for quantum processes
  74. Quantum adiabatic computation and adiabatic conditions
  75. Publisher’s Note: Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication [Phys. Rev. Lett. 98 , 230502 (2007)]
  76. Discrimination between pure states and mixed states
  77. Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication
  78. Multipartite unlockable bound entanglement in the stabilizer formalism
  79. On fundamentals of fuzzy logic and soft computing and some applications
  80. State-Based Control of Fuzzy Discrete-Event Systems
  81. Topology, randomness and noise in process calculus
  82. Publisher’s Note: Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations [Phys. Rev. Lett.PRLTAO0031-9007 98 , 100503 (2007)]
  83. Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations
  84. Quantum logic and automata theory
  85. Sequential voting rules and multiple elections paradoxes
  86. Majorization in quantum adiabatic algorithms
  87. Relation between catalyst-assisted transformation and multiple-copy transformation for bipartite pure states
  88. Universal programmable devices for unambiguous discrimination
  89. Some Issues in Quantum Information Theory
  90. A relation between fidelity and quantum adiabatic evolution
  91. Partial recovery of quantum entanglement
  92. A modified quantum adiabatic evolution for the Deutsch–Jozsa problem
  93. Identification and Distance Measures of Measurement Apparatus
  94. Linguistic quantifiers modeled by Sugeno integrals
  95. Unambiguous discrimination of mixed quantum states
  96. Unambiguous discrimination among quantum operations
  97. Observability and decentralized control of fuzzy discrete-event systems
  98. Boundary effect of deterministic dense coding
  99. Similarity-Based Supervisory Control of Discrete-Event Systems
  100. A theory of computation based on quantum logic (I)
  101. Local cloning of two product states
  102. Entanglement-assisted transformation is asymptotically equivalent to multiple-copy transformation
  103. π-calculus with noisy channels
  104. Trade-off between multiple-copy transformation and entanglement catalysis
  105. Multiple-copy entanglement transformation and entanglement catalysis
  106. Supervisory Control of Fuzzy Discrete Event Systems
  107. Optimal conclusive discrimination of two states can be achieved locally
  108. Catalyst-Assisted Probabilistic Entanglement Transformation
  109. Knowledge transformation and fusion in diagnostic systems
  110. Efficiency of deterministic entanglement transformation
  111. A theory of computation based on quantum logic (I)
  112. The existence of quantum entanglement catalysts
  113. Generalized Region Connection Calculus
  114. Local discrimination of maximally entangled states in canonical form
  115. Comparability of multipartite entanglement
  116. Unambiguous discrimination between mixed quantum states
  117. When catalysis is useful for probabilistic entanglement transformation
  118. Process algebra approach to reasoning about concurrent actions
  119. Quantum operation, quantum Fourier transform and semi-definite programming
  120. Characterizations of quantum automata
  121. Reasoning about probabilistic sequential programs in a probabilistic logic
  122. Region Connection Calculus: Its models and composition table
  123. Lower bound on inconclusive probability of unambiguous discrimination
  124. A formal model of computing with words
  125. Universal quantum-copying machines: a sufficient and necessary condition
  126. Lattice-theoretic models of conjectures, hypotheses and consequences
  127. Wootters–Zurek quantum-copying machine: the higher-dimensional case
  128. Set discrimination of quantum states
  129. Universal and original-preserving quantum copying is impossible
  130. Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination
  131. Probabilistic cloning and deleting of quantum states
  132. Additive models of probabilistic processes
  133. Bisimulation indexes and their applications
  134. Implication operators in fuzzy logic
  135. Upper bound for the success probability of unambiguous discrimination among quantum states
  136. Recursive equations in higher-order process calculi
  137. Topology in Process Calculus
  138. Bisimulation Indexes Induced by Metrics on Actions
  139. Bisimulation and Trace Limits of Agents
  140. Conclusion
  141. Fuzzy Topology Based on Residuated Lattice-Valued Logic
  142. Introduction
  143. Limit Behavior of Agents
  144. Near Bisimulations Defined by Closures
  145. Process Calculus
  146. Weak confluence and τ-inertness
  147. Approximate Reasoning Based on Similarity
  148. Approximate Bisimilarity
  149. Topology in process calculus (I): Limit behaviour of agents
  150. A shorter proof to uniqueness of solutions of equations
  151. Phase semantics for a pure noncommutative linear propositional logic
  152. Limits of Agents in Process Calculus
  153. Perturbation of fuzzy reasoning
  154. Fuzzy Logic and Soft Computing
  155. A model of reasoning about knowledge
  156. Compactness in fuzzy logic
  157. Approximate reasoning with linguistic modifiers
  158. Approximate reasoning with linguistic modifiers
  159. Quantifiers, modifiers and qualifiers in fuzzy logic
  160. When is the ideal completion of abstract basis algebraic
  161. Institutions of variable truth values: An approach in the ordered style
  162. Putting consistent theories together in institutions
  163. On the method of neighborhood systems in fuzzy topology
  164. A logic for approximate reasoning
  165. Fuzzifying topology based on complete residuated lattice-valued logic (I)
  166. A new approach for fuzzy topology (III)
  167. Compactness in fuzzifying topology
  168. Fuzzifying uniform spaces
  169. A new approach for fuzzy topology (II)
  170. COMPACTNESS, THE LÖWENHEIM-SKOLEM PROPERTY AND THE DIRECT PRODUCT OF LATTICES OF TRUTH VALUES
  171. THE FUNDAMENTAL THEOREM OF ULTRAPRODUCT IN PAVELKA'S LOGIC
  172. A new approach for fuzzy topology (I)
  173. Deduction Theorem for Many-Valued Inference
  174. The alternativity measures of fuzzy sets
  175. Reasonableness of the compositional rule of fuzzy inference
  176. On probalistic normed spaces under τ T , L
  177. On a class of non-causal triangle functions
  178. On ϵ-fuzzy sets
  179. On standard models of fuzzy modal logics
  180. Report from Jiangxi Province, People's Republic of China
  181. SOME NOTES ON MULTIDIMENSIONAL FUZZY REASONING
  182. Fuzzy semilattices
  183. A counter-example of Gottwald's theorem
  184. On Zadeh's method for interpreting linguistically quantified proposition
  185. Predicate Transformer Semantics of Quantum Programs
  186. Quantifiers, modifiers and qualifiers in fuzzy logic