Search results for "TheoryofComputation_GENERAL"
showing 10 items of 106 documents
On-chip generation of high-dimensional entangled quantum states and their coherent control
2017
Optical quantum states based on entangled photons are essential for solving questions in fundamental physics and are at the heart of quantum information science1. Specifically, the realization of high-dimensional states (D-level quantum systems, that is, qudits, with D > 2) and their control are necessary for fundamental investigations of quantum mechanics2, for increasing the sensitivity of quantum imaging schemes3, for improving the robustness and key rate of quantum communication protocols4, for enabling a richer variety of quantum simulations5, and for achieving more efficient and error-tolerant quantum computation6. Integrated photonics has recently become a leading platform for the co…
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
2015
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\rightarrow \{0,1\}$ as a black box. We are asked to determine if there exist $(u,v) \in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds are trivial ($\Omega(\sqrt{n})$ and $\Omega(n)$, respectively) and there is no known matching upper …
Classification of the hadronic decays of the Z$^0$ into b and c quark pairs using a neural network
1992
A classifier based on a feed-forward neural network has been used for separating a sample of about 123 500 selected hadronic decays of the Z 0 , collected by DELPHI during 1991, into three classes according to the flavour of the original quark pair: u u +d d +s s (unresolved), c c and b b . The classification has been used to compute the partial widths of the Z 0 into b and c quark pairs. This gave Γ c c /Γ h = 0.151 ± 0.008 ( stat. ) ± 0.041 ( syst. ) , Γ b b /Γ h = 0.232±0.005 ( stat. )±0.017 ( syst. ) .
Robust dynamic cooperative games
2009
Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. Recent works address situations where the values of coalitions are modelled by random variables. In this work we still consider the values of coalitions as uncertain, but model them as unknown but bounded disturbances. We do not focus on solving a specific game, but rather consider a family of games described by a polyhedron: each point in the polyhedron is a vector of coalitions’ values and corresponds to a specific game. We consider a dynamic context where while we know with certainty the average value of each coalition on the long run, at each t…
A methodology to select the price criterion in public procurement
2015
[EN] The construction sector is a key driver for economic growth in any nation and public procurement is one of its pillars hence the importance of the study and investigation of its mechanisms, especially tendering criteria. Price is the main deciding factor for most tenders and projects must have an appropriate base price relative to market price to avoid problems during the execution of the project. Most research on price criteria has been developed from the point of view of bidders and has discussed the development of tools and methodologies for determining the optimal bid price. In this paper we propose a methodology for public procurement procedures from the point of view of the admin…
Quantum Computers and Quantum Automata
2000
Quantum computation is a most challenging project involving research both by physicists and computer scientists. The principles of quantum computation differ from the principles of classical computation very much. When quantum computers become available, the public-key cryptography will change radically. It is no exaggeration to assert that building a quantum computer means building a universal code-breaking machine. Quantum finite automata are expected to appear much sooner. They do not generalize deterministic finite automata. Their capabilities are incomparable.
Quantum Real - Time Turing Machine
2001
The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.
Public Procurement of Information Systems – A Dialectical Analysis
2015
The paper III and IV are excluded from the dissertation with respect to copyright. In this thesis I identify dialectics in public procurement of Information Systems (IS), and for some of the dialectics I identify synthesis. My study is based on a research gap, revealed through a literature review that I conducted. Public procurement in general and public procurement of IS in particular has been a neglected field of study. This is surprising, given the fact that public procurement account for a high proportion of the gross domestic product in the western world, and that procurement of IS especially is a highly complex task. My literature review identified a lack of research on the challenges…
Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application
2008
We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…
Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity
2018
Abstract This paper focuses on multiproduct trading with indivisibilities and where a representative agent may have non-monotonic preferences. In this framework, the set of firms’ profits (which comes from efficient subgame perfect Nash equilibria) is the Pareto frontier of some projection of the core of the game. We show that under monotonicity efficient subgame perfect Nash equilibria are achieved by single offers and the equilibrium characterization is easy to obtain. When dealing with non-monotonic preferences the problem becomes more challenging. Then, we define a pair of primal–dual linear programming problems that fully identifies the core of the game. A set of modified versions of t…